Advertisement

On the mean execution time of recursive definitions on relational databases

  • W. Fernandez de la Vega
  • V. Th Paschos
  • A. N. Stafylopatis
Update And Queries
Part of the Lecture Notes in Computer Science book series (LNCS, volume 495)

Abstract

The execution cost of a regular recursive definition is evaluated in the case where the database relation is represented by means of a forest of labeled oriented trees. The cost is evaluated for all possible types of queries with respect to the binding of the variables in the definition. The mean execution cost is also evaluated, where the mean is computed over all databases representable by forests. Also, a cost reduction technique is investigated—the intermediate storage—and the corresponding execution cost is computed.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Aho A.V., Hopcroft J.E. and Ullman J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1975.Google Scholar
  2. [2]
    Banchilhon F. and Ramakrishnan R., An Amateur's Introduction to Recursive Query Processing Strategies, Proc. of the ACM SIGMOD conf., p.p. 16–52, 1989.Google Scholar
  3. [3]
    Fernandez de la Vega W., Paschos V. Th. and Stafylopatis A. N., On the Mean Execution Time of Recursive Definitions on Relational Databases, Rapport de Recherche no 604, Université de Paris 11, 1990.Google Scholar
  4. [4]
    Knuth D.E., The Art of Computer Programming, Vol. 1, Fundamental Algorithms, Addison-Wesley, 1973.Google Scholar
  5. [5]
    Meir A. and Moon J. W., On the Altitude of Nodes in Random Trees, Canad. J. of Mathematics, Vol. 30, No 5, p.p. 997–1015, 1978.Google Scholar
  6. [6]
    Naughton J., Data Independent Recursion in Deductive Databases, Proc. of Symp. on Principles of Database Systems, p.p. 267–279, 1986.Google Scholar
  7. [7]
    Naughton J. F., Ramakrishnan R., Sagiv Y. and Ullman J. D., Efficient Evaluation of Right-, Left-and Multi-Linear Rules, Proc. of the ACM SIGMOD conf., p.p. 235–242, 1989.Google Scholar
  8. [8]
    Paschos V.Th. and Stafylopatis A.N., Evaluation of the Execution Cost of Recurisve Definitions, The Computer Journal (to appear).Google Scholar
  9. [9]
    Rényi A., Some Remarks on the Theory of Trees, Publ. Math. Inst. Hungar. Acad. Sci., Vol.4, p.p. 73–85, 1959.Google Scholar
  10. [10]
    Stepanov V. E., On the Distribution of the Number of Vertices in Strata of a Random Tree, Th. Prob. and its Appl., Vol. 14, No 1, p.p. 65–78, 1969.Google Scholar
  11. [11]
    Ullman J.D., Principles of Database Systems, Computer Science Press, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • W. Fernandez de la Vega
    • 1
  • V. Th Paschos
    • 1
    • 2
  • A. N. Stafylopatis
    • 3
  1. 1.LRI, Université de Paris-SudOrsayFrance
  2. 2.C.E.R.M.S.E.M, Université de Paris 1-SorbonneParisFrance
  3. 3.Computer Science DivisionNational Technical University of AthensZographou, AthensGreece

Personalised recommendations