Goulish, Michael writes:
To really preserve the relationships in arbitrarily
structured XML, you pretty much need to use a database
that directly supports an XML query language like
XQuery or XPath.
If searching within regions is enough (something e.g. sgrep
Hi all,
lets say I have an index with documents encoded in two fields filename and
data. Is it possible to extract a file from which I know the filename
directly from this index without performing any search. Like a random access like
in a filesystem?
Karl
--
+++ GMX - die erste Adresse für
On Jan 18, 2004, at 11:15 AM, Karl Koch wrote:
lets say I have an index with documents encoded in two fields
filename and
data. Is it possible to extract a file from which I know the filename
directly from this index without performing any search. Like a random
access like
in a filesystem?
It is
How can I get a list of all fields in an index from which I know only the
directory string?
Karl
--
+++ GMX - die erste Adresse für Mail, Message, More +++
Bis 31.1.: TopMail + Digicam für nur 29 EUR http://www.gmx.net/topmail
Hi all,
I have only the file information about its location and the name of the
file. I want to know two things. There is also an index made from suche files
also containing the file I am looking for. I want to know two things:
1) first of all, all fields witch can be searched within this index.
Hello Nicolas,
I am sure you mean IR (Information Retrieval) Model. Lucene implements a
Vector Space Model with integrated Boolean Model. This means the Boolean model
is integrated with a Boolean query language but mapped into the Vector Space.
Therefore you have ranking even though the
Actually, finding an answer to this question is not really important. More
important is if you can do what you want with it. If you result comes from a
prob. model or a vector space model, who cares if you just want to give a
query and back a hit list of results?
Possibliy some people here will
thanks Karl !
- Original Message -
From: Karl Koch [EMAIL PROTECTED]
To: Lucene Users List [EMAIL PROTECTED]
Sent: Sunday, January 18, 2004 9:22 PM
Subject: Re: theorical informations
Actually, finding an answer to this question is not really important. More
important is if you can
Hi group,
I run over a IndexOutOfBoundsException:
- java.lang.IndexOutOfBoundsException: More than 32 required/prohibited
clauses in query.
The reason: I have more then 32 BooleanCauses. From the Mailinglist I got
the info how to set the maxiumum number of clauses higher before a loop:
...
I think this is a FAQ.
Keep that single IndexSearcher until you change the index and want that
IS to see those changes.
Otis
--- Karl Koch [EMAIL PROTECTED] wrote:
Hi all,
I have a search method who is used by many programs with different
queries.
I therefore do not want to close the
Maybe you're using wildcards (which cause the query to get expanded). Just
go in and set the varb to something very large (provided that doing so
doesn't give you an OutOfMemory error - which is why that limit was set).
HTH,
Terry
- Original Message -
From: Karl Koch [EMAIL PROTECTED]
hy,
i have troubles in find the correspondance betwwen the javadoc and faq
similarity expression
in the Similarity Javadoc
score(q,d) =Sum [tf(t in d) * idf(t) * getBoost(t.field in d) *
lengthNorm(t.field in d) * coord(q,d) * queryNorm(q) ]
in the FAQ
score_d = sum_t(tf_q * idf_t / norm_q *
I would rely on the JavaDoc since this one is up to date. The latest version
1.3 final is just a few weeks old. Some entries in the FAQ however are still
from 2001...
Cheers,
Karl
hy,
i have troubles in find the correspondance betwwen the javadoc and faq
similarity expression
in the
13 matches
Mail list logo
