[Exist-open] [ exist-Feature Requests-2005107 ] Scalable full text search indexes

[SourceForge.net <no...@so...>]

Feature Requests item #2005107, was opened at 2008-06-28 16:16
Message generated for change (Tracker Item Submitted) made by Item Submitter
You can respond by visiting: 
https://sourceforge.net/tracker/?func=detail&atid=367691&aid=2005107&group_id=17691

Please note that this message will contain a full copy of the comment thread,
including the initial issue submission, for this request,
not just the latest update.
Category: None
Group: None
Status: Open
Resolution: None
Priority: 5
Private: No
Submitted By: Jos Mara Fernndez (jmfg)
Assigned to: Nobody/Anonymous (nobody)
Summary: Scalable full text search indexes

Initial Comment:
Current implementation of full text search indexes uses a btree structure for the inverted index implementation, where each key is an indexed term and its assigned value is an array with the positions where it is appearing. This strategy does not scale up very well for huge indexed volumes.

My request is changing the value representation from an array to an on-disk btree-like structure, so when an update (insertion or deletion) or a query are performed not all the positions have to be fetched from the disk, and then written back in the case of an update.

----------------------------------------------------------------------

You can respond by visiting: 
https://sourceforge.net/tracker/?func=detail&atid=367691&aid=2005107&group_id=17691