Abstract
Knowledge about relation sizes for queries can be used to improve the performance of deductive database programs, e.g. to plan the order in which body goals are evaluated, or to “map” predicates to processors in distributed systems. For Horn programs, the analysis is complicated by the presence of function symbols and recursion. This paper describes an approach for statically computing upper bound estimates for relation sizes in Horn programs. The techniques are applicable to a wide class of programs that use structural recursion.
This work was supported in part by the National Science Foundation under grant number CCR-8702939.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C. Beeri and R. Ramakrishnan, “On the Power of Magic”, Proc. Sixth ACM Symposium on Principles of Database Systems, San Diego, March 1987, pp. 269–283.
S. Christodoulakis, “Estimating block transfers and join sizes”, Proc. ACM SIGMOD International Conference on Management of Data, pp. 40–54, May 1983.
J. Cohen and J. Katcoff, “Symbolic Solution of Finite-Difference Equations,” ACM Transactions on Mathematical Software 3, 3 (Sep. 1977), pp. 261–271.
S. Debray and D. Warren, “Functional Computations in Logic Programs,” ACM Transactions on Programming Languages and Systems 11, 3 (July 1989), pp. 451–481.
R. Demolombe, “Estimation of the number of tuples satisfying a query expressed in predicate calculus language”, Proc. Sixth International Conference on Very Large Databases, pp. 55–63, Montreal, Canada, 1980.
W.-C. Hou, G. Ozsoyoglu, and B. K. Taneja, “Statistical estimators for relational algebra expressions”, Proc. Seventh ACM Symposium on Principles of Database Systems, pp. 276–287, Austin, Texas, March 1988.
J. Ivie, “Some MACSYMA Programs for Solving Recurrence Relations,” ACM Transactions on Mathematical Software 4, 1 (March 1978), pp. 24–33.
S. Kaplan, “Algorithmic Complexity of Logic Programs,” Logic Programming, Proc. Fifth International Conference and Symposium, 1988, pp. 780–793.
R. Lipton and J. Naughton, “Estimating the size of Generalized Transitive Closures”, Proc. Fifteenth International Conference on Very Large Data Bases, Amsterdam, Aug. 1989, pp. 165–172.
R. Lipton and J. Naughton, “Query Size Estimation by Adaptive Sampling”, Proc. Ninth ACM Symposium on Principles of Database Systems, April 1990.
R. Ramakrishnan, “Magic Templates: A Spellbinding Approach to Logic Programs”, Proc. Fifth International Conference on Logic Programming, Aug. 1988, pp. 140–160.
P. Selinger, M. Astrahan, D. Chamberlin, R. Lorie, and T. Price, “Access path selection in a relational database management system”, Proc. ACM SIGMOD International Symposium on Management of Data, pp. 23–34, 1979.
D. E. Smith and M. R. Genesereth, “Ordering Conjunctive Queries,” Artificial Intelligence 26 (1985), pp. 171–215.
S.-Å. Tarnlund, “Horn Clause Computability”, BIT vol. 17, pp. 215–226, 1977.
A. Van Gelder, “Deriving Constraints Among Argument Sizes in Logic Programs,” Proc. Ninth ACM Symposium on Principles of Database Systems, April 1990.
D. H. D. Warren, “Efficient Processing of Interactive Relational Database Queries Expressed in Logic”, Proc. Seventh International Conference on Very Large Data Bases, 1981, pp. 272–281.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Debray, S.K., Lin, NW. (1990). Static estimation of query sizes in horn programs. In: Abiteboul, S., Kanellakis, P.C. (eds) ICDT '90. ICDT 1990. Lecture Notes in Computer Science, vol 470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53507-1_99
Download citation
DOI: https://doi.org/10.1007/3-540-53507-1_99
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53507-2
Online ISBN: 978-3-540-46682-6
eBook Packages: Springer Book Archive