if we can update only one field of a document in the index, a lot of
jobs can be done here !
梦的开始挣扎于城市的边缘
心的远方执着在脚步的瞬间
我的宿命埋藏了寂寞的永远
we now have 0.15 billion documents, which source size 1.5 TB, on 16 shards .
I am very interested how you get your job done
梦的开始挣扎于城市的边缘
心的远方执着在脚步的瞬间
我的宿命埋藏了寂寞的永远
2010/8/26 Nigel :
> I'm curious about what the largest Lucene installations are, in terms of:
>
> - Greatest number of documents (
ocs into a
> DocSet(bitset). Also getting facet fields into memory(doc id->field
> value) then loop the DocSet to count it.
>
> 2010/8/30 fulin tang :
>> we are building a search system on top of lucene, and we are now
>> looking for a facet feature
>>
>> So
That is exactly what I am looking for now !
Our mail search system has a field name flags, like read/unread etc,
and it will change after the email indexed , so we need an update .
But we only update one field, more exactly, one Field.Index.NOT_ANALYZED and
Field.Store.YES field , how can we av
we are building a search system on top of lucene, and we are now
looking for a facet feature
So it there a easy way to do this ?
btw, we do not want to switch to solr just for this!
-
To unsubscribe, e-mail: java-user-unsubscr..
another way to do this: pinyin4j
you can trans all Chinese words to pinyin form first, and index the
pinyin form as a field, then you can search on them
see: http://www.slideshare.net/tangfl/ss-2364878
in which we implement a pinyin search for our music search
2009/12/16 Weiwei Wang :
> Thanks
Make sure your analyzer has called strToLower when index the data
2009/11/26 Savvas-Andreas Moysidis :
> hi,
>
> maybe you could not break but rather collect them in an ordered collection.
> If it's a web app you are having you can then pass it up your view layer
> wrapped in json?
>
> savvas
>
>
By the way , we search Chinese words, so Trie tree looks not perfect
for us either
2009/11/27 fulin tang :
> We have the same needs in our music search, and we found this is not a
> good approach for performance reason .
>
> Did any one have experience of implement the autosuggestio
We have the same needs in our music search, and we found this is not a
good approach for performance reason .
Did any one have experience of implement the autosuggestion in a heavy
product environment ?
Any suggestions ?
2009/11/26 Anshum :
> Try this,
> Change the code as required:
> -
Maybe you should take a look at the Scorer and Similarity series
classes , they will show you how the score is calculated , make some
change of them, and you will get what you want.
We have the same problem and we get it done by write subclasses of
DefaultSimilarity and BooleanScorer
2009/11
Thanks all for the good suggestions !
But any idea of the storage? How can we make the indexes as small as possible?
We know compressing is the only way, but when and where to compress is
best for search?
Thanks all again!
2009/11/24 Kay Kay :
> fulin tang wrote:
>>
>> We a
We are going to add full-text search for our mailbox service .
The problem is we have more than 1 PB mails there , and obviously we
don't want to add another PB storage for search service , so we hope
the index data will be small enough for storage while the search keeps
fast .
The lucky is that
12 matches
Mail list logo
