Skip Navigation

The Computer Journal 1987 30(4):343-348; doi:10.1093/comjnl/30.4.343
© 1987 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 (7)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Mullin, J. K.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Accessing Textual Documents using Compressed Indexes of Arrays of Small Bloom Filters

J. K. Mullin *

Department of Computer Science, University of Western Ontario, London, Ontario, Canada N6A 5B7

A highly compressed index for a collection of variable-sized documents is described. Arrays of small Bloom filters are used to efficiently locate documents where the search probe contains ‘anded’ and ‘ored’ combinations of words. Theoretical and experimental results are reported. The method is applicable to unplanned searching of large text files. We further describe a method to provide an index to the filters. Thus only a small proportion of the compressed filter need be examined. The method is highly amenable to parallel processing.

Received November 1985. revised May 1986.

* Department of Computer Science, University of Western Ontario, London, Ontario, Canada N6A 5B7


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.