have deployed a 5-sharded infrastructure where: shard1 has 3124422 docs
shard2 has 920414 docs shard3 has 602772 docs shard4 has 2083492 docs shard5
has 11915639 docs Indexes total size: 100GB
The OS is Linux x86_64 (Fedora release 8) with vMem equal to 7872420 and I
run the server using Jetty (f
have deployed a 5-sharded infrastructure where: shard1 has 3124422 docs
shard2 has 920414 docs shard3 has 602772 docs shard4 has 2083492 docs shard5
has 11915639 docs Indexes total size: 100GB
The OS is Linux x86_64 (Fedora release 8) with vMem equal to 7872420 and I
run the server using Jetty (f
1 - Yes, all the shards are in the same machine
2 - The machine RAM is 7.8GB and I assign 3.4GB to Solr server
3 - The shards sizes (GB) are 17, 5, 3, 11, 64
--
View this message in context:
http://lucene.472066.n3.nabble.com/Improving-Solr-performance-tp2210843p2211135.html
Sent from the Solr -
The reason of this distribution is the kind of the documents. In spite of
having the same schema structure (and solr conf), a document belongs to 1 of
5 different kinds.
Each kind corresponds to a concrete shard and due to this, the implemented
client tool avoids searching in all the shards when
Hello,
I would like to know if there is a trivial procedure/tool for displaying the
number of appearances of each token from query results.
Thanks
--
View this message in context:
http://lucene.472066.n3.nabble.com/Token-Counter-tp2227795p2227795.html
Sent from the Solr - User mailing list ar
As I understand, a faceted search would be useful if keywords is a
multivalued field and the its field value is just a token.
I want to display the occurences of the tokens wich appear in a indexed (and
stored) text field.
--
View this message in context:
http://lucene.472066.n3.nabble.com/Tok
On the one hand, I found really interesting those comments about the reasons
for sharding. Documentation agrees you about why to split an index in
several shards (big sizes problems) but I don't find any explanation about
the inconvenients as an Access Control List. I guess there should be some
an
The tests are performed with a selfmade program. The arguments are the number
of threads and the path to a file which contains available queries (in the
last test only one). When each thread is created, it gets the current date
(in milisecs), and when it gets the response from the query, the threa
