Sciweavers

272 search results - page 41 / 55
» The compressed permuterm index
Sort
View
JEA
2008
120views more  JEA 2008»
14 years 11 months ago
Better external memory suffix array construction
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in b...
Roman Dementiev, Juha Kärkkäinen, Jens M...
ICDE
2007
IEEE
220views Database» more  ICDE 2007»
16 years 1 months ago
Structural Selectivity Estimation for XML Documents
Estimating the selectivity of queries is a crucial problem in database systems. Virtually all database systems rely on the use of selectivity estimates to choose amongst the many ...
Damien K. Fisher, Sebastian Maneth
ICDE
2010
IEEE
491views Database» more  ICDE 2010»
15 years 11 months ago
TrajStore: An Adaptive Storage System for Very Large Trajectory Data Sets
The rise of GPS and broadband-speed wireless devices has led to tremendous excitement about a range of applications broadly characterized as "location based services". Cu...
Philippe Cudré-Mauroux, Eugene Wu, Samuel M...
CPM
2005
Springer
101views Combinatorics» more  CPM 2005»
15 years 5 months ago
Succinct Suffix Arrays Based on Run-Length Encoding
A succinct full-text self-index is a data structure built on a text T = t1t2 . . . tn, which takes little space (ideally close to that of the compressed text), permits efficient se...
Veli Mäkinen, Gonzalo Navarro
ICDE
2002
IEEE
162views Database» more  ICDE 2002»
15 years 4 months ago
Similarity Search Over Time-Series Data Using Wavelets
We consider the use of wavelet transformations as a dimensionality reduction technique to permit efficient similarity search over high-dimensional time-series data. While numerou...
Ivan Popivanov, Renée J. Miller