ACM SIGMOD Anthology TODS dblp.uni-trier.de

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

Clement T. Yu, W. S. Luk, M. K. Siu: On the Estimation of the Number of Desired Records with Respect to a Given Query. ACM Trans. Database Syst. 3(1): 41-56(1978)
@article{DBLP:journals/tods/YuLS78,
  author    = {Clement T. Yu and
               W. S. Luk and
               M. K. Siu},
  title     = {On the Estimation of the Number of Desired Records with Respect
               to a Given Query},
  journal   = {ACM Trans. Database Syst.},
  volume    = {3},
  number    = {1},
  year      = {1978},
  pages     = {41-56},
  ee        = {http://doi.acm.org/10.1145/320241.320245, db/journals/tods/YuLS78.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

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 0(ml2) and O(ml), where m is the number of clusters and l is the "length" of the query.

Copyright © 1978 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.


Joint ACM SIGMOD / IEEE Computer Society Anthology

CDROM Version: Load the CDROM "Volume 3 Issue 1, TODS 1976-1990" and ... DVD Version: Load ACM SIGMOD Anthology DVD 2" and ... BibTeX

References

[1]
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, ISBN 0-201-00029-6
BibTeX
[2]
Rudolf Bayer, Edward M. McCreight: Organization and Maintenance of Large Ordered Indices. Acta Inf. 1: 173-189(1972) BibTeX
[3]
...
[4]
E. F. Codd: A Relational Model of Data for Large Shared Data Banks. Commun. ACM 13(6): 377-387(1970) BibTeX
[5]
Michael Hammer, Arvola Chan: Index Selection in a Self-Adaptive Data Base Management System. SIGMOD Conference 1976: 1-8 BibTeX
[6]
...
[7]
...
[8]
Mario Schkolnick: Secondary Index Optimization. SIGMOD Conference 1975: 186-192 BibTeX
[9]
...
[10]
Clement T. Yu, W. S. Luk: Analysis of Effectiveness of Retrieval in Clustered Files. J. ACM 24(4): 607-622(1977) BibTeX
[11]
Clement T. Yu, Gerard Salton: Precision Weighting - An Effective Automatic Indexing Method. J. ACM 23(1): 76-88(1976) BibTeX

Referenced by

  1. Weiyi Meng, King-Lup Liu, Clement T. Yu, Wensheng Wu, Naphtali Rishe: Estimating the Usefulness of Search Engines. ICDE 1999: 146-153
  2. Weiyi Meng, King-Lup Liu, Clement T. Yu, Xiaodong Wang, Yuhsi Chang, Naphtali Rishe: Determining Text Databases to Search in the Internet. VLDB 1998: 14-25
  3. David A. Bell, D. H. O. Ling, Sally I. McClean: Pragmatic Estimation of Join Sizes and Attribute Correlations. ICDE 1989: 76-84
  4. Matthias Jarke, Jürgen Koch: Query Optimization in Database Systems. ACM Comput. Surv. 16(2): 111-152(1984)
  5. Gregory Piatetsky-Shapiro, Charles Connell: Accurate Estimation of the Number of Tuples Satisfying a Condition. SIGMOD Conference 1984: 256-276
  6. K. Lam, Clement T. Yu: A Clustered Search Algorithm Incorporating Arbitrary Term Dependencies. ACM Trans. Database Syst. 7(3): 500-508(1982)
  7. Kenneth C. Sevcik: Data Base System Performance Prediction Using an Analytical Model (Invited Paper). VLDB 1981: 182-198
  8. Gerard Salton, A. Wong: Generation and Search of Clustered Files. ACM Trans. Database Syst. 3(4): 321-346(1978)
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
TODS, ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Tue Jun 24 18:38:38 2008