Hi Daniel,
This is what I thought about as well. But does the order be the same for all
documents. Another alternative would be to have a document within a
document, which means that one document would represent the vector with all
the values for a metadata field.
Doc (ISBN: 0-201-39829-X) // ind
RangeQuery is a good approach. Put fields on your documents like age.
The only tricky thing is that the comparisons are all done
lexicographically rather that numerically. Lucene has a built-in
routine to convert dates into a monotonic lexicographic sequence
(DateField.timeToString). For positiv
I will be out of the office starting 10/13/2004 and will not return until
10/20/2004.
I will respond to your message when I return. For CashEdge Dev issues,
please contact Aravind Ravi Subramania or Subramaniam Sundaram, for
other issues, please contact Dave Wong.
Thank you.
--
Hi,
As I remember right there was a discussion about the 3* vs 2* index size
disk usage of a compound index during optimization, was that patched in
1.4.2?
Cheers,
Tea
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional
If i do the following...
SortField score_sort = ScoreField.FIELD_SCORE;
Sort sort = new Sort(score_sort);
hits = searcher.search(query, sort);
I get the results orderd by the lucene score.
also, if i do...
SortField rank_sort = new SortField(RANK_FIELD, true);
Sort sort = new Sort(rank_sort);
h
Use SortField.FIELD_SCORE as the first element in the SortField[] when you
pass it to sort method.
Praveen
- Original Message -
From: "Chris Fraschetti" <[EMAIL PROTECTED]>
To: "Lucene Users List" <[EMAIL PROTECTED]>
Sent: Wednesday, October 13, 2004 3:19 PM
Subject: Re: sorting and scor
Will do.
My other question was: the 'score' for a page as far as I know, is
only accessible post-search... and is not contained in a field. How
can I specift the score as a sort field when there is no field 'score'
?
-Chris
On Wed, 13 Oct 2004 21:06:14 +0200, Daniel Naber
<[EMAIL PROTECTED]> wr
On Wednesday 13 October 2004 20:44, Chris Fraschetti wrote:
> I haven't seen an example on how to apply two sorts to a search.. can
> you help me out with that?
Check out the documentation for Sort(SortField[] fields) and SortField.
Regards
Daniel
--
http://www.danielnaber.de
---
Paul Elschot wrote:
Along with that, is there a simple way to assign a new scorer to the
searcher? So I can use the same lucene algorithm for my hits, but
tweak it a little to fit my needs?
There is no one to one relationship between a seacher and a scorer.
But you can use a different Similarity i
I haven't seen an example on how to apply two sorts to a search.. can
you help me out with that?
-Chris
On Wed, 13 Oct 2004 20:03:05 +0200, Daniel Naber
<[EMAIL PROTECTED]> wrote:
> On Wednesday 13 October 2004 19:53, Chris Fraschetti wrote:
>
> > Is there a way I can (without recompiling) ...
Hello,
I am using the IndexHTML class to index around 30,000 files and it is
working fine. Question that I have is, is there a way to add multiple
fields to index so that when the actual search is performed I can
extract the exact match.
E.g.
the fields can be
1) title - abc
2) name - foo inc,
3
On Wednesday 13 October 2004 19:53, Chris Fraschetti wrote:
> Is there a way I can (without recompiling) ... make the score have
> priority and then my sort take affect when two results have the same
> rank?
>
> Along with that, is there a simple way to assign a new scorer to the
> searcher? So I c
On Wednesday 13 October 2004 19:53, Chris Fraschetti wrote:
> Is there a way I can (without recompiling) ... make the score have
> priority and then my sort take affect when two results have the same
> rank?
You can just (explicitly) sort by score and use some other field as a
second sort key.
Is there a way I can (without recompiling) ... make the score have
priority and then my sort take affect when two results have the same
rank?
Along with that, is there a simple way to assign a new scorer to the
searcher? So I can use the same lucene algorithm for my hits, but
tweak it a little to
I think it's possible to make a field encrypted by an symmetric encryption
algorithms just the same as the compressed field and algorithms such like
DES can be used with little performance loss.
If the ability to block reverse engineering is critical, you should use PKI
and would result more and m
On Oct 13, 2004, at 15:26, Nader Henein wrote:
Well, are you "storing" any data for retrieval from the index, because
you could encrypt the actual data and then encrypt the search string
public key style.
Alternatively, write your index to an encrypted volume... something
along the line of FileV
Well, are you "storing" any data for retrieval from the index, because
you could encrypt the actual data and then encrypt the search string
public key style.
Nader Henein
Weir, Michael wrote:
We need to have index files that can't be reverse engineered, etc. An
obvious approach would be to write
We need to have index files that can't be reverse engineered, etc. An
obvious approach would be to write a 'FSEncryptedDirectory' class, but
sounds like a performance killer.
Does anyone have experience in making an index secure?
Thanks for any help,
Michael Weir
This message may conta
Dera - give the troubleshooting techniques provided here a try:
http://wiki.apache.org/jakarta-lucene/AnalysisParalysis
Provide us with a more detailed example of a sentence of text you
indexed and how you are searching (using QueryParser, I presume) and we
can likely offer more assistance.
I have been indexing my flat files (plain text documents) using
WhitespaceAnalyzer, in order not to miss out any characters during tokenizing.
The results are satisfactory when I use exact search criteria for
searching. However, I am unable to get any results or hits when I use
wildcard searchi
On Oct 13, 2004, at 3:14 AM, Karthik N S wrote:
I was Curious to Know the Difference between ParallelMultiSearcher and
MultiSearcher ,
1) Is the working internal functionality of these are same or
different .
They are different internally. Externally they should return identical
results and n
Hi
Apologies for the Long wait..
My Linux system on ulimit -a respresent
core file size (blocks, -c) 0
data seg size (kbytes, -d) unlimited
file size(blocks, -f) unlimited
max locked memory (kbytes, -l) unlimited
On Wednesday 13 October 2004 08:45, Michael Hartmann wrote:
> The field should store a "vector" of values that
> indicate whether or not a term exists in a document or not.
You can just add more than one field with the same name but different
values per document, then searching for single values
Hi
Guys
Apologies..
I was Curious to Know the Difference between ParallelMultiSearcher and
MultiSearcher ,
1) Is the working internal functionality of these are same or different .
2) In terms of time domain do these differ when searching same no of fields
/ words .
3)What
24 matches
Mail list logo
