Advertisement

Reducing page thrashing in recursive query processing

  • Rakesh Agrawal
  • Jerry Kiernan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 730)

Abstract

We introduce the problem of page thrashing in the seminaive algorithm for computing recursive queries. We present techniques that take into consideration the system's paging behavior during query computation to reduce this page thrashing. We also propose a buffering strategy based on the Query Locality Set Model that reduces the total memory requirement of a recursive query. We present simulation results that demonstrate the effectiveness of our techniques, both in single and multi-user environments.

Keywords

Transitive Closure Concurrent Process Page Size Query Locality Page Fault 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Rakesh Agrawal, Shaul Dar, and H. V. Jagadish. Direct Transitive Closure Algorithms: Design and Performance Evaluation. ACM Transactions on Database Systems, 15(3):427–458, September 1990.Google Scholar
  2. 2.
    Rakesh Agrawal and Jerry Kiernan. An Access Structure for Generalized Transitive Closure Queries. In Proc. 9th IEEE International Conference on Data Engineering, Vienna, April 1993.Google Scholar
  3. 3.
    Francois Bancilhon. Naive Evaluation of Recursively Defined Relations. Technical Report DB-004-85, MCC, 1985.Google Scholar
  4. 4.
    Francois Bancilhon and Raghu Ramakrishnan. An Amateur's Introduction to Recursive Query Processing Strategies. In Proc. ACM-SIGMOD International Conference on Management of Data, pages 16–52, Washington, D.C., May 1986.Google Scholar
  5. 5.
    Josephine Cheng, Donald Haderle, Richard Hedges, Bala Iyer, Theodore Messinger, C. Mohan, and Yun Wang. An Efficient Hybrid Join Algorithm: a DB2 Prototype. In Proc. 7th IEEE International Conference on Data Engineering, Kobe, April 1991.Google Scholar
  6. 6.
    Hong-Tai Chou and David J. DeWitt. An Evaluation of Buffer Management Strategies for Relational Database Systems. In Proc. 11th International Conference on Very Large Data Bases, Stockholm, August 1985.Google Scholar
  7. 7.
    Ulrich Güntzer, Werner Kiessling, and Rudolf Bayer. On the Evaluation of Recursion in (Deductive) Database Systems by Efficient Differential Fixpoint Iteration. In Proc. 3rd IEEE International Conference on Data Engineering, pages 120–129, Los Angeles, February 1987.Google Scholar
  8. 8.
    Robert Kabler, Yannis E. Ioannidis, and Michael J. Carey. Performance Evaluation of Algorithms for Transitive Closure. Information Systems, 17(5):415–441, September 1992.Google Scholar
  9. 9.
    P.-A. Larson and V. Deshpande. A File Structure Supporting Traversal Recursion. In Proc. ACM-SIGMOD International Conference on Management of Data, pages 243–252, Portland, May–June 1989.Google Scholar
  10. 10.
    H. Lu. New Strategies for Computing the Transitive Closure of a Database Relation. In Proc. 13th International Conference on Very Large Data Bases, Brighton, September 1987.Google Scholar
  11. 11.
    John McPherson and Hamid Pirahesh. Table Queue Evaluation Strategy. Research Report, IBM Almaden Research Center, 1991.Google Scholar
  12. 12.
    Giovanni Maria Sacco and Mario Schkolnick. A Mechanism for Managing the Buffer Pool in a Relational Database System using the Hot Set Model. In Proc. 8th International Conference on Very Large Data Bases, pages 257–262, Mexico City, September 1982.Google Scholar
  13. 13.
    Jeffrey D. Ullman. Principles of Database and Knowledge-Base Systems, volume 2. Computer Science Press, 1989.Google Scholar
  14. 14.
    Patrick Valduriez and Haran Boral. Evaluation of Recursive Queries Using Join Indices. In Proc. 1st International Conference on Expert Database Systems, pages 197–208, Charleston, South Carolina, April 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Rakesh Agrawal
    • 1
  • Jerry Kiernan
    • 1
  1. 1.IBM Almaden Research CenterSan Jose

Personalised recommendations