I asked here[1] and it said "Ask again later."
[1] http://8ball.tridelphia.net/
On 12/06/2011 08:46 PM, Jamie Johnson wrote:
Thanks Robert. Is there a timetable for that? I'm trying to gauge
whether it is appropriate to push for my organization to move to the
current lucene 4.0 implementation
ing is dropping the
> "-" from the front of your "-2" at indexing time, and if so it can
> sometimes be pretty hard to tell via Luke.
>
> Hope this helps,
>
> -Matt
>
> Darren Govoni wrote:
> > Tried them all, with quotes, without. Doesn't wor
t; toostep.com
>
> On Thu, Dec 11, 2008 at 11:28 PM, Darren Govoni wrote:
>
> > I'm using Luke to find the right combination of quotes,\'s and
> > analyzers.
> >
> > No combination can produce a positive result for "-2 String" for the
>
ionFile" = NO (thought
this one would work).
Same results for the other analyzers more or less.
Weird.
Darren
On Thu, 2008-12-11 at 23:02 +0530, prabin meitei wrote:
> Hi, While constructing the query give the query string in quotes.
> eg: query = queryparser.parse("\"-2 wo
er
> you're looking for.
>
> Cheers
> Rob
>
> On Thu, Dec 11, 2008 at 3:59 PM, Darren Govoni <[EMAIL PROTECTED]> wrote:
>
> > Hi,
> > This might be a dumb question, but I have a simple field like this
> >
> > field: 0 -2 Word
> >
> &
Hi,
This might be a dumb question, but I have a simple field like this
field: 0 -2 Word
that is indexed,tokenized and stored. I've tried various ways in Lucene
(using Luke) to search for "-2 Word" and none of them work, the query is
re-written improperly. I escaped the -2 to "\-2 Word" and it s
Hi,
I saw this question asked before without a clear answer. Pardons if I
missed it in the archive elsewhere.
Is there a serious degradation of performance when using high number of
fields per document? Like 100's? Is the impact more on the write than
the read?
What are the performance charact
t its graph and getting the expected
speed?
thanks to anyone who can verify this.
On Sun, 2008-11-16 at 12:37 -0500, Darren Govoni wrote:
> Yeah. That makes sense. Its not too hard to wrap those extra steps so I
> can end up with something simpler too. Like:
>
> iindex = Instanti
hough, you have to get that
> reader from somewhere right?
>
> - Mark
>
>
>
> Darren Govoni wrote:
> > Hi Mark,
> > Thanks for the tips. Here's what I will try (psuedo-code)
> >
> > endirectory = RAMDirectory("index/dicti
er, which take the
> InstantiatedIndex as a constructor arg.
>
> You should be able to just wrap that InstantiatedReader in a regular
> Searcher.
>
> Darren Govoni wrote:
> > Hi gang,
> >I am trying to trace the 2.4 API to create an InstantiatedIndex, but
Hi gang,
I am trying to trace the 2.4 API to create an InstantiatedIndex, but
its rather difficult to connect directory,reader,search,index etc just
reading the javadocs.
I have a (POI - plain old index) directory already and want to
create a faster InstantiatedIndex and IndexSearcher to q
Has anyone gotten some initial performance observations about
instantiated index?
I replaced my RAMDirectory searcher with one and it was slower or about
the same. The note about it claims 100x possible performance
improvement. Maybe there is a data size beyond which its performance
excels.
thank
s), I call them "drill
> clouds":
> http://lab.cisti-icist.nrc-cnrc.gc.ca/cistilabswiki/index.php/Drill_Clouds#Drill_Clouds
>
> -glen
>
> 2008/10/16 Darren Govoni <[EMAIL PROTECTED]>:
> > I guess a link map (as I understand it) is a collection of hyperlinks
; them all the most frequent terms in the results they got back. Sort of
> >> like latent relationships.
> >>
> >> Does that help?
> >>
> >> I thought this could be done using term frequency vectors in Lucene, but
> >> I've never
len Newton wrote:
> Sorry, could you explain what you mean by a "link map over lucene results"?
>
> thanks,
> -glen
>
> 2008/10/16 Darren Govoni <[EMAIL PROTECTED]>:
> > Hi,
> > Has anyone created a link map over lucene results or know of a link
> >
Hi,
Has anyone created a link map over lucene results or know of a link
describing the process? If not, I would like to build one to contribute.
Also, I read about term frequencies in the book, but wanted to know if I
can extract the strongest occurring terms from a given result set or
result?
Congratulations!
A truly stellar achievement.
Can't wait to dive in!
On Sat, 2008-10-11 at 11:50 -0400, Michael McCandless wrote:
> Release 2.4.0 of Lucene is now available!
>
> With 2.4.0 we have relaxed the backwards compatibility policy of the
> Fieldable interface: we now allow changes on
rdware.
>
> I hope this is helpful. If you have any questions, please let me know.
>
> Related:
> http://zzzoot.blogspot.com/2008/06/lucene-concurrent-searcher-performance.html
>
> -Glen
>
>
>
> 2008/10/10 Darren Govoni <[EMAIL PROTECTED]>:
> >
Hi gang,
Wondering how folks have address scaled up indexing. I saw old threads
about using clustered webapp with JNDI singleton index writer due to the
Lucene single writer limitation. Is this limitation lifted in 3 maybe?
Is there a best strategy for parallel writing to an index by many
threads
:59 PM, Karl Wettin <[EMAIL PROTECTED]> wrote:
>
> >
> > 27 aug 2008 kl. 00.52 skrev Darren Govoni:
> >
> > Hi,
> >> Sorry if I missed this somewhere or maybe its not released yet, but I
> >> was anxiously curious about lucene 3.0's expected fe
Hi,
Sorry if I missed this somewhere or maybe its not released yet, but I
was anxiously curious about lucene 3.0's expected features/improvements.
Is there a list yet?
thanks!
Darren
-
To unsubscribe, e-mail: [EMAIL PROTECTED
Yeah, you are right. Was looking for a lazy way to avoid writing 5 lines
of code. Hehe.
Thanks,
Darren
On Sat, 2008-08-16 at 10:44 -0400, Mark Miller wrote:
> Darren Govoni wrote:
> > Hi,
> > I combed through the API and some of the mailing list. I need
> > to get the
Hi,
I combed through the API and some of the mailing list. I need
to get the id of a Document just added. How should this be done?
I'm using Lucene 2.3.2.
thank you,
Darren
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For addit
t that the RAMDir is a complete red herring. a 17M index
> will almost certainly be cached by the system after a bit of use.
>
> There's a whole section up on the Lucene website that talks about various
> ways to speed up processing
>
> Measure, *then* optimize ..
>
Hoss,
Thank you for the detailed response. What I found weird was it
seemed to take 0.09 seconds to create a RAMDirectory off a 17MB index.
Suspiciously fast, but ok.
Yet, when I do a simple fuzzy search on a single field
"word: someword~0.76"
It was taking .35 seconds. That's a very very lo
new RAMDirectory instance from a different
> Directoryimplementation. This can be used to load a disk-based index
> into memory.
>
> Seems like exactly what you're asking for...
>
> Best
> Erick
>
> On Thu, Jun 26, 2008 at 3:40 PM, Darren Govoni <[EMAIL PROTE
Hi,
I've looked around a bit and couldn't find an answer to this. I want
to impose a strict ordering on results from a single query where there
multiple boosted terms in the query.
Let's say I have a field called 'word:'. If my query is
word: termA^10.0 word: termB^2.0
I want ALL termA resu
Hi,
Sorry if I missed this in the documentation, but I wanted to know if
Lucene allows boosting of tokens _within_ a field when a document is
stored? Let me explain. Let's say I store the following field
numbers: one one one two three
Searching "numbers:" field with a boost on one will score hi
Hi,
Is it possible to read a disk-based index into RAM (entirely) and
have all searches operate on it there? I saw some RAMDirectory examples,
but it didn't look like it will transfer a disk index into RAM.
thanks
D
-
To unsu
Hi,
Is there a lucene index reader that will load a disk-based index into
memory and perform searches on it from RAM? Sorry if I missed this in
the docs somewhere.
Darren
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additio
I guess I meant searching the index, size of index etc.
So they would search essentially the same?
Sorry that wasn't clear from my original email.
Darren
- Original Message -
From: "Erick Erickson" <[EMAIL PROTECTED]>
To:
Sent: Tuesday, April 15, 2008 1:15 PM
Subject: Re: Which will
One interpretation of the query with ~5 is that your text has 5 words
and ~5 would imply a word in any position can match. Could it be this?
- Original Message -
From: "Ivan Vasilev" <[EMAIL PROTECTED]>
To: "LUCENE MAIL LIST"
Sent: Thursday, April 03, 2008 6:03 AM
Subject: PhraseQuery
Hi,
I want to do a query such as
word: first*
where I want 'first' to be the start of the string value contained in the word
field and not somewhere inside it.
What's the best way to do this?
thanks for any tips,
Darren
33 matches
Mail list logo
