Name
Abstract | ||
|---|---|---|
For free-text search over rapidly evolving corpora, dynamic update of inverted indices is a basic requirement. B-trees are an effective tool in implementing such indices. The Zipfian distribution of postings suggests space and time optimizations unique to this task. In particular, we present two novel optimizations, merge update, which performs better than straight forward block update, and pulsing which significantly reduces space requirements without sacrificing performance. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1145/96749.98245 | Research and Development in Information Retrieval |
Keywords | Field | DocType |
basic requirement,effective tool,novel optimizations,zipfian distribution,dynamic inverted index maintenance,dynamic update,free-text search,space requirement,inverted index | Inverted index,Zipf's law,Data mining,Space requirements,Computer science,Spacetime,Merge (version control) | Conference |
ISBN | Citations | PageRank |
0-89791-408-2 | 96 | 71.65 |
References | Authors | |
1 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Douglas R. Cutting | 1 | 1030 | 423.10 |
| Jan O. Pedersen | 2 | 6301 | 1177.07 |