Electronic workshops in computing · 1996 · 16 citations · 5 references
ComputingComputer ScienceInformation SystemsData StructuresInformation RetrievalNatural Language ProcessingEvaluation Of Retrieval SystemsQuery ProcessingRetrieval ModelsSearch SystemsSearching AlgorithmsDynamic IndexingIndexingIndexing StructuresIndexing SystemsInverted Index StructuresInverted IndexesQuery EvaluationText Retrieval
The rapid growth of world-wide information systems results in new requirements for text indexing and retrieval. In this paper we propose an algorithm for query evaluation in text retrieval systems based on well-known inverted lists augmented with additional data structure and estimate expected performance gains. In addition to improved performance, this data structure is able to support dynamic indexing, which is especially important for environments where documents are changed frequently.
5
The R*-tree: an efficient and robust access method for points and rectangles
Norbert Beckmann, Hans‐Peter Kriegel, Ralf Schneider et al. · 1990 · 4.2K citations · Full text
Christos Faloutsos, Stavros Christodoulakis · ACM Transactions on Information Systems · 1984 · 325 citations · Full text