Hello Everybody!
Do you know if it is possible to get the name of the field in which Lucene
found a term?
I know that you can get the content of all fields with the document id. But
I need to know in which field Lucene found my term, if I searched in several
fields.
I'm thankful for every kind of
point here and am I correct in that it would
be hard to implement something as "free" as with Glimpse? I am not
trying to critizise, just understand how Lucene (and Glimpse) works.
Oh, yes, Glimpse has one big drawback: it onl
ough the files.
I hope this made things at least a little bit clearer ;) Again, I am
seeing it from the perspective of a Glimpse user where the searches
most people use "just work" (but due to licensing I don't think we can
continue to use it).
Thanks!
/Mathias
On Mon, Feb 4, 2013
Thanks for the input! Seems I should give this another chance using
the hints you all sent me. I'll report back my findings here.
/Mathias
On Mon, Feb 4, 2013 at 7:01 PM, Mathias Dahl wrote:
> Hi,
>
> I have hacked together a small web front end to the Glimpse text
> indexing
dexing and local feature search are based on terms, ... and fast.
But linear search makes up an important part of LIRE, so I'd be glad
to get some suggestions how either to disable compression, or how to
sneak in byte[] data with some textual data that is "fast as hell" to
read.
chee
Hi!
Thanks!! I'll try the DocValues for sure, and of course the smaller
chunk size. Just to add up on the number of bytes stored: it's for
instance 72 bytes for CEDD, ~96 for JCD, 64 bytes for
OpponentHistogram, etc. and there is 0 wrote:
> Uwe,
> I think Mathias was talking abo
ay
stable. As I'm quite a lazy programmer I'd like to hear you opinion on
how stable the APIs for BinaryDocValues and Codec might be? :)
cheers,
Mathias
On Mon, Jun 24, 2013 at 9:23 AM, Adrien Grand wrote:
> Hi,
>
> On Sun, Jun 23, 2013 at 9:08 PM, Savia Beson wrote:
>>
on as a lot of re-coding was
needed.
cheers,
Mathias
On Mon, Jun 24, 2013 at 3:13 PM, Adrien Grand wrote:
> Hi,
>
> On Mon, Jun 24, 2013 at 2:47 PM, Mathias Lux wrote:
>> Still, I've read that all the BinaryDocValues go directly to memory.
>> Am I right with this?
>
>
using a Weight
object (order is not interesting), but I haven't seen a way to do
this.
I hope, someone has already solved this problem.
Mathias
-
To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org
For addi
ch is - again - very slow. So,
unfortunatelly, your solution does not help.
Mathias
2009/9/15 Simon Willnauer :
> Did you try:
> int numDocs
> TermDocs termDocs = reader.termDocs(new Term("myField", "myTerm"));
> while (termDocs.next()) { numDocs++; }
>
>
vide an iterator, no hash
checks are possible.
Are there any other possibilities to improve speed?
Mathias
Am 15.09.2009 17:13 schrieb Simon Willnauer :
> Hmm, so if you wanna use the Filter to narrow down the search results
>
> you could use it in the while loop like this:
>
>
nd than iterate all terms only counting documents in this
filtered set? I cannot imagine, that this is performant because I have
more than 10 mio documents (fast growing).
Mathias
2009/11/6 Chris Lu :
> Isn't the tag cloud just another facet search? Only difference is the tag is
>
TF, IDF, Boost... put together?
Regards,
Mathias Silbermann
-
To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org
For additional commands, e-mail: java-user-h...@lucene.apache.org
-> well ... I'd like to
other opinions too ;)
hope that helps a bit,
Mathias
--
' ''
' '' Mathias Lux
o/ ' \o [EMAIL PROTECTED]
/-'-\ skype://dermotte, icq # 1988617
/\
+1
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
t and their
application to information retrieval on the web, in 'WIDM '05:
Proceedings of the 7th annual ACM international workshop on Web
information and data management', ACM Press, New York, NY, USA, pp.
10--16.
regards,
Mathias
=
/ classes / node types (whatever :) depends on the
use case.
hope this helps a bit,
mathias
> -Ursprüngliche Nachricht-
> Von: xing jiang [mailto:[EMAIL PROTECTED]
> Gesendet: Donnerstag, 19. Jänner 2006 12:14
> An: java-user@lucene.apache.org
> Betreff: Re: Use the lu
(URIs per definitionem
in RDF), a limited set of possible relations (limited by the number of nodes in
RDF, but that should do also) and so on.
- mathias
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
t;^
4
Of course you have to think about the whole thing, but I think with good
boost values it would work.
- mathias
ps. instead of C+D I would use (l-1)*C + l*D, so l from [0,1] can be
used to specify if concept or content has more influence.
--
www.semanticmetadata.net/lire,
http://freshmeat.net/projects/lirecbir/
hoping for feedback
- mathias
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
ot;World-Poland", "Poland-Abc") would result in a better
relevance for above example.
regards,
Mathias
--
Mathias Lux
http://www.semanticmetadata.net
> -Ursprüngliche Nachricht-
> Von: kieran [mailto:[EMAIL PROTECTED]
> Gesendet: Mittwoch, 15. Mär
Hi!
I have a question concerning the interal searching behavior of lucene. How does
lucene get a hit.
If I search for the a term, will each index document be checked for this term
or is there an internal relation between terms and lucene documents?
Thanks for any advice.
Matt
(terms) to the
documents that they appear in.
Some background info on inverted indices:
http://en.wikipedia.org/wiki/Inverted_index
Miles
--
On Wednesday 03 May 2006 14:56, Mathias Keilbach wrote:
> I have a quest
Hi!
I'm going to create a small application with Lucene, which analyze diffenrent
Strings. While analyzing the strings, patterns (like emails or urls) shall be
sort out and saved in a seperate index field.
I'm not sure if I can handle this with a self implemented Analyzer class. Afaik
you can't
f and how I could implement a linear search (L1/L2
distance on integer vectors) using scorers, so that filters and other
features can be used?
regards,
Mathias
ps. Yes I know that this is in general easy to implement within a
database, which I have done for oracle, mysql and derby but peop
x27;m misunderstanding something it appears to me this is a bug.
I am using Lucene 2.0.0 with JDK 1.4 on Mac OS X 10.4
Did anybody else notice this problem?
Mathias.
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional comman
Hi!
I'm currently developing a mediabase for 20-100 customers. A Customer can
upload a file, folder via ftp and a file grabber searches the file system
and adds the new file to a mysql database. It also creates thumbnails, adds
search words etc. Now, this mediabase is pretty old and is developed
Thanks Erick!
I've just bought the book Lucene in action and I will see where that leeds
me.
I'm aware of that lucene doens't do the other magic ;) just what it is made
for. Indexing and searching.
--
View this message in context:
http://www.nabble.com/Advise-for-Mediabase-with-Lucene-tp197878
Oh, I forgot.
Would you save the documents as index on the file system or use Hibernate
search with lucene?
--
View this message in context:
http://www.nabble.com/Advise-for-Mediabase-with-Lucene-tp19787867p19789551.html
Sent from the Lucene - Java Users mailing list archive at Nabble.com.
-
I don't know if this is going to work.
Let's say I have a root folder that is the startpoint for a client.
The only thing I have in the database is the startPoint
When traversing the child folders I want to check If the folder has changed
since the last time.Can I store this in a lucene index, a
30 matches
Mail list logo
