lucene-java-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Mihai Caraman <caraman.mi...@gmail.com>
Subject Re: FacetedSearch DrillDown
Date Wed, 21 Sep 2011 19:44:04 GMT
2011/9/21 Shai Erera <serera@gmail.com>

> What do you mean "up to lvl3"?
>
"as *deep *as lvl3" :P
In this example, let's look at these lvls as a tree(like n-ary tree) with
root in a unique value at(the top) lvl 1

..one with category [l1, l2, l3] and one with [l1, l2],

All documents have the same depth (of categories) so as:
            lvl1       lvl2     lvl3
doc1: monday, 1pm,  3min
doc2: monday, 1pm,  4min

doc3: monday, 2pm,  3min

and you ask to count "l1", you will get2.

 i'm looking to get(with drilling all the way down) (with *:number* being
the value=number of results):

monday:3{
  -1pm:2{
    -3min:1
    -4min:1
   }
  -2pm:1{
    -3min:1
   }
}

I've managed to do this with repetive searches
I search for monday, get 1pm,2pm
    Then I search for monday/1pm , get 3min,4min
        And Then I search for monday/1pm/3min... and so forth for every
branch in this *categoryTree*

The question being, is there a faster way?isn't DrillDown.query(...) meant
for this?

Where can i find more documentation on this kind of search, I'm interested
in occupied space and computing time, because I imagine it's not meant for
huge depths or lots of categories.

Again thanks for the reply and I appreciate very much this fantastic
feature!
Mihai

Mime
  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message