Hi all,
I found this paper interesting, it discusses several optimization
methods for in-memory inverted indexes. E.g. random access compressed
postings lists, a self-index (i.e. inverted index with positions from
which you can reconstruct the original text, could be perhaps useful for
storing a combination of stored fields and term vectors), etc, etc...
Transier, F., & Sanders, P. (2010). Engineering basic algorithms of an
in-memory text search engine. Transactions on Information Systems (TOIS,
29(1)).
http://portal.acm.org/ft_gateway.cfm?id=1877768
--
Best regards,
Andrzej Bialecki <><
___. ___ ___ ___ _ _ __________________________________
[__ || __|__/|__||\/| Information Retrieval, Semantic Web
___|||__|| \| || | Embedded Unix, System Integration
http://www.sigram.com Contact: info at sigram dot com
---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
