Skip Navigation

The Computer Journal 1977 20(4):321-324; doi:10.1093/comjnl/20.4.321
© 1977 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Nicklas, B. M.
Right arrow Articles by Schlageter, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Index structuring in inverted data bases by TRIES

B. M. Nicklas * and G. Schlageter *

Universitat Karlsruhe, Institut fue Angewandte Informatik und Formale Beschreibungsverfahren, Postfach 6380, Karsruhe, Germany

A new approach to index organisation in inverted data bases, the filter organisation, is presented, which seems to be superior to classical organisations for a large class of applications. The general advantages of inverted data bases, namely fast retrieval and simple implementation of set theoretic operations, are preserved. Major improvements are obtained concerning storage requirements of the indexes and update behaviour. By the filter concept high stability of the whole index is obtained.

Received June 1976.

* Universität Karlsruhe, Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Postfach 6380, D-7500 Karlsruhe, Germany


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.