City Research Online

Parallel search using partitioned inverted files

MacFarlane, A., McCann, J. A. & Robertson, S. E. (2000). Parallel search using partitioned inverted files. In: Seventh International Symposium on String Processing and Information Retrieval, 2000. SPIRE 2000. Proceedings. (pp. 209-220). IEEE COMPUTER SOC. doi: 10.1109/SPIRE.2000.878197

Abstract

We examine the search of partitioned Inverted Files with particular emphasis on issues which arise from different types of partitioning methods. Two types of Index Partitions are investigated: namely TermId and DocId. We describe the search operators implemented in order to support partitioned search. We also describe higher level features such as search topologies and relevance feedback in partitioned search. The results from runs on both type of partitioning are compared and contrasted.

Publication Type: Book Section
Additional Information: © 2000 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Z Bibliography. Library Science. Information Resources > Z665 Library Science. Information Science
Departments: School of Communication & Creativity > Media, Culture & Creative Industries > Library & Information Science
[thumbnail of par-SEARCH.pdf]
Preview
Text - Accepted Version
Download (144kB) | Preview

Export

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Downloads

Downloads per month over past year

View more statistics

Actions (login required)

Admin Login Admin Login