2121 search results - page 111 / 425 » Indexing Incomplete Databases |
150
click to vote
DAWAK
2001
Springer
15 years 9 months ago
2001
Springer
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
136
Voted
CPM
2000
Springer
15 years 9 months ago
2000
Springer
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...
149
click to vote
CIKM
2006
Springer
15 years 8 months ago
2006
Springer
We present a static index pruning method, to be used in ad-hoc document retrieval tasks, that follows a documentcentric approach to decide whether a posting for a given term shoul...
159
click to vote
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
Many existing indexes on text work at the document granularity and are not effective in answering the class of queries where the desired answer is only a term or a phrase. In this...
159
click to vote
SIGIR
1995
ACM
15 years 8 months ago
1995
ACM
The full integration of information retrieval (IR) features into a database management system (DBMS) has long been recognized as both a significant goal and a challenging undertak...