Regarding Solr performance issue I was facing, I upgraded my Solr machine
to have
8 cores
56 GB RAM
8 GB JVM
However, unfortunately, I am still getting delays. I have run
* the query "Football" with start=0 and rows=10 and it took around 7.329
seconds
* the query "Football" with start=1000 and
Greetings!
I'm new to Solr Spellchecking... I have yet to get it to work.
Attached is a snippet from my solrconfig.xml pertaining to my spellcheck
efforts.
When I use the Admin UI (v5.3.0), and check the spellcheck.build box, I
get a NullPointerException stacktrace. The actual stacktrace
I've seen a similar requirement to this recently.
Basically, a sorting requirement that is close to impossible to
implement as a scoring/boosting formula, because the *position* of the
result features in the score, and that's not something I believe can be
done right now.
The way we solved the
Would result grouping work here? If the group key was "paid", then
you'd get two groups back, "paid" an "unpaid". Within each group you'd
have results ordered by rank. This would work for a page or two, but
eventually you'd be in a spot where you'd have to over sample, i.e.
return pages*X in each
I am using Solr 4.2
For some reason I cannot find an example of http://lucene.472066.n3.nabble.com/How-to-use-FuzzyQuery-in-schema-xml-tp4233900.html
Sent from the Solr - User mailing list archive at Nabble.com.
Hi Upayavira & Walter & everyone else
About the requirements:1. I need to return no more than 3 paid results on a
page of 12 results2. Paid results should be sorted like this: let's say a user
is searching for: "chocolate almonds cake"Now, lets say that 2000 results match
the query and there
By far the easiest solution is to do two queries from the front end.
One requesting three paid results, and one requesting nine unpaid results.
If all the results are in one collection, use “fq” to select paid/unpaid.
That is going to be fast and there is zero doubt that it will do the right
Hi
I am trying to use SimpleNaiveBayesClassifier in my solr project. Currently
looking at its test base ClassificationTestBase.java.
The sample test code inside seems like that classifier read the whole index
db to train the model everytime when classification happened for
inputDocument. or am I
In which case you'd be happy to wait for 30s for it to complete, in
which case the func or frange function query should be fine.
Upayavira
On Fri, Oct 9, 2015, at 05:55 PM, Aman Tandon wrote:
> Thanks Mikhail the suggestion. I will try that on monday will let you
> know.
>
> *@*Walter This was
After several days, we finally get the real requirement. It really does waste a
lot of time and energy when people won’t tell us that.
wunder
Walter Underwood
wun...@wunderwood.org
http://observer.wunderwood.org/ (my blog)
> On Oct 10, 2015, at 8:19 AM, Upayavira wrote:
>
>
On 10/10/2015 2:55 AM, Salman Ansari wrote:
> Thanks Shawn for your response. Based on that
> 1) Can you please direct me where I can get more information about cold
> shard vs hot shard?
I don't know of any information out there about hot/cold shards. I can
describe it, though:
A split point
Hi
I am trying to use NaiveBayesClassifier in my solr project. Currently
looking at its test case ClassificationTestBase.java.
Below codes seems like that classifier read the whole index db to train the
model everytime when classification happened for inputDocument. or am I
misunderstanding
Thanks Shawn for your response. Based on that
1) Can you please direct me where I can get more information about cold
shard vs hot shard?
2) That 10GB number assumes there's no other software on the machine, like
a database server or a webserver.
Yes the machine is dedicated for Solr
3) How
13 matches
Mail list logo