Efficient online index construction for text databases
Author
Lester, N; Moffat, A; Zobel, JDate
2008-08-01Source Title
ACM Transactions on Database SystemsPublisher
ASSOC COMPUTING MACHINERYAffiliation
Computer Science and Software EngineeringMetadata
Show full item recordDocument Type
Journal ArticleCitations
Lester, 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 Status
This item is currently not available from this repositoryAbstract
<jats:p>
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
<jats:italic>geometric partitioning</jats:italic>
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.
</jats:p>
Keywords
Information SystemsExport Reference in RIS Format
Endnote
- Click on "Export Reference in RIS Format" and choose "open with... Endnote".
Refworks
- Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References