On materializing views and on-line queries

Extended abstract
  • Håkan Jakobsson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 646)


We consider the problem of traversing a database multiple times treated as solving on-line transitive closure queries. In order to solve such queries more efficiently than with the most basic methods, it is necessary to compute intermediate results that can be shared between queries. However, for on-line queries we assume that the pattern or existence of future queries is unknown which makes the problem of computing the right intermediate results difficult. We show how a technique based on utilizing subtrees of results computed for other queries can be used to solve the problem efficiently.


Common Ancestor Source Node Intermediate Result Transitive Closure Edge Structure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Aho, A. V., Hopcroft, J. E., Ullman, J. D., The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.Google Scholar
  2. [2]
    Bancilhon, F., “Naive evaluation of recursively defined relations,” in On Knowledge Base Management Systems, (M. L. Brodie and J. Mylopoulos, eds.), Springer-Verlag, New York, 1986.Google Scholar
  3. [3]
    Bancilhon, F., Maier D., Sagiv, Y., Ullman, J. D., “Magic sets and other strange ways to implement logic programs,” Proc. 5th ACM Symp. on Prociples of Database Sytems, pp. 1–15, 1986.Google Scholar
  4. [4]
    Grahne, G., Sippu, S., Soisalon-Soininen, E., “Efficient evaluation for a subset of recursive queries,” Journal of Logic Programming, 10:301–332, 1991.Google Scholar
  5. [5]
    Harel, D., Tarjan, R.E., “Fast algorithms for finding nearest common ancestors,” SIAM J. Computing 13(2), pp 338–355, 1984.CrossRefGoogle Scholar
  6. [6]
    Imai, H., Asano, T., “Dynamic orthogonal segment intersection search,” J. Algorithms 8, pp 1–18, 1987.Google Scholar
  7. [7]
    Jakobsson, H., “On tree-based techniques for query evaluation,” to appear in Proc. 11th ACM Symposium on Priciples of Database Systems, San Diego, California, 1992.Google Scholar
  8. [8]
    Jiang, B., “A suitable algorithm for computing partial transitive closures in databases,” Proc. of the IEEE Intl. Conf. on Data Engineering, pp 264–271, 1990.Google Scholar
  9. [9]
    Kemp, D. B., Ramamohanarao, K., Somogyi, Z., “Right-, left-, and multilinear rule transformations that maintain context information,” Proc. 16th Intl. Conf. on Very Large Databases, 1990.Google Scholar
  10. [10]
    Mumick, I. S., Pirahesh, H., “Extending the right-linear transformation,” Research report RJ 7938, IBM Research Division, 1991.Google Scholar
  11. [11]
    Mumick, I. S., Pirahesh, E., “Overbound and right-linear queries,” Proc. 10th ACM Symposium on Principles of Database Systems, pp 127–141, 1991.Google Scholar
  12. [12]
    Naughton, J. F., Ramakrishnan, R., Sagiv, Y., Ullman, J. D., “Efficient evaluation of right-left-, and multilinear rules,” Proc. ACM SIGMOD, 1989.Google Scholar
  13. [13]
    Purdom, P., “A transitive closure algorithm,” BIT 10 pp. 76–94, 1970.Google Scholar
  14. [14]
    Stiefeling, H., “Evaluation Strategies for a subclass of recursive database queries,” PhD thesis, Universität Hildesheim, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Håkan Jakobsson
    • 1
  1. 1.Computer Science DepartmentStanford UniversityStanfordUSA

Personalised recommendations