Efficient online index construction for text databases
AuthorLester, N; Moffat, A; Zobel, J
Source TitleACM Transactions on Database Systems
PublisherASSOC COMPUTING MACHINERY
AffiliationComputer Science and Software Engineering
Document TypeJournal Article
CitationsLester, N., Moffat, A. & Zobel, J. (2008). Efficient online index construction for text databases. ACM TRANSACTIONS ON DATABASE SYSTEMS, 33 (3), https://doi.org/10.1145/1386118.1386125.
Access StatusThis item is currently not available from this repository
Inverted index structures are a core element of current text retrieval systems. They can be constructed quickly using offline approaches, in which one or more passes are made over a static set of input data, and, at the completion of the process, an index is available for querying. However, there are search environments in which even a small delay in timeliness cannot be tolerated, and the index must always be queryable and up to date. Here we describe and analyze a geometric partitioning mechanism for online index construction that provides a range of tradeoffs between costs, and can be adapted to different balances of insertion and querying operations. Detailed experimental results are provided that show the extent of these tradeoffs, and that these new methods can yield substantial savings in online indexing costs.
- Click on "Export Reference in RIS Format" and choose "open with... Endnote".
- Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References