This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Recursive Aggregation and Negation in Deductive Databases
September/October 1998 (vol. 10 no. 5)
pp. 727-745

Abstract—We present an efficient evaluation technique for modularly stratified deductive database programs for which the local strata level mappings are known at compile time. We present an important subclass of these programs (called EMS-programs) in which one can easily express problems, such as shortest distance, company ownership, bill of materials, and preferential vote counting. Programs written in this style have an easy-to-understand semantics and can be efficiently computed. Another important virtue of these programs is that their modular-stratification properties are independent of the extensional database.

[1] I. Balbin and K. Ramamohanarao, "A Generalization of the Differential Approach to Recursive Query Evaluation," J. Logic Programming, vol. 4, no. 3, pp. 259-262, Sept. 1987.
[2] F. Bancilhon, "Naive Evaluation of Recursively Defined Relations," M. Brodie and J. Mylopoulos, eds., On knowledge-Base Management Systems—Integrating Database and AI Systems, pp. 165-178.New York: Springer-Verlag, 1986.
[3] F. Bancilhon, D. Maier, Y. Sagiv, and J.D. Ullman, "Magic Sets and Other Strange Ways to Implement Logic Programs," Proc. Fifth ACM PODS Symp. Principles of Database Systems, pp. 1-15, 1986.
[4] C. Beeri and R. Ramakrishnan, "On the Power of Magic," Proc. Sixth ACM PODS Symp. Principles of Database Systems, pp. 269-283, 1987.
[5] S. Ceri, G. Gottlob, and L. Tanca, "Logic Programming and Databases," Surveys in Computer Science. Springer-Verlag, 1990.
[6] W. Chen, T. Swift, and D.S. Warren, "Efficient Top-Down Computation of Queries Under the Well-Founded Semantics," J. Logic Programming, vol. 24, no. 3, pp. 161-199, Sept. 1995.
[7] W. Chen and D.S. Warren, "Tabled Evaluation with Delaying for General Logic Programs," J. ACM, vol. 43, no. 1, pp. 20-74, Jan. 1996.
[8] K.L. Clark, "Negation as Failure," H. Gallaire and J. Minker, eds., Logic and Data Bases, pp. 293-322. Plenum Press, 1978.
[9] Australian Electoral Commission, Fact Sheet, 1993; also Commonwealth Electoral Procedures, AEC, 1992, and Electoral Pocket Book, AEC, 1991.
[10] S. Ganguly, S. Greco, and C. Zaniolo, "Minimum and Maximum Predicates in Logic Programming," Proc. 10th ACM PODS Symp. Principles of Database Systems, pp. 154-163, 1991.
[11] M. Gelfond and V. Lifschitz, "The Stable Model Semantics for Logic Programming," Proc. Fifth Int'l Conf. and Symp. Logic Programming, pp. 1, 071-1, 080, 1988.
[12] S. Greco, C. Zaniolo, and S. Ganguly, "Greedy by Choice," Proc. 11th ACM PODS Symp. Principles of Database Systems, pp. 105-113, 1992.
[13] D. Kemp, K. Ramamohanarao, and P.J. Stuckey, "ELS-Programs and the Efficient Evaluation of Non-Stratified Programs by Transformation to ELS," Proc. Fourth Int'l Conf. Deductive and Object-Oriented Databases, pp. 91-108, Lecture Notes in Computer Science No. 1013, Dec. 1995.
[14] D.B. Kemp and K. Ramamohanarao, "Syntactically Recognizable Modularly Stratified Programs," Technical Report 93/15, Univ. of Melbourne, Australia, 1993.
[15] D.B. Kemp and K. Ramamohanarao, "A Deductive Database Solution to the Preferential Vote Counting Problem," Proc. Second ICLP Workshop on Deductive Databases, pp. 143-158, June 1994.
[16] D.B. Kemp, D. Srivastava, and P.J. Stuckey, "Bottom-Up Evaluation and Query Optimization of Well-Founded Models," Theoretical Computer Science, vol. 146, nos. 1-2, pp. 145-184, July 1995.
[17] D.B. Kemp and P.J. Stuckey, "Semantics of Logic Programs with Aggregatesm," Proc. 1991 Int'l Symp. Logic Programming, pp. 387-401, Oct. 1991.
[18] P.G. Kolaitis and C.H. Papadimitriou, "Why Not Negation by Fixpoint?" Proc. Seventh ACM Symp. Principles of Database Systems, pp. 231-239, Mar. 1988.
[19] A. Lefebvre, "Recursive Aggregates in the EKS-V1 System," Technical Report TR-KB 34, ECRC, European Computer-Industry Research Center, Munchen, Germany, Feb. 1991.
[20] A. Lefebvre, "Towards an Efficient Evaluation of Recursive Aggregates in Deductive Databases," 1993; New Generation of Computing J., to appear; earlier version published in Proc. FGCS Conf., 1992.
[21] J.W. Lloyd, Foundations of Logic Programming, Springer Series in Symbolic Computation, second ed. New York: Springer-Verlag, 1987.
[22] J.W. Lloyd and R.W. Topor, "Making Prolog More Expressive," J. Logic Programming, vol. 1, no. 3, pp. 225-240, 1984.
[23] I.S. Mumick, H. Pirahesh, and R. Ramakrishnan, “The Magic of Duplicates and Aggregates,” Proc. Very Large Data Base Conf., pp. 264–277, 1990.
[24] T.C. Przymusinski, "On the Declarative Semantics of Deductive Databases and Logic Programs," J. Minker, ed., Foundations of Deductive Databases and Logic Programming, pp. 193-216. Morgan Kaufmann, 1988.
[25] R. Ramakrishnan, D. Srivastava, and S. Sudarshan, "Controlling the Search in Bottom-Up Evaluation," Proc. 1992 Joint Int'l Conf. and Symp. Logic Programming., pp. 273-287, Nov. 1992.
[26] R. Ramakrishnan, D. Srivastava, S. Sudarshan, and P. Seshadri, "The Coral Deductive System," VLDB J., vol. 3, no. 2, pp. 161-210, 1994.
[27] K.A. Ross, "Modular Stratification and Magic Sets for DATALOG Programs with Negation," Proc. Ninth ACM PODS Symp. Principles of Database Systems, pp. 161-171, 1990; extended version, containing new results, obtained from author.
[28] K.A. Ross and Y. Sagiv, "Monotonic Aggregation in Deductive Databases," Proc. 11th ACM PODS Symp. Principles of Database Systems, 1992; also Proc. Workshop Deductive Databases Int'l Symp. Logic Programming, pp. 53-61, Oct. 1991.
[29] K. Sagonas, T. Swift, and D.S. Warren, "XSB as an Efficient Deductive Database Engine," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 442-453, May 1994.
[30] S. Sudarshan and R. Ramakrishnan, "Aggregation and Relevance in Deductive Databases," Proc. Int'l Conf. Very Large Databases, 1991.
[31] J. Ullman, Principles of Database and Knowledge-Base Systems, vol. 1. Computer Science Press, 1988.
[32] J.D. Ullman, Principles of Database and Knowledge-Base Systems, vol. II: The New Tech nologies. New York: Computer Science Press, 1989.
[33] J. Vaghani, K. Ramamohanarao, D.B. Kemp, Z. Somogyi, P.J. Stuckey, T.S. Leask, and J. Harland, "The Aditi Deductive Database System," VLDB J., vol. 3, no. 2, pp. 245-288, 1994.
[34] A. van Gelder,K. Ross, and J.S. Schlipf,"The well-founded semantics for general logic programs," J. ACM, vol. 38, no. 3, pp. 620-650, July 1991.
[35] C. Zaniolo, N. Arni, and K. Ong, "Negation and Aggregates in Recursive Rules: The${\cal LDL}\!\!+\!\!+$Approach," Proc. Third Int'l Conf. Deductive and Object-Oriented Databases, pp. 204-221, Dec. 1993.

Index Terms:
Aggregate operators, deductive database systems, EMS-programs, explicitly locally stratified, negation, query evaluation.
Citation:
David B. Kemp, Kotagiri Ramamohanarao, "Efficient Recursive Aggregation and Negation in Deductive Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 10, no. 5, pp. 727-745, Sept.-Oct. 1998, doi:10.1109/69.729729
Usage of this product signifies your acceptance of the Terms of Use.