Elsevier

Information Processing Letters

Volume 19, Issue 3, 19 October 1984, Pages 157-161
Information Processing Letters

On estimating access costs in relational databases

https://doi.org/10.1016/0020-0190(84)90096-6Get rights and content

First page preview

First page preview
Click to open first page preview

References (18)

  • T.-Y. Cheung

    A statistical model for estimating the number of records in a relational database

    Inform. Process. Lett.

    (1982)
  • P.G. Selinger

    Access path selection in a relational database management system

    Proc. ACM SIGMOD Conf.

    (1979)
  • M.M. Astrahan et al.

    Performance of the SYSTEM R access path selection mechanism

    Proc. IFIP 80 Conf.

    (1980)
  • E. Wong et al.

    Decomposition: A strategy for query processing

    ACM TODS

    (1979)
  • S.B. Yao

    Optimization of query evaluation algorithms

    ACM TODS

    (1979)
  • A.F. Cardenas

    Analysis and performance of inverted data base structures

    Comm. ACM

    (1975)
  • S.B. Yao

    Approximating block accesses in data base organizations

    Comm. ACM

    (1977)
  • K.Y. Whang et al.

    Estimating block accesses in database organizations: A closed noniterative formula

    Comm. ACM

    (1983)
  • V.S. Luk

    On estimating block accesses in database organization

    Comm. ACM

    (1983)
There are more references available in the full text version of this article.

Cited by (15)

  • On the optimal ordering of multiple-field tables

    1994, Data and Knowledge Engineering
View all citing articles on Scopus
View full text