On the estimation of the number of desired records with respect to a given query
- 1 March 1978
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 3 (1) , 41-56
- https://doi.org/10.1145/320241.320245
Abstract
The importance of the estimation of the number of desired records for a given query is outlined. Two algorithms for the estimation in the “closest neighbors problem” are presented. The numbers of operations of the algorithms are Ο ( ml 2 ) and Ο ( ml ), where m is the number of clusters and l is the “length” of the query.Keywords
This publication has 7 references indexed in Scilit:
- Analysis of Effectiveness of Retrieval in Clustered FilesJournal of the ACM, 1977
- Precision Weighting—An Effective Automatic Indexing MethodJournal of the ACM, 1976
- Secondary index optimizationPublished by Association for Computing Machinery (ACM) ,1975
- Further experiments with hierarchic clustering in document retrievalInformation Storage and Retrieval, 1974
- Organization and maintenance of large ordered indexesActa Informatica, 1972
- Symmetric binary B-Trees: Data structure and maintenance algorithmsActa Informatica, 1972
- A relational model of data for large shared data banksCommunications of the ACM, 1970