Yeah the SOLR-1093 itself is a little vague but the core idea is to run
multiple queries in a request. The patch is an implementation that runs the
sub queries serially.
On Wed, Aug 22, 2012 at 10:27 AM, Mikhail Khludnev <
mkhlud...@griddynamics.com> wrote:
> SOLR-1093, which is a little bit vagu
SOLR-1093, which is a little bit vague itself, doesn't help for
implementing my approach, because second query is build in according to the
results of the first one.
On Wed, Aug 22, 2012 at 3:37 PM, Karthick Duraisamy Soundararaj <
d.s.karth...@gmail.com> wrote:
> Hey Mikhail,
>
Hey Mikhail,
Yes. Thats a very good idea and a certain solution for my
problem:). But two solr calls for each search results might be a concern.
Maybe I should tweak https://issues.apache.org/jira/browse/SOLR-1093 a
little bit so it takes the grouping results and boots them.
Othe
one more idea:
first search is grouped by brand with limit 1, it gives you a most relevant
products for this particular search. than second search boost top products
from the first search result by ie. q=original:query
ID:(44,56,78,99,22)^1000
On Tue, Aug 21, 2012 at 8:04 PM, Karthick Duraisamy S
On Tue, Aug 21, 2012 at 11:32 AM, Tanguy Moal wrote:
> Sorry then, my approach really disables pagination jumps. You're left with
> the 'next' button only, or an "infinite-scroll" type of pagination, which
> may not be what you wanted to do...
You are right.
> Did you try disabling tf/idf and
Sorry then, my approach really disables pagination jumps. You're left with
the 'next' button only, or an "infinite-scroll" type of pagination, which
may not be what you wanted to do...
Did you try disabling tf/idf and using random field as a secondary sort ?
I'm pretty sure it will give you the be
Hello Tanguy,
I need pagination. The problem with your approach
is that, to achieve pagination, you need to do a sort at application level
for sorting rather than at the solr level which I think would become messy.
Do you see a way around this?
Thanks,
Karthick
On Tue, Aug
Hello Karthick,
2012/8/21 Karthick Duraisamy Soundararaj
> *"Find all the highest scoring document for each manufacuturer in the
> current result set and place them ahead of the rest. Here as you can see,
> the idea is to display one product from each unique manufacturer first"*.
> Now to decid
Hi Lance,
Thanks for your response. Wouldnt randomizing affect
relevancy? Maybe I should explain my problem better:
Lets say there are 1000 matches for a search of "Sofas". For
the sake of simplcity, lets assume all of these 1000 matches(1000 sofas)
have same Merchant
If you do the same search twice in a row, the second search takes < 3
ms. Try finding your base result set and then augmenting it with a
second search within the first result set.
You can sort from a function call. Sorting is multi-level, so you can
make one of the levels random.
Does this app ha
Hi Mikhail,
You are correct. "[+] show 6 result.." will work but
it wouldn't suit my requirements. This is a question of user experience
right?
Imagine if the product manager comes to you and says I dont want to see
"[+] show 6 result.." and I want the results to be diverse bu
Hello,
I don't believe your task can be solved by playing with scoring/collector
or shuffling.
For me it's absolutely Grouping usecase (despite I don't really know this
feature well).
> Grouping cannot solve the problem because I dont want to limit the number
of results showed based on the groupi
Tanguy,
You idea is perfect for cases where there is a too many
documents with 80-90% documents having same value for a particular field.
As an example, your idea is ideal for, lets say we have 10 documents in
total like this,
doc1 : Kellog's
doc2 : Kellog's
doc3 : Kellog's
Hello,
I don't know if that could help, but if I understood your issue, you have a
lot of documents with the same or very close scores. Moreover I think you
get your matches in Merchant order (more or less) because they must be
indexed in that very same order, so solr returns documents of same sco
Hello Mikhail,
Thank you for the reply. In terms of user
experience, I want to spread out the products from same brand farther from
each other, *atleast* in the first 50-100 results we display. I am thinking
about two different approaches as solution.
Hello,
I've got the problem description below. Can you explain the expected user
experience, and/or solution approach before diving into the algorithm
design?
Thanks
On Sat, Aug 18, 2012 at 2:50 AM, Karthick Duraisamy Soundararaj <
karthick.soundara...@gmail.com> wrote:
> My problem is that whe
16 matches
Mail list logo
