[
https://issues.apache.org/jira/browse/LUCENE-1606?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12781037#action_12781037
]
Robert Muir edited comment on LUCENE-1606 at 11/21/09 7:47 PM:
---------------------------------------------------------------
Mark, one last comment. I want to mention this impl is largely unoptimized
(from a code perspective, but the algorithm is better)
I think you see that from the NNNNN?? being 2.3ms on average versus 1.9, not
that I am sure that isnt just a random hiccup.
So I want to incorporate the logic of some of this benchmark into the tests, so
that we can improve the actual code impl. to speed up cases like that.
While i focus on the scalability, i know a lot of people have small indexes and
maybe lots of qps and I don't want to slow them down.
Some of this is easy, for example we make State.getSortedTransitionArray
public, so we don't have to convert from arrays to lists to arrays and such,
for no good reason.
was (Author: rcmuir):
Mark, one last comment. I want to mention this impl is largely unoptimized
(from a code perspective, but the algorithm is better)
I think you see that from the NNNNN?? being 2.3ms on average versus 1.9, not
that I am sure that isnt just a random hiccup.
So I want to incorporate the logic of some of this benchmark into the tests, so
that we can improve the actual code impl. to speed up cases like that.
While i focus on the scalability, i know a lot of people have small indexes and
maybe lots of qps and I don't want to slow them down.
Some of this is easy, for example we make Transition.getSortedTransitionArray
public, so we don't have to convert from arrays to lists to arrays and such,
for no good reason.
> Automaton Query/Filter (scalable regex)
> ---------------------------------------
>
> Key: LUCENE-1606
> URL: https://issues.apache.org/jira/browse/LUCENE-1606
> Project: Lucene - Java
> Issue Type: New Feature
> Components: Search
> Reporter: Robert Muir
> Assignee: Robert Muir
> Priority: Minor
> Fix For: 3.1
>
> Attachments: automaton.patch, automatonMultiQuery.patch,
> automatonmultiqueryfuzzy.patch, automatonMultiQuerySmart.patch,
> automatonWithWildCard.patch, automatonWithWildCard2.patch,
> BenchWildcard.java, LUCENE-1606.patch, LUCENE-1606.patch, LUCENE-1606.patch,
> LUCENE-1606.patch, LUCENE-1606.patch, LUCENE-1606.patch, LUCENE-1606.patch,
> LUCENE-1606.patch, LUCENE-1606_nodep.patch
>
>
> Attached is a patch for an AutomatonQuery/Filter (name can change if its not
> suitable).
> Whereas the out-of-box contrib RegexQuery is nice, I have some very large
> indexes (100M+ unique tokens) where queries are quite slow, 2 minutes, etc.
> Additionally all of the existing RegexQuery implementations in Lucene are
> really slow if there is no constant prefix. This implementation does not
> depend upon constant prefix, and runs the same query in 640ms.
> Some use cases I envision:
> 1. lexicography/etc on large text corpora
> 2. looking for things such as urls where the prefix is not constant (http://
> or ftp://)
> The Filter uses the BRICS package (http://www.brics.dk/automaton/) to convert
> regular expressions into a DFA. Then, the filter "enumerates" terms in a
> special way, by using the underlying state machine. Here is my short
> description from the comments:
> The algorithm here is pretty basic. Enumerate terms but instead of a
> binary accept/reject do:
>
> 1. Look at the portion that is OK (did not enter a reject state in the
> DFA)
> 2. Generate the next possible String and seek to that.
> the Query simply wraps the filter with ConstantScoreQuery.
> I did not include the automaton.jar inside the patch but it can be downloaded
> from http://www.brics.dk/automaton/ and is BSD-licensed.
--
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: java-dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: java-dev-h...@lucene.apache.org
