Indexes are the key technology underpinning efficient text search. A range of algorithms have been developed for fast query evaluation and for index creation, but update algorithms for high-performance indexes have not been evaluated or even fully described. In this paper, we explore the three main alternative strategies for index update: in-place update, index merging, and complete re-build. Our experiments with large volumes of web data show that re-merge is for large numbers of updates the fastest approach, but in-place update is suitable when the rate of update is low or buffer size is limited
Index structures are designed to optimize search perfor-mance, while at the same time supporting eff...
As information retrieval (IR) systems emerge as the mainstream information finding tool within comme...
Time-travel text search enriches standard text search by temporal predicates, so that users of web a...
Search engines and other text retrieval systems use high-performance inverted indexes to provide eff...
In-place and merge-based index maintenance are the two main competing strategies for on-line index ...
Previous on-line index maintenance strategies are mainly designed for document insertions without co...
The original publication is available at www.springerlink.comRecent work on incremental crawling has...
Managing digital information is an integral part of our society. Efficient access to data is support...
Adaptive indexing is characterized by the partial creation and refinement of the index as side effe...
Large web search engines process billions of queries each day over tens of billions of documents wit...
This is a preprint of an article published in the Journal of Information Science Vol. 32, No. 2, 131...
For free-text search over rapidly evolving corpora, dynamic update of inverted indices is a basic re...
textabstractProper physical design is a momentous issue for the performance of modern database syste...
Interactive exploratory data analysis consists of workloads that are composed of filter-aggregate qu...
the date of receipt and acceptance should be inserted later Abstract Intense regulatory focus on sec...
Index structures are designed to optimize search perfor-mance, while at the same time supporting eff...
As information retrieval (IR) systems emerge as the mainstream information finding tool within comme...
Time-travel text search enriches standard text search by temporal predicates, so that users of web a...
Search engines and other text retrieval systems use high-performance inverted indexes to provide eff...
In-place and merge-based index maintenance are the two main competing strategies for on-line index ...
Previous on-line index maintenance strategies are mainly designed for document insertions without co...
The original publication is available at www.springerlink.comRecent work on incremental crawling has...
Managing digital information is an integral part of our society. Efficient access to data is support...
Adaptive indexing is characterized by the partial creation and refinement of the index as side effe...
Large web search engines process billions of queries each day over tens of billions of documents wit...
This is a preprint of an article published in the Journal of Information Science Vol. 32, No. 2, 131...
For free-text search over rapidly evolving corpora, dynamic update of inverted indices is a basic re...
textabstractProper physical design is a momentous issue for the performance of modern database syste...
Interactive exploratory data analysis consists of workloads that are composed of filter-aggregate qu...
the date of receipt and acceptance should be inserted later Abstract Intense regulatory focus on sec...
Index structures are designed to optimize search perfor-mance, while at the same time supporting eff...
As information retrieval (IR) systems emerge as the mainstream information finding tool within comme...
Time-travel text search enriches standard text search by temporal predicates, so that users of web a...