Journal ArticleOPEN ACCESS

On the Estimation of the Number of Desired Records with Respect to a Given Query

ACM Transactions on Database Systems (TODS) (1978) 3(1) 41-56
DOI: 10.1145/320241.320245
23Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

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 Ο(ml2) and Ο(ml), where m is the number of clusters and l is the “length” of the query. © 1978, ACM. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Yu, C. T., Luk, W. S., & Siu, M. K. (1978). On the Estimation of the Number of Desired Records with Respect to a Given Query. ACM Transactions on Database Systems (TODS), 3(1), 41–56. https://doi.org/10.1145/320241.320245

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free