Hi,
Correct me if I'm wrong (no flame please, I started reading
the code an hour ago):
Each word of each document has an entry in a B-Tree structured
DB file. The key is the word + DocId, the data is a WordRecord, i.e.
encoded DocId + Flags + Anchor + Location.
If I have 100 documents containing 100 words, I'll have
10 000 entries in the B-Tree.
In addition a hint about the semantic of Anchor would be appreciated.
Yours truly,
--
Loic Dachary
ECILA
100 av. du Gal Leclerc
93500 Pantin - France
Tel: 33 1 56 96 09 80, Fax: 33 1 56 96 09 61
e-mail: [EMAIL PROTECTED] URL: http://www.senga.org/
------------------------------------
To unsubscribe from the htdig3-dev mailing list, send a message to
[EMAIL PROTECTED] containing the single word "unsubscribe" in
the SUBJECT of the message.
