Thanks for committing! As soon as there is a way to simply plug in other field caches, I will implement a FieldCache implementation similar to LongFieldCache, that can handle trie-encoded fields.
----- Uwe Schindler H.-H.-Meier-Allee 63, D-28213 Bremen http://www.thetaphi.de eMail: [EMAIL PROTECTED] > -----Original Message----- > From: Michael McCandless (JIRA) [mailto:[EMAIL PROTECTED] > Sent: Wednesday, December 03, 2008 8:40 PM > To: java-dev@lucene.apache.org > Subject: [jira] Resolved: (LUCENE-1470) Add TrieRangeQuery to contrib > > > [ https://issues.apache.org/jira/browse/LUCENE- > 1470?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ] > > Michael McCandless resolved LUCENE-1470. > ---------------------------------------- > > Resolution: Fixed > Fix Version/s: 2.9 > Lucene Fields: [New, Patch Available] (was: [Patch Available, New]) > > Committed revision 723031. > > Thanks Uwe! > > > Add TrieRangeQuery to contrib > > ----------------------------- > > > > Key: LUCENE-1470 > > URL: https://issues.apache.org/jira/browse/LUCENE-1470 > > Project: Lucene - Java > > Issue Type: New Feature > > Components: contrib/* > > Affects Versions: 2.4 > > Reporter: Uwe Schindler > > Assignee: Michael McCandless > > Fix For: 2.9 > > > > Attachments: LUCENE-1470.patch, LUCENE-1470.patch, LUCENE- > 1470.patch, LUCENE-1470.patch, LUCENE-1470.patch, LUCENE-1470.patch, > LUCENE-1470.patch > > > > > > According to the thread in java-dev (http://www.gossamer- > threads.com/lists/lucene/java-dev/67807 and http://www.gossamer- > threads.com/lists/lucene/java-dev/67839), I want to include my fast > numerical range query implementation into lucene contrib-queries. > > I implemented (based on RangeFilter) another approach for faster > > RangeQueries, based on longs stored in index in a special format. > > The idea behind this is to store the longs in different precision in > index > > and partition the query range in such a way, that the outer boundaries > are > > search using terms from the highest precision, but the center of the > search > > Range with lower precision. The implementation stores the longs in 8 > > different precisions (using a class called TrieUtils). It also has > support > > for Doubles, using the IEEE 754 floating-point "double format" bit > layout > > with some bit mappings to make them binary sortable. The approach is > used in > > rather big indexes, query times are even on low performance desktop > > computers <<100 ms (!) for very big ranges on indexes with 500000 docs. > > I called this RangeQuery variant and format "TrieRangeRange" query > because > > the idea looks like the well-known Trie structures (but it is not > identical > > to real tries, but algorithms are related to it). > > -- > This message is automatically generated by JIRA. > - > You can reply to this email to add a comment to the issue online. > > > --------------------------------------------------------------------- > To unsubscribe, e-mail: [EMAIL PROTECTED] > For additional commands, e-mail: [EMAIL PROTECTED] --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
