Mailing-List: contact java-user-help@lucene.apache.org; run by ezmlm
Precedence: bulk
Reply-To: java-user@lucene.apache.org
Received-SPF: pass (nike.apache.org: domain of siraj@jobdiva.com designates
 64.18.2.217 as permitted sender)
Message-ID: <4BF1BE7E.2020809@jobdiva.com>
Date: Mon, 17 May 2010 18:09:02 -0400
From: Siraj Haider <siraj@jobdiva.com>
User-Agent: Mozilla/5.0 (Windows; U; Windows NT 6.1; en-US;
 rv:1.9.1.8) Gecko/20100227 Thunderbird/3.0.3
MIME-Version: 1.0
To: "java-user@lucene.apache.org" <java-user@lucene.apache.org>
CC: Steven A Rowe <sarowe@syr.edu>
Subject: Re: Reverse Searching
References: <4BF1A940.3070105@jobdiva.com>
  <2D127F11DC79714E9B6A43AC9458147F3DCD98E4@suex07-mbx-03.ad.syr.edu>
 <4BF1B947.6000501@jobdiva.com>
  <2D127F11DC79714E9B6A43AC9458147F3DCD98E6@suex07-mbx-03.ad.syr.edu>
In-Reply-To: 
 <2D127F11DC79714E9B6A43AC9458147F3DCD98E6@suex07-mbx-03.ad.syr.edu>
Content-Type: text/plain; charset="ISO-8859-1"; format=flowed
Content-Transfer-Encoding: 7bit

Hi Steven,
Thanks for the information, its very useful.  I am definitely going to 
give it a try and will ask if I get into any problem.

thanks
-siraj

On 5/17/2010 5:59 PM, Steven A Rowe wrote:
> Hi Siraj,
>
> The usual answer to questions like yours ("Will performance of Lucene component X against my N records be good enough?") is "It depends": on the nature of the queries, the nature of the documents, the hardware you run on, etc.  That said, if you construct your query objects once and reuse them, it'll likely be extremely fast.
>
> Here are some benchmarks (which I found by Googling "Lucene MemoryIndex") using PyLucene:
>
> <http://www.sajalkayan.com/prospective-search-using-python.html>
>
> Give it a try!  Lucene is pretty easy to get started with.  Ask questions if you run into trouble.
>
> Good luck,
> Steve
>
> On 05/17/2010 at 5:46 PM, Siraj Haider wrote:
>    
>> Hi Steven,
>> Thanks for the quick reply.  I checked the documentation of MemoryIndex
>> and it seems like, you have to create an index in memory with one
>> document and will have to run the queries against that single document.
>> But my dilemma is, I might have upto 100,000 queries to run against it.
>> Do you think this route will give me results in reasonable amount of
>> time, i.e. in a few seconds?
>>
>> thanks
>> -siraj
>>
>> On 5/17/2010 5:21 PM, Steven A Rowe wrote:
>>      
>>> Hi Siraj,
>>>
>>> Lucene's MemoryIndex can be used to serve this purpose.
>>>
>>> From<http://lucene.apache.org/java/3_0_1/api/contrib-
>>> memory/org/apache/lucene/index/memory/MemoryIndex.html>:
>>>
>>> 	[T]his class targets fulltext search of huge numbers
>>> 	of queries over comparatively small transient realtime
>>> 	data (prospective search).
>>>
>>> MemoryIndex can only hold one document at a time.
>>>
>>> See also Lucene's InstantiatedIndex, which can hold more than one
>>> document at a time:
>>>
>>> <http://lucene.apache.org/java/3_0_1/api/contrib-
>>>        
>> instantiated/org/apache/lucene/store/instantiated/InstantiatedIndex.htm
>> l>
>>      
>>> Steve
>>>
>>> On 05/17/2010 at 4:38 PM, Siraj Haider wrote:
>>>
>>>        
>>>> Hello there, In oracle text search there is a feature to reverse
>>>> search using ctxrule.  What it does is, you create an index (ctxrule)
>>>> on a column having your search criteria(s) and then throw a document
>>>> on it and it tells you which criteria(s) it satisfies.  Is there
>>>> something in Lucene that does that or there are any plans to do that?
>>>>
>>>> thanks
>>>> -siraj
>>>>          
>
> ---------------------------------------------------------------------
> To unsubscribe, e-mail: java-user-unsubscribe@lucene.apache.org
> For additional commands, e-mail: java-user-help@lucene.apache.org
>
>    


---------------------------------------------------------------------
To unsubscribe, e-mail: java-user-unsubscribe@lucene.apache.org
For additional commands, e-mail: java-user-help@lucene.apache.org