Efficient single‐pass index construction for text databases
- 16 April 2003
- journal article
- research article
- Published by Wiley in Journal of the American Society for Information Science and Technology
- Vol. 54 (8) , 713-729
- https://doi.org/10.1002/asi.10268
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Burst triesACM Transactions on Information Systems, 2002
- In-memory hash tables for accumulating text vocabulariesInformation Processing Letters, 2001
- Building a distributed full-text index for the WebPublished by Association for Computing Machinery (ACM) ,2001
- Indexing Techniques for Advanced Database SystemsPublished by Springer Nature ,1997
- Self-indexing inverted files for fast text retrievalACM Transactions on Information Systems, 1996
- In situ generation of compressed inverted filesJournal of the American Society for Information Science, 1995
- Overview of the Second Text Retrieval Conference (TREC-2)Information Processing & Management, 1995
- Engineering a sort functionSoftware: Practice and Experience, 1993
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975
- Run-length encodings (Corresp.)IEEE Transactions on Information Theory, 1966