Sciweavers

69 search results - page 1 / 14
» Compressed Inverted Indexes for In-Memory Search Engines
Sort
View
ALENEX
2008
192views Algorithms» more  ALENEX 2008»
13 years 5 months ago
Compressed Inverted Indexes for In-Memory Search Engines
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 ...
Frederik Transier, Peter Sanders
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 4 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
WWW
2011
ACM
12 years 11 months ago
Inverted index compression via online document routing
Modern search engines are expected to make documents searchable shortly after they appear on the ever changing Web. To satisfy this requirement, the Web is frequently crawled. Due...
Gal Lavee, Ronny Lempel, Edo Liberty, Oren Somekh
WWW
2008
ACM
14 years 5 months ago
Performance of compressed inverted list caching in search engines
Due to the rapid growth in the size of the web, web search engines are facing enormous performance challenges. The larger engines in particular have to be able to process tens of ...
Jiangong Zhang, Xiaohui Long, Torsten Suel
ACSC
2004
IEEE
13 years 8 months ago
Access-Ordered Indexes
Search engines are an essential tool for modern life. We use them to discover new information on diverse topics and to locate a wide range of resources. The search process in all ...
Steven Garcia, Hugh E. Williams, Adam Cannane