Sciweavers

295 search results - page 1 / 59
» Compressed full-text indexes
Sort
View
ESA
2011
Springer
231views Algorithms» more  ESA 2011»
12 years 7 months ago
Distribution-Aware Compressed Full-Text Indexes
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
Paolo Ferragina, Jouni Sirén, Rossano Ventu...
CPM
2006
Springer
164views Combinatorics» more  CPM 2006»
13 years 11 months ago
Dynamic Entropy-Compressed Sequences and Full-Text Indexes
Veli Mäkinen, Gonzalo Navarro
ALENEX
2008
192views Algorithms» more  ALENEX 2008»
13 years 9 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
VLDB
1994
ACM
148views Database» more  VLDB 1994»
13 years 12 months ago
Fast Incremental Indexing for Full-Text Information Retrieval
Full-text information retrieval systems have traditionally been designed for archival environments. They often provide little or no support for adding new documents to an existing...
Eric W. Brown, James P. Callan, W. Bruce Croft
DEXA
2005
Springer
138views Database» more  DEXA 2005»
14 years 1 months ago
Full-Text and Structural XML Indexing on B+-Tree
XML query processing is one of the most active areas of database research. Although the main focus of past research has been the processing of structural XML queries, there are gro...
Toshiyuki Shimizu, Masatoshi Yoshikawa