
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
S. Ceri, G. Gottlob, L. Tanca, "What You Always Wanted to Know About Datalog (And Never Dared to Ask)," IEEE Transactions on Knowledge and Data Engineering, vol. 1, no. 1, pp. 146166, March, 1989.  
BibTex  x  
@article{ 10.1109/69.43410, author = {S. Ceri and G. Gottlob and L. Tanca}, title = {What You Always Wanted to Know About Datalog (And Never Dared to Ask)}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {1}, number = {1}, issn = {10414347}, year = {1989}, pages = {146166}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.43410}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  What You Always Wanted to Know About Datalog (And Never Dared to Ask) IS  1 SN  10414347 SP146 EP166 EPD  146166 A1  S. Ceri, A1  G. Gottlob, A1  L. Tanca, PY  1989 KW  optimisation methods; Datalog; database query language; logic programming; syntax; semantics; relational database; logic programming; query languages; relational databases VL  1 JA  IEEE Transactions on Knowledge and Data Engineering ER   
Datalog, a database query language based on the logic programming paradigm, is described. The syntax and semantics of Datalog and its use for querying a relational database are presented. Optimization methods for achieving efficient evaluations of Datalog queries are classified, and the most relevant methods are presented. Various improvements of Datalog currently under study are discussed, and what is still needed in order to extend Datalog's applicability to the solution of reallife problems is indicated.
[1] S. Abiteboul and S. Grumbach, "Bases de donnees et objets complexes,"Tech. Sci. Inform., vol. 6, no. 5, 1987.
[2] S. Abiteboul and C. Beeri, "On the power of languages for the manipulation of complex objects," inProc. Int. Workshop Theory Appl. Nested Relations Complex Objects, Darmstadt, West Germany, abstract, 1987.
[3] S. Abiteboul and R. Hull, "Data functions, datalog and negation," inProc. ACMSIGMOD Conf., 1988.
[4] S. Abiteboul and V. Vianu, "Procedural and declarative database update languages," inProc. ACM SIGMODSIGACT Symp. Principles Database Syst., 1988, pp. 240250.
[5] S. Abiteboul and P. C. Kanellakis, "Object identity as a query language primitive," manuscript, 1989.
[6] P. Aczel, "An introduction to inductive definitions," inThe Hondbook of Mathematical Logic, J. Barwise, Ed. Amsterdam, The Netherlands: NorthHolland, 1977, pp. 739782.
[7] R. Agrawal and H. V. Jagadish, "Direct algorithms for computing the transitive closure of database relations," inProc. 13th Int. Conf. Very Large Data Bases, Brighton, England, Sept. 1987, pp. 255266.
[8] R. Agrawal, "Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries,"Proc. Third Int'l Conf. Data Eng., CS Press, Los Alamitos, Calif., Order No. FN762, 1987, pp. 580590.
[9] R. Agrawal, "Multiprocessor transitive closure algorithms,"Data Eng.(Special Issue on Databases for Parallel and Distributed Systems), vol. 12. Mar. 1989.
[10] A. Aho and J. Ullman, "Universality of data retrieval languages," inProc. 6th ACM Symp: Principles of Programming Languages, San Antonio, TX, Jan. 1979.
[11] K. R. Apt and M. H. van Emden, "Contributions to the theory of logic programming,"JACM, vol. 29, pp. 841862, 1982.
[12] C. Apt, H. Blair, and A. Walker, "Towards a theory of declarative knowledge,"IBM Res. Rep.RC 11681, Apr. 1986.
[13] F. Bancilhon, "Naive evaluation of recursively defined relations," inOn Knowledge Based Management SystemsIntegrating Database and AI Systems, Brodie and Mylopoulos, Eds. New York: SpringerVerlag, 1985.
[14] 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. 115.
[15] F. Bancilhon and R. Ramakrishnan, "An amateur's introduction to recursive query processing strategies," inProc. 1986 ACMSIGMOD Conf. Management of Data(Washington, DC), May 1986, pp. 1652.
[16] F. Bancilhon and R. Ramakrishnan, "Performance evaluation of data intensive logic programs," inProc. Workshop Foundation of Deductive Databases and Logic Programming, Washington, DC, Aug. 1986.
[17] F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman, "Magic sets: Algorithms and examples," manuscript, 1986.
[18] F. Bancilhon and S. Khoshafian, "A calculus for complex objects," inProc. 5th ACM SIGMODSIGACT Symp. on Principles of Database Syst., 1986, pp. 5359.
[19] F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez, "FAD: a powerful and simple database language," inProc. 13th VLDB Conf. (Brighton, UK), 1987, pp. 97105.
[20] R. Bayer, "Query evaluation and recursion in deductive database systems," manuscript, 1985.
[21] C. Beeri, S. Naqvi, R. Ramakrishnan, O. Shmueli, and S. Tsur, "Sets and negation in logic database language (LDL1)," inProc. 6th ACM SIGMODSIGACT Symp. on Principles of Database Syst. (San Diego, CA), 1987, pp. 2137.
[22] C. Beeri and R. Ramakrishnan, "On the power of magic," inProc. 6th ACM Symp. Principles of Database Syst.(San Diego, CA), Mar. 1987, pp. 269283.
[23] C. Beeri, "Data models and languages for databases," inProc. 2nd Int. Conf. Database Theory, Bruges, Belgium, 1988; and inLNCS 326. New York: SpringerVerlag, 1988.
[24] J. Bocca, H. Decker, J.M. Nicolas, L. Vielle, and M. Wallace, "Some steps toward a DBMSbased KBMS," inProc. IFIP World Conf., Dublin, 1986.
[25] J. Bocca, "On the evaluation strategy of EDUCE," inProc. ACMSIGMOD Conf., Washington, DC, May 1986.
[26] M. L. Brodie, "Future intelligent information systems: AI and database technologies working together," inReadings in Artificial Intelligence and Databases. San Mateo, CA: Morgan Kaufman, 1988.
[27] F. Bry, "Logic programming as constructivism: A formalization and its application to databases," in8th ACM Symp. Principles Database Syst. (PODS), Mar. 1989, pp. 3450.
[28] S. Ceri, G. Gottlob, and L. Lavazza, "Translation and optimization of logic queries: The algebraic approach," inProc. VLDB Conf., Koto, Japan, Aug. 1986.
[29] S. Ceri and L. Tanca, "Optimization of systems of algebraic equations for evaluating datalog queries," inProc. 11th Int. Conf. on Very Large Data Bases(Brighton, UK), Aug. 1987.
[30] S. Ceri, S. Crespi Reghizzi, G. Gottlob, F. Lamperti, L. Lavazza, L. Tanca, and R. Zicari, "The ALGRES project," inProc. Int. Conf. Extending Database Technol. (EDBT88), Venice, 1988.
[31] S. Ceri, S. CrespiReghizzi, L. Lavazza, and R. Zicari, "ALGRES: A system for the specification and prototyping of complex databases," Dip. Elettronica, Politecnico di Milano, Int. Rep. 87018, 1987.
[32] S. Ceri, S. CrespiReghizzi, G. Lamperti, L. Lavazza, and R. Zicari, "ALGRES: An advanced database system for complex applications,"IEEE Software, to be published.
[33] S. Ceri, G. Gottlob, and G. Wiederhold, "Efficient database access through Prolog,"IEEE Trans. Software Eng., Feb. 1989.
[34] S. Ceri, G. Gottlob, and L. Tanca,Logic Programming and Databases. Berlin: SpringerVerlag, 1990.
[35] U. S. Chakravarthy, J. Minker, and J. Grant, "Semantic query optimization: Additional constraints and control strategies," inProc. 1st Int. Conf. Expert Database Syst., L. Kerschberg, Ed., Charleston, 1986; and inExpert Database Systems. Menlo Park, CA: BenjaminCummings, 1987.
[36] U. S. Chakravarthy, J. Grant, and J. Minker, "Foundations of semantic query optimization for deductive databases," inProc. Int. Workshop Foundations Deductive Databases Logic Programming, J. Minker, Ed., Aug. 1986.
[37] A. Chandra and D. Harel, "Horn clause queries and generalizations,"J. Logic Programming, vol. 1, pp. 115, 1985.
[38] A. Chandra, "A theory of database queries," inProc. ACM SIGMODSIGACT Symp. Principles Database Syst., Mar. 1988.
[39] C. L. Chang and R. C. T. Lee,Symbolic Logic and Mechanical Theorem Proving. New York: Academic, 1973.
[40] C. C. Chang and H. J. Keisler,Model Theory. Amsterdam, The Netherlands, 1977.
[41] C. Chang, "On the evaluation of queries containing derived relations in relational databases," inAdvances in Database Theory, Vol. 1, H. Gallaire, J. Minker, and J. M. Nicholas, Eds. New York: Plenum, 1981.
[42] C. L. Chang and A. Walker, "PROSQL: A Prolog programming interface with SQL/DS," inProc. 1st Int. Workshop on Expert Database Syst., L. Kerschberg, Ed., 1986, pp. 233246.
[43] D. Chimenti, T. O'Hare, R. Krishnamurthy, S. Naqvi, S. Tsur, C. West, and C. Zaniolo, "An overview of the LDL system," Special Issue on Databases and Logic,IEEE Data Engineering, vol. 10, Dec. 1987.
[44] K. L. Clark, "Negation as failure," inLogic and Databases. New York: Plenum, 1978.
[45] W. F. Clocksin and C. S. Mellish,Programming in Prolog. New York: SpringerVerlag, 1984.
[46] F. Cuppens and R. Demolombe, "A PROLOGrelational DBMS interface using delayed evaluation," presented at the Workshop on Integration of Logic Programming and Databases, Venice, Dec. 1986.
[47] P. Devanbu and R. Agrawal, "Moving selections into fixpoint queries," manuscript, Bell Labs, Murray Hill, NJ, 1986.
[48] P. Fischer and S. Thomas, "Operators for nonfirstnormalform relations," inProc. 7th Int. Comput. Software Appl. Conf., Chicago, IL, 1983.
[49] M. Fitting, "A KripkeKleene semantics for logic programs,"J. Logic Programming, vol. 2, pp. 295312, 1985.
[50] K. Fuchi, "Revisiting original philosophy of fifth generation computer project," presented at the Int. Conf. Fifth Generation Comput. Syst., 1984.
[51] H. Gallaire and J. Minker,Logic and Data Bases. New York: Plenum, 1978.
[52] G. Gardarin and C. De Maindreville, "Evaluation of database recursive logic programs as recurrent function series," inProc. ACMSIGMOD Conf., Washington, DC, May 1986.
[53] G. Gardarin and E. Simon, "Les systemes de gestion de bases se donnees deductives,"Technique et Science Informatiques, vol. 6, 1987.
[54] G. Gardarin, "Magic functions: A technique to optimize extended datalog recursive programs," inProc. ACM Int. Conf. Very Large Data Bases, 1987, pp. 2130.
[55] G. Gentzen, "Die Wiederspruchsfreiheit der reinen Zahlentheorie,"Math. Annalen, vol. 112, pp. 493565, 1936.
[56] K. Gödel, "Die Vollständigkeit der Axiome des logischen Funktionenkalküls,"Monatshefte für Mathematik und Physik, vol. 37, pp. 349360, 1930.
[57] K. Gödel, "Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I,"Monatshefte für Mathematik und Physik, vol. 38, pp. 173198, 1931.
[58] A. Guttman, "New features for relational database systems to support CAD applications," Ph.D. dissert., Comput. Sci. Dept., Univ. California, Berkley, June 1984.
[59] L. J. Henschen and S. Naqvi, "On compiling queries in recursive firstorder databases,"J. ACM, vol. 1, no. 1, pp. 4785, 1984.
[60] D. Hilbert, "Axiomatisches Denken,"Mathematische Annalen 78, pp. 405415, 1918.
[61] Y. E. Ioannidis and E. Wong, "An algebraic approach to recursive inference," Electron. Res. Lab., Univ. California, Berkeley, Int. Rep. UCB/ERL M85/92, 1985.
[62] Y. E. Ioannidis, "On the computation of the transitive closure of relational operators, " inProc. 12th Int. Conf. Very Large Databases, Kyoto, Japan, 1986.
[63] Y. E. Ioannidis and E. Wong, "Transforming nonlinear recursion into linear recursion," manuscript, 1987.
[64] Y. E. Ioannidis, J. Chen, M. A. Friedman, and M. M. Tsangaris, "BERMUDAAn architectural perspective on interfacing Prolog to a database machine," Dep. Comput. Sci., Univ. Wisconsin, Tech. Rep. 723, Oct. 1987.
[65] H. Itoh, "Research and development on knowledge base systems at ICOT," inProc. 12th Int. Conf. Very Large Data Bases, Kyoto, Japan, Aug. 1986.
[66] G. Jaeschke and H. J. Schek, "Remarks on the algebra of non first normal form relations," inProc. ACM Symp. Principles Database Syst., Los Angeles, CA, Mar. 1982, pp. 124138.
[67] J. F. Jenq and S. Sahni, "All pairs shortest paths on a hypercube multiprocessor," inProc. IEEE Int. Conf. Parallel Processing, Aug. 1987.
[68] M. Kifer and E. L. Lozinskii, "Filtering data flow in deductive databases," inProc. Int. Conf. Database Theory, Rome, Italy, Sept. 1986, pp. 186202.
[69] W. Kim, D. S. Reiner, and D. S. Batory,Query Processing in Database Systems. New York: SpringerVerlag, 1985.
[70] J. King, "Quist: A system for semantic query optimization in relational databases," inProc. 7th Int. Conf. Very Large Data Bases, Cannes, 1981.
[71] Ph.G. Kolaitis, "On the expressive power of stratified datalog programs," Stanford Univ., Stanford, CA, preprint, Nov. 1987.
[72] G. Kolaitis and C. H. Papadimitriou, "Why not negation by fixpoint?" inProc. 7th ACM Conf. on Principle of Database Syst.(Austin, TX), 1988.
[73] R. Krishnamurthy and C. Zaniolo, "Optimization in a logic based language for knowledge and data intensive applications," inProc. Int. Conf. Extending Database Technol. (EDBT88). Venice, 1988; andLNCS, No. 303. New York: SpringerVerlag, 1988.
[74] K. Kunen, "Negation in logic programming,"J. Logic Programming, vol. 4, pp. 289308, 1987.
[75] G. M. Kuper, "Logic programming with sets," inProc. ACM SIGMODSIGACT Symp. Principles Database Syst., 1987, pp. 11 20.
[76] E. Lambrichts, P. Nees, J. Paredaens, P. Peelman, and L. Tanca, "MilAnt: An extension of datalog with complex objects, functions and negation," Dep. Comput. Sci., Univ. Antwerp, Int. Rep., 1988.
[77] E. Lambrichts, P. Nees, J. Paredaens, P. Peelman, and L. Tanca, "Integration of functions in the fixpoint semantics of rule based systems," inProc. 2nd Symp. Math. Fundamentals Database Theory, Visegrad, Hungary, June 1989; andLNCS. New York: SpringerVerlag, 1989.
[78] J.W. Lloyd,Foundations of Logic Programming, SpringerVerlag, New York, 1987.
[79] L. Löwenheim, "Über Möglichkeiten im Relativkalkül,"Mathemathische Annalen, vol. 76, pp. 447470, 1915.
[80] D. W. Loveland,Automated Theorem Proving: A Logical Basis. Amsterdam, The Netherlands: NorthHolland, 1978.
[81] E. Lozinskii, "Evaluating queries in deductive databases by generating," inProc. Int. Joint Conf. Artificial Intell., 1985.
[82] D. Maier and D. S. Warren,Computing with Logic. Menlo Park, CA: BenjaminCummings, 1988.
[83] A. I. Malcev,Algebraic Systems. New York: SpringerVerlag, 1973.
[84] M. V. Mannino, P. C. Chu, and T. Sager, "Statistical profile estimation in database systems,"ACM Comput. Surveys, vol. 20, no. 3, pp. 191221, Sept. 1988.
[85] D. McKay and S. Shapiro, "Using active connection graphs for reasoning with recursive rules," inProc. 7th Int. Joint Conf. Artificial Intell., 1981.
[86] G. MarquePucheu, "Algebraic structure of answers in a recursive logic database,"Acta Inform., 1983.
[87] G. MarquePucheu, J. M. Gallausiaux, and G. Jomier; "Interfacing Prolog and relational database management systems,"New Applications of Databases, Gardarin and Gelenbe, Eds. New York: Academic, 1984.
[88] K. Morris, J. D. Ullman, and A. Van Gelder, "Design overview of the Nail! system," inProc. Int. Conf. Logic Programming, London, 1986.
[89] K. Morris, J. Naughton, Y. Saraiya, J. Ullman, and A. Van Gelder, "YAWN! (Yet another window on NAIL!)," Special Issue on Databases and Logic,IEEE Data Eng., vol. 10, Dec. 1987.
[90] K. A. Morris, "An algorithm for ordering subgoals in Nail!," inProc. ACM SIGNODSIGACT Symp. Principles Database Syst., Austin, TX, 1988.
[91] K. Murakami, T. Kakuta, N. Miyazaki, S. Shibayama, and H. Yokota, "A relational database machine, first step to knowledge base machine," inProc. 10th Symp. Comput. Architecture, June 1983.
[92] S. Naqvi and S. Tsur,A Logical Language for Data and Knowledge Bases. New York: Computer Sci. Press, 1989.
[93] W. Nejdl, "Recursive strategies for answering recursive queriesthe RQA/FQI strategy," inProc. 13th Int. Conf. Very Large Data Bases, Brighton, U.K., Sept. 1987.
[94] E. Neuhold and M. Stonebraker, "Future directions in DBMS research," Int. Comput. Sci. Inst., Berkeley, CA, TR 8801, May 1988.
[95] T. Przymusinski, "On the semantics of stratified deductive databases," inProc. Workshop Foundations Deductive Databases Logic Programming, Washington, DC, 1986, pp. 433443.
[96] T. Przymusinski, "Every logic program has a natural stratification and an iterated least fixed point model," in8th ACM Symp. Principles Database Syst. (PODS), Mar. 1989, pp. 1121.
[97] Quintus Computer Systems Inc., Mountain View, CA,Quintus Prolog Data Base Interface Manual, version 1, June 29, 1987.
[98] R. Ramakrishnan, C. Beeri, and R. Krishnamurty, "Optimizing existential Datalog queries," inProc. ACM SIGMODSIGACT Symp. Principles of Database Syst., Austin, TX, Mar. 1988.
[99] R. Ramakrishnan, "Magic templates, A spellbinding approach to logic evaluation," inProc. Logic Programming Conf., Aug. 1988.
[100] D. Roelants, "Recursive rules in logic databases," Philips Res. Lab., Bruxelles, Rep. R513, Mar. 1987, submitted for publication.
[101] J. Rohmer, R. Lescoeur, and J.M. Kerisit, "The Alexander Method: A Technique for the Processing of Recursive Axioms in Deductive Databases,"New Generation Computing, Vol. 4, 1986.
[102] 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. 166176.
[103] K. A. Ross, "A procedural semantics for well founded negation in logic programs," in8th ACM Symp. Principles Database Syst. (PODS), Mar. 1989, pp. 2232.
[104] D. Sacca' and C. Zaniolo, "On the implementation of a simple class of logic queries for databases," inProc. ACM 1986 SIGMODSIGACT Symp. Principles Database Syst., Cambridge. MA, Mar. 1986.
[105] Sacca' and C. Zaniolo, "Implementing recursive logic queries with function symbols," MCC Tech. Rep. DB40186, Dec. 1986.
[106] Sacca' and C. Zaniolo, "Magic counting methods," inProc. ACMSIGMOD Conf., San Francisco, CA, May 1987.
[107] a] D. Sacca, M. Disoinziezi, A. Mecchia, C. Pizzuti, C. Del Gracco, and P. Naggar, "The advanced database environment of the KIWI system," Special Issue on Databases and Logic,IEEE Data Engineering, vol. 10, no. 4, Dec. 1987.
[108] Y. Sagiv, "Optimizing Datalog programs," inProc. ACM 1987 SIGMODSIGACT Symp. Principles Database Syst., San Diego, CA, Mar. 1987.
[109] L. Schmitz, "An improved transitive closure algorithm,"Comput., vol. 30, 1983.
[110] C. P. Schnorr, "An algorithm for transitive closure with linear expected time,"SIAM J. Comput., vol. 7, May 1978.
[111] J. C. Shepherdson, "Negation as Failure II,"J. Logic Programming, vol. 2, no. 3, pp. 185202, 1985.
[112] J. C. Shepherdson, "Negation in logic programming," inProc. Foundations of Deductive Databases and Logic Program. (Washington, DC), 1986, J. Minker, Ed.
[113] 0. Shmueli, and Sh. Naqvi, "Set grouping and layering in Horn clause programs, " inProc. Int. Conf. Logic Programming, 1987, pp. 152177.
[114] T. Skolem, "Logischkombinatorische Untersuchungenüber die Erfüllbarkeit oder Beweisbarkeit mathematischer Sätze nebst einem Theoremeüber dichte Mengen,"Skrifter utgit av Videnskapsselskapet i Kristiana, I, MatNat. Klasse, no. 4, 1920.
[115] D. E. Smith, M. R. Genesereth, and M. L. Ginsberg, "Controlling recursive inference,"Artifical Intell., vol. 30, no. 3, 1986.
[116] L. Sterling and E. Shapiro,The Art of Prolog. Cambridge, MA: M.I.T. Press, 1986.
[117] M. E. Stickel, "A unification algorithm for associativecommutative functions,"J. ACM, vol. 28, no. 3, pp. 423434, 1981.
[118] M. Stonebraker and L. A. Rowe, Eds., "The Postgres papers," Univ. Calif, Berkeley, Mem. UCB/ERL M86/86, June 1987 (revised version).
[119] L. Tanca, "Optimization of recursive logic queries to relational databases" (in Italian) Ph.D. dissertation,Politecnico di Milano and Universita' di Napoli, 1988.
[120] S. Tsur and C. Zaniolo, "LDL: a logicbased datalanguage," inProc. 12th VLDB Conf., 1986, pp. 3341.
[121] J. D. Ullman, "Implementation of logical query languages for databases,"ACM TODS, vol. 10, no. 3, pp. 289321, 1985.
[122] J. D. Ullman and A. Van Gelder, "Testing applicability of topdown capture rules," Stanford Univ., Stanford, CA, Int. Rep. STANCS851046; andACMJ., to be published.
[123] J. D. Ullman,Database and Knowledgebase Systems. Rockville, MD: Computer Science Press, 1988.
[124] P. Valduriez and H. Boral, "Evaluation of recursive queries using join indices," inProc. 1st Int. Conf. Expert Database Syst., Charleston, SC, 1986.
[125] P. Valduriez and S. Khoshafian, "Parallel evaluation of the transitive closure of a database relation,"Int. J. Parallel Programming, vol. 17, Feb. 1988.
[126] M. H. van Emden and R. A. Kowalski, "The semantics of predicate logic as a programming language,"J. ACM, vol. 23, no. 4, pp. 733 743, 1976.
[127] A. Van Gelder, A. Ross, and J. S. Schlipf, "The wellfounded semantics for general logic programs," in7th ACM Symp. Principles Database Syst. (PODS), Mar. 1988, pp. 221230.
[128] A. Van Gelder, "The alternating fixpoint of logic programs with negation," in8th ACM Symp. Principles Database Syst. (PODS), Mar. 1989, pp. 110.
[129] L. Vieille, "Recursive axioms in deductive databases: The QuerySubquery approach," inProc. Int. Conf. Expert Database Syst., L. Kerschberg, Ed., Charleston, 1986.
[130] L. Vieille, "A database complete proof procedure based on SLD resolution," ECRC, Munich, West Germany, Int. Rep. IRKB40, Nov. 1986.
[131] L. Vieille, "From QSQ to QoSaQ: Global optimization of recursive queries," inProc. 2nd Int. Conf. Expert Database Syst., L. Kerschberg, Ed., Tyson Corner, 1988.
[132] H. S. Warren, "A modification of Warshall's algorithm for the transitive closure of binary relations,"Commun. ACM, vol. 18, Apr. 1975.
[133] S. Warshal, "A theorem on Boolean matrices,"J. ACM, vol. 9, 1962.
[134] C. Zaniolo, "The representation and deductive retrieval of complex objects," inProc. 11th Int. Conf. Very Large Data Bases, Aug. 1985.
[135] C. Zaniolo, Special Issue on Databases and Logic,IEEE Data Eng., vol. 10, Dec. 1987.
[136] C. Zaniolo and D. Sacca', "Rule rewriting methods for efficient evaluation of Horn logic," MCC Tech. Rep. DB08487, 1987.
[137] M. M. Zloof, "Querybyexample: Operations on the transitive closure," IBM, Yorktown Heights, NY, RC 5526, 1975.