Abstract
A normalization process is proposed to serve not only as a preprocessing stage for compilation and evaluation but also as a tool for classifying recursions. Then the query-independent compilation and chain-based evaluation method can be extended naturally to process a class of DOOD programs and queries. The query-independent compilation captures the bindings that could be difficult to be captured otherwise. The chain-based evaluation explores query constraints, integrity constraints, recursion structures, and other features of the programs with a set of interesting techniques, such as chain-following, chain-split, and constraint pushing. Therefore, with this normalization and compilation process, a class of DOOD queries can be evaluated efficiently in deductive and object-oriented databases.
Research is partially supported by the Natural Sciences and Engineering Research Council of Canada under the grant OGP0037230 and by the Networks of Centres of Excellence Program (with the participation of PRECARN association) under the grant IRIS-IC-2.
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
W. Chen, M. Kifer, and D. S. Warren. Hilog: A foundation for higher-order logic programming. J. Logic Programming, 15.187–230, 1993.
S. Greco, N. Leone, and P. Rullo. COMPLEX: an object-oriented logic programming system. IEEE Trans. Knowledge and Data Engineering, 4:344–359, 1992.
J. Han. Constraint-based query evaluation in deductive databases. IEEE Trans. Knowledge and Data Engineering, 6:96–107, 1994.
J. Han. Chain-split evaluation in deductive databases. IEEE Trans. Knowledge and Data Engineering, 7:261–273, 1995.
J. Han and L. V. S. Lakshmanan. Evaluation of regular nonlinear recursions by deductive database techniques. Information Systems, 20, 1995 (to appear).
J. Han, L. Liu, and Z. Xie. LogicBase: A deductive database system prototype. In Proc. 3rd Int'l Conf. on Information and Knowledge Management, pp. 226–233, Gaithersburg, Maryland, Nov. 1994.
J. Han and K. Zeng. Automatic generation of compiled forms for linear recursions. Information Systems, 17:299–322, 1992.
M. Jeusfeld and M. Staudt. Query optimization in deductive object bases. In J. C. Freytag, D. Maier, and G. Vossen, editors, Query Processing for Advanced Database Systems, pp. 146–176. Morgan Kaufmann, 1994.
M. Kifer, G. Lausen, and J. Wu. Logical foundations for object-oriented and frame-based languages. In Journal of ACM, 42, 1995.
K. Sagonas, T. Swift, and D. S. Warren. XSB as an efficient deductive database engine. In Proc. 1994 ACM SIGMOD Int. Conf. Management of Data, pp. 442–453, Minneapolis, MN, May 1994.
D. Srivastava, R. Ramakrishnan, P. Seshadri, and S. Sudarshan. Coral++: Adding object-orientation to a logic database language. In Proc. 19th Int. Conf. Very Large Data Bases, pp. 158–170, Dublin, Ireland, August 1993.
Z. Xie. Query Evaluation in Deductive and Object-Oriented Databases. PhD thesis, School of Computing Science, Simon Fraser University, January 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xie, Z., Han, J. (1995). Normalization and compilation of deductive and object-oriented database programs for efficient query evaluation. In: Ling, T.W., Mendelzon, A.O., Vieille, L. (eds) Deductive and Object-Oriented Databases. DOOD 1995. Lecture Notes in Computer Science, vol 1013. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60608-4_57
Download citation
DOI: https://doi.org/10.1007/3-540-60608-4_57
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60608-6
Online ISBN: 978-3-540-48460-8
eBook Packages: Springer Book Archive