2539 search results - page 125 / 508 » Updates for Structure Indexes |
177
click to vote
ALENEX
2008
15 years 5 months ago
2008
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 ...
110
click to vote
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
278
click to vote
ICDE
2009
IEEE
16 years 6 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
171
click to vote
SIGMOD
2001
ACM
16 years 4 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
119
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...