On high performance of updates within an efficient document retrieval system

• Published in: Information processing & management Vol. 30; no. 1; pp. 93 - 118
• Main Author: Motzkin, D.
• Format: Journal Article
• Language: English
• Published: Oxford Elsevier Ltd 1994; Elsevier Science; Pergamon Press; Elsevier Science Ltd
• Subjects: Access methods; Algorithms; B-trees; Binary Trees; Computerized information storage and retrieval; Data base management systems; Database Management Systems; Directories; Document retrieval; Efficient updates; Exact sciences and technology; File organization; Indices; Information and communication sciences; Information Retrieval; Information retrieval systems; Information retrieval systems. Information and document management system; Information science. Documentation; Inverted Files; M-B-T directory; M-B-T file structure; Multi-B-trees; Non-dense attributes; Sciences and techniques of general use; Searching; Studies; Subject Index Terms; Systems design; Tables (Data); Document retrieval; Efficient updates; Directories; M-B-T directory; Non-dense attributes; Database management systems; B-trees; Access methods; Indices; Multi-B-trees; Information retrieval; Performance evaluation; Indexing term; Data storage; Updating; Tree structure; Algorithm; Addressing; Index (documentation); Optimization; File layout; Research and development; Document retrieval system; File structure; Execution time
• ISSN: 0306-4573; 1873-5371
• DOI: 10.1016/0306-4573(94)90026-4

This paper introduces fast, dynamic update algorithms for document retrieval systems. The M-B-T file directory structure, which provides an efficient access path for document retrieval, is utilized for the efficient updates. This directory structure was shown to be compatible with current automatic retrieval and query processing techniques, and to have the capability of including weights that are assigned to index terms and other secondary attribute values with no additional cost. Updates are achieved with a high degree of efficiency. It is shown that this structure achieves a better overall performance than inverted files, standard B-trees, and other directory structures.