File access level optimization using page access graph on recursive query evaluation
As the performance measure for recursive query evaluation algorithms in the deductive database system, the largest amount of necessary storage space for intermediate results measured by the number of tuples has been usually employed. In this paper, using a practical performance evaluation measure based on the physical file access; namely, the number of pages accessed, we will investigate a general framework of efficient file access strategies for the transitive closure computation, which is one of performance bottlenecks in the recursive query evaluation. We introduce the page access graph for representing the page structure of a given file, and this graph provides the basis for considering the optimization of page access scheduling. Under the assumption that whole or a part of this graph is processed in the main memory, if the graph is acyclic, our algorithm provides the optimal page access scheduling, i.e., each page has to be fetched at most once.
KeywordsMain Memory Transitive Closure Query Evaluation Database Graph Strongly Connect Component
Unable to display preview. Download preview PDF.
- R. Agrawal and H.V. Jagadish, “Direct Transitive Closure Algorithms: Design and Performance Evaluation”, Technical Memorandum, AT&T Bell Laboratories, Murray Hill, New Jersey, 1987.Google Scholar
- F. Bancilhon, “Naive Evaluation of Recursively Defined Relations”, On Knowledge-base Management Systems (M. Brodie and J. Mylopoulos eds.), Springer-Verlag, New York, 1986, pp.165–178.Google Scholar
- F.Bancilhon, D.Maier, Y.Sagiv and J.Ullman, “Magic Set and Other Strange Ways to Implement Logic Programs”, Proc. 5th ACM SIGMOD-SIGACT Symposium on Principles of Database Systems, Cambridge, Massachusetts, 1986, pp.1–15.Google Scholar
- F.Bancilhon and R.Ramakrishnan, “An Amateur's Introduction to Recursive Query Processing Strategies”, Proc. ACM-SIGMOD Int'l Conf. on Management of Data, Washington D.C., 1986, pp.16–52.Google Scholar
- J. Han and L.J. Henschen, “Processing Linear Recursive Database Queries by Level and Cycle Marging”, Tech. Rep. 87-05-DBM-01, North Western Univ., Chicago, 1987.Google Scholar
- J.Han and L.J.Henschen, “Handling Redundancy in the Processing of Database Queries”, Proc. of ACM SIGMOD Int'l Conf. on Management of Data, San Francisco, California, 1987, pp.73–81.Google Scholar
- J. Han, G. Qadah and C. Chaou, “The Processing and Evaluation of Transitive Closure Queries”, LCCR Tech. Rep. 88-1, Simon Fraser Univ., Canada, 1988.Google Scholar
- Y.E. Ioannidis and R. Ramakrishnan, “Efficient Transitive Closure Algorithms”, Proc. 14th Int'l Conf. Very Large Data Bases, Los Angels, California, 1988, pp. 382–394.Google Scholar
- H. Lu, “New Strategies for Computing the Transitive Closure of Database Relation”, Proc. 13th Int'l Conf. on Very Large Data Bases, Brighton, England, 1987, pp.255–266.Google Scholar
- P.Valduriez and H.Boral, “Evaluation of Recursive Queries Using Join Indices”, Proc. the 1st Int'l Conf. on Expert Database Systems, Charleston, South Carolina, 1986, pp.197–208.Google Scholar