Relational algebra operations and sizes of relations

  • Danièle Gardy
  • Claude Puech
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 172)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    F. Bancilhon, Ph. Richard, and M. Scholl, On line processing of compacted relations, Proc. VLDB 82, Mexico 1982.Google Scholar
  2. 2.
    M.W. Blasgen and K.P. Eswaran, "On the Evaluation of Queries in Relational Data Base Systems," RJ1745 (April 1976). IBM Research Report, IBM Research Center, San JoseGoogle Scholar
  3. 3.
    S. Christodoulakis, Estimating Block Transfers and Join Sizes, Proc. SIGMOD 83, San Jose, Cal. 1983.Google Scholar
  4. 4.
    W.W. Chu and P. Hurley, "Optimal query processing for distributed database systems," IEEE Transactions on Computers C-31(9)(1982).Google Scholar
  5. 5.
    R. Demolombe, Estimation of the number of tuples satisfying a query expressed in Predicate Calculus language, Proc. VLDB 80 1980.Google Scholar
  6. 6.
    R. Demolombe, "How to improve performance of relational DBMS," pp. 229–233 in Proc. IFIP 83, ed. Mason R.E.A.,Elsevier Science Publishers (1983).Google Scholar
  7. 7.
    D. Gardy, Evaluation de résultats d'opérations de l'algèbre relationnelle, Thèse de Troisième Cycle, Université de Paris-Sud, Orsay 1983.Google Scholar
  8. 8.
    E. Gelenbe and D. Gardy, "On the sizes of projections, I," Information Processing Letters 14(1)(1982).Google Scholar
  9. 9.
    E. Gelenbe and D. Gardy, The size of Projections of Relations Satisfying a Functional Dependency, Proc. VLDB 82, Mexico 1982.Google Scholar
  10. 10.
    L.R. Gotlieb, Computing joins of relations, Proc. SIGMOD 78 1978.Google Scholar
  11. 11.
    A.R. Hevner and S.B. Yao, "Query processing in distributed data base systems," IEEE Transactions On Software Engineering, (1979).Google Scholar
  12. 12.
    D. Maier, The Theory of Relational Databases, Computer Science Press (1983).Google Scholar
  13. 13.
    T.H. Merrett and Ekow Otoo, Distributions models of relations, Proc. VLDB 79, Rio de Janeiro 1979.Google Scholar
  14. 14.
    A.Y. Montgomery, Y.J. D'Souza, and S.B. Lee, "The cost of relational algebraic operations on skewed data: estimates and experiments," pp. 235–241 in Proc. IFIP 83, ed. Mason R.E.A.,Elsevier Science Publishers (1983).Google Scholar
  15. 15.
    Ph. Richard, Evaluation of the size of a query expressed in relational algebra, Proc. SIGMOD 81 1981.Google Scholar
  16. 16.
    A.S. Rosenthal, "Note on the expected size of a join," SIGMOD Record 11(4) pp. 19–25 (1981).Google Scholar
  17. 17.
    P. Griffiths Selinger, M.M. Astrahan, M.M. Chamberlin, R.A. Lorie, and T.G. Price, Access path selection in a relational Database System, Proc. ACM SIGMOD 1979.Google Scholar
  18. 18.
    J.M. Smith and P.Y.T. Chang, "Optimizing the performance of a relational algebra Database interface," CACM 18(10)(1975).Google Scholar
  19. 19.
    J.D. Ullmann, Principles of data base systems, Computer Science Press (1980).Google Scholar
  20. 20.
    S.B. Yao, "An attribute based model for data base access cost analysis," ACM TODS, (1977).Google Scholar
  21. 21.
    S.B. Yao, "Optimization of Query Evaluation Algorithms," ACM TODS 4(2) pp. 133–155 (1979).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Danièle Gardy
    • 1
  • Claude Puech
    • 1
  1. 1.Laboratoire de Recherche en Informatique, Bat 490Université de Paris-SudOrsay CédexFrance

Personalised recommendations