Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

20

ALENEX
2008

favoriteEmaildiscussreport

192views Algorithms» more ALENEX 2008»

Compressed Inverted Indexes for In-Memory Search Engines

13 years 5 months ago

Compressed Inverted Indexes for In-Memory Search Engines

Download algo2.iti.kit.edu

We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system uses a carefully choreographed combination of classical data compression techniques and inverted index based search data structures. It outperforms suﬃx array based techniques for all the above operations for real world (natural language) texts.

Frederik Transier, Peter Sanders

Real-time Traffic

ALENEX 2007 | ALENEX 2008 | Algorithms | Data Compression Techniques | Fast Boolean Queries | Text Data Base |

claim paper

Related Content

» Fast InMemory XPath Search using Compressed Indexes

» Inverted index compression via online document routing

» Performance of compressed inverted list caching in search engines

» AccessOrdered Indexes

» Compressed Perfect Embedded Skip Lists for Quick InvertedIndex Lookups

» Sigma encoded inverted files

» Adding Compression to Block Addressing Inverted Indexes

» Compact fulltext indexing of versioned document collections

» Intersection in Integer Inverted Indices

Post Info
More Details (n/a)

Added	08 Nov 2010
Updated	08 Nov 2010
Type	Conference
Year	2008
Where	ALENEX
Authors	Frederik Transier, Peter Sanders

Comments (0)