This Article 
 Bibliographic References 
 Add to: 
Constraint-Based Query Evaluation in Deductive Databases
February 1994 (vol. 6 no. 1)
pp. 96-107

Constraints play an important role in the efficient query evaluation in deductive databases. Constraint-based query evaluation in deductive databases is investigated, with emphasis on linear recursions with function symbols. Constraints are grouped into three classes: rule constraints, integrity constraints, and query constraints. Techniques are developed for the maximal use of different kinds of constraints in rule compilation and query evaluation. The study on the roles of different classes of constraints in set-oriented evaluation of linear recursions shows the following: rule constraints should be integrated with their corresponding deduction rules in the compilation of recursions; integrity constraints, including finiteness constraints and monotonicity constraints, should be used in the analysis of finite evaluability and termination for specific queries; and query constraints, which are often useful in search space reduction and termination, should be transformed, when necessary, and should be pushed into the compiled chains as deeply as possible for efficient evaluation. The constraint-based query-processing technique integrates query-independent compilation and chain-based query evaluation methods and demonstrates its great promise in deductive query evaluation.

[1] F. Bancilhon and R. Ramakrishnan, "An amateur's introduction to recursive query processing strategies," inProc. 1986 ACM-SIGMOD Conf. Management of Data(Washington, DC), May 1986, pp. 16-52.
[2] F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman, "Magic sets and other strange ways to implement logic programs," inProc. 5th ACM Symp. Principles of Database Syst.(Cambridge, MA), Mar. 1986, pp. 1-15.
[3] C. Beeri, P. Kanellakis, F. Bancilhon, and R. Ramakrishnan, "Bounds on the propagation of selection into logic programs," inProc. 6th ACM Symp. Principles of Database Syst., San Diego, CA, Mar. 1987, pp. 214-226.
[4] A. Brodsky and Y. Sagiv, "On termination of datalog programs,"Proc. 1st Int. Conf. Deductive and Object-Oriented Databases (DOOD'89), Kyoto, Japan, 1989, pp. 95-112.
[5] U.S. Chakravarthy, J. Grant, and J. Minker, "Logic-based approach to semantic query optimization,"ACM Trans. Database Syst., vol. 15, pp. 162-207, 1990.
[6] J. Han and W. Lu, "Asynchronous chain recursions,"IEEE Trans. Knowledge Data Eng., vol. 1, pp. 185-195, 1989.
[7] D. Geiger and A. Yuille, "A common framework for image segmentation," inProc. Int. Conf. Patt. Recog. ICPR-90, (Atlantic City), 1990, pp. 502-507.
[8] J. Han and K. Zeng, "Automatic generation of compiled forms for linear recursions,"Information Syst., vol. 17, pp. 299-322, 1992.
[9] J. Han, "Compilation-based list processing in deductive databases,"Extending Database Technol. (EDBT'92). New York: Springer-Verlag, 1992, pp. 104-119.
[10] J. Han, "Chain-split evaluation in deductive databases,"Proc. 8th Int. Conf. Data Eng., Phoenix, AZ, 1992, pp. 376-384.
[11] L. J. Henschen and S. Naqvi, "On compiling queries in recursive first-order databases,"J. ACM, vol. 1, no. 1, pp. 47-85, 1984.
[12] T. Imielinski, "Intelligent query answering in rule based systems,"J. Logic Programming, vol. 4, pp. 229-257, 1987.
[13] J. Jaffar and J-L. Lassez, "Constraint Logic Programming,"Proc. 14th ACM Symp. Principles Programming Languages, ACM, New York, 1987, pp. 111-119.
[14] B. Jiang, "A suitable algorithm for computing partial transitive closures,"Proc. 6th Int. Conf. Data Eng., Los Angeles, CA, 1990, pp. 264-271.
[15] P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz, "Constraint Query Languages,"Proc. 9th ACM Symp. Principles of Database Syst., Nashville, TN, 1990, pp. 299-313.
[16] D.B. Kemp, K. Ramamohanarao, I. Balbin, and K. Meenakshi, "Propagating constraints in recursive deductive databases,"Proc. 1989 North American Conf. Logic Programming, Cleveland, OH, 1989, pp. 981-998.
[17] R. Krishnamurthy, R. R. Ramakrishnan, and O. Shmueli, "A framework for testing safety and effective computability," inProc. ACM SIGMOD Int. Conf. Management Data, 1988, pp. 154-163.
[18] L. V. S. Lakshmanan and R. Missaoui, "On semantic query optimization in deductive databases,"Proc. 8th Int. Conf. Data Eng., Phoenix, AZ, 1992, pp. 368-375.
[19] S. Lee and J. Han, "Semantic query optimization in recursive databases,"Proc. 4th Int. Conf. Data Eng., Los Angeles, CA, 1988, pp. 444-451.
[20] M. J. Maher and P. J. Stuckey, "Expanding query power in constraint logic programming languages,"Proc. 1989 North American Conf. Logic Programming, Cleveland, OH, 1989, pp. 20-36.
[21] D. Maier and D.S. Warren,Computing with Logic: Logic Programming with Prolog, Benjamin/Cummings, Menlo Park, Calif., 1988.
[22] R. Ramakrishnan, F. Bancilhon, and A. Silberschatz, "Safety of recursive Horn clauses with infinite relations," inProc. ACM SIGACT-SIGMOD Symp. Principles of Database Systems, 1987, pp. 328-339.
[23] R. Ramakrishnan, D. Srivastava, and S. Sudarshan, "Coral--Control, relations and logic,"Proc. 18th Int. Conf. Very Large Data Bases, Vancouver, BC, Canada, 1992, pp. 547-559.
[24] A. Rosenthal, S. Heiler, U. Dayal, and F. Manola, "Traversal recursion: a practical approach to supporting recursive applications," inProc. 1986 ACM SIGMOD Conf.(Washington, DC), 1986, pp. 166-176.
[25] Y. Sagiv and M. Vardi, "Safety of datalog queries over infinite databases,"Proc. 8th ACM Symp. Principles of Database Syst., Philadelphia, PA, 1989, pp. 160-171.
[26] L. Sterling and E. Shapiro,The Art of Prolog, Cambridge, MA: MIT Press, 1986.
[27] J. D. Ullman,Database and Knowledge-base Systems. Rockville, MD: Computer Science Press, 1988.

Index Terms:
deductive databases; query processing; knowledge based systems; program compilers; constraint handling; data integrity; constraint-based query evaluation; deductive databases; linear recursions; function symbols; rule constraints; integrity constraints; query constraints; rule compilation; set-oriented evaluation; deduction rules; finiteness constraints; monotonicity constraints; finite evaluability; search space reduction; compiled chains; chain-based query evaluation methods; query-independent compilation
J. Han, "Constraint-Based Query Evaluation in Deductive Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 1, pp. 96-107, Feb. 1994, doi:10.1109/69.273030
Usage of this product signifies your acceptance of the Terms of Use.