A file organization for cluster-based retrieval
- 1 May 1978
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGIR Forum
- Vol. 13 (1) , 65-82
- https://doi.org/10.1145/1013234.803136
Abstract
A file organization for cluster-based retrieval is presented and tested. This file organization is based on the bottom-up search which, in contrast to the more usual top-down search, starts at the lowest level of a cluster hierarchy (the documents) and looks at progressively larger clusters. This approach enables most of the efficiency problems previously associated with clustered file organizations to be avoided. There are two parts to this file organization - a compact cluster hierarchy representation which does not store cluster representatives and a compact inverted file which is used to provide a starting point for the bottom-up search. Retrieval experiments show that the bottom-up search using this file organization can be more effective than a serial search, especially if high precision results are required.Keywords
This publication has 4 references indexed in Scilit:
- ON‐LINE SEARCHING IN INFORMATION RETRIEVALJournal of Documentation, 1977
- Partial match retrievalBIT Numerical Mathematics, 1976
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- File organization schemes based on finite geometriesInformation and Control, 1968