Deductive Databases-theory meets practice

  • Carlo Zaniolo
Session 1: Opening
Part of the Lecture Notes in Computer Science book series (LNCS, volume 416)


Deductive Databases are coming of age with the emergence of efficient and easy to use systems that support queries, reasoning, and application development on databases through declarative logic-based languages. Building on solid theoretical foundations, the field has benefited in the recent years form dramatic advances in the enabling technology. This progress is demonstrated by the completion of prototype systems offering such levels of generality, performance and robustness that they support well complex application development. Valuable know-how has emerged from the experience of building and using these systems: we have learned about algorithms and architectures for building powerful deductive database systems, and we begin to understand the programming environments and paradigms they are conducive to. Thus, several application areas have been identified where these systems are particularly effective, including areas well beyond the domain of traditional database applications. Finally, the design and deployment of deductive databases has provided new stimulus and a focus to further research into several fundamental issues. As a result, the theory of the field has made significant progress on topics such as semantic extensions to Horn logic and algorithms for compilation and optimization of declarative programs. Thus, a beneficial interaction between theory and practice remains one of the strengths of Deductive Databases as the field is entering the '90s and the age of technological maturity.


Logic Program Rapid Prototype Logic Programming Query Language Horn Clause 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ApBW]
    Apt, K., H. Blair, A. Walker, ”Towards a Theory of Declarative Knowledge,” in Foundations of Deductive Databases and Logic Programming, (Minker, J. ed.), Morgan Kaufman, Los Altos, 1987.Google Scholar
  2. [BaBu]
    Bancilhon, F. and P. Buneman (eds.), “Workshop on Database Programming Languages,” Roscoff, Finistere, France, Sept. 87.Google Scholar
  3. [BNS]
    Beeri, C., R. Nasr and S.Tsur, “Embedding psi-terms in a Horn-clause Logic Language”, Procs. Third Int. Conf. on Data and Knowledge Bases—improving usability and responsiveness, Jersualem, June 28–30, pp. 347–359, 1989Google Scholar
  4. (Bor).
    Boral, H. “Parallelism in Bubba,” Proc. Int. Symposium on Databases in Parallel and Distributed Systems, Austin, Tx, Dec. 1988.Google Scholar
  5. (BNST).
    Beeri C., S. Naqvi, O. Shmueli, and S. Tsur. “Set Constructors in a Logic Database Language”, to appear in the Journal of Logic Programming.Google Scholar
  6. [BMSU]
    Bancilhon, F., D. Maier, Y. Sagiv, J. Ullman, ”Magic sets and other strange ways to implement logic programs”, Proc. 5th ACM SIGMOD-SIGACT Symp. on Principles of Database Systems, 1986.Google Scholar
  7. [Boc]
    Bocca, J., ”On the Evaluation Strategy of Educe,” Proc. 1986 ACM-SIGMOD Conference on Management of Data, pp. 368–378, 1986.Google Scholar
  8. [Ceta1]
    Chimenti, D. et al., ”An Overview of the LDL System”, Database Engineering Bulletin, Vol. 10, No. 4, pp. 52–62, 1987.Google Scholar
  9. [Ceta2]
    Chimenti, D. et al., ”The LDL System Prototype,” IEEE Journal on Data and Knowledge Engineering, March 1990.Google Scholar
  10. [CeGW]
    Ceri, S., G. Gottlob and G. Wiederhold, ”Interfacing Relational Databases and Prolog Efficiently,” Expert Database Systems, L. Kerschberg (ed.), Benjamin/Cummings, 1987.Google Scholar
  11. [CG89]
    Chimenti, D. and R. Gamboa. “The SALAD Cookbook: A User's Guide,” MCC Technical Report No. ACA-ST-064-89.Google Scholar
  12. [CGK1]
    Chimenti, D., R. Gamboa and R. Krishnamurthy. “Towards an Open Architecture for LDL,” Proc. 15th VLDB, pp. 195–203, 1989.Google Scholar
  13. [CGK2]
    Chimenti, D., R. Gamboa and R. Krishnamurthy, “Abstract Machine for LDL,” Proc. 2nd Int. Conf on Extending Database Technology, EDBT'90, Venice, Italy, 1990.Google Scholar
  14. [CoMa]
    Copeland, G. and Maier D., ”Making SMALLTALK a Database System,” Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 316–325, 1985.Google Scholar
  15. [CoSh]
    Connell, J.L. and Shafer, L.B., “Structured Rapid Prototyping”, Prentice Hall, 1989.Google Scholar
  16. [DM89]
    “The Rapid Prototyping Conundrum”, DATAMATION, June 1989.Google Scholar
  17. (Fost).
    Foster, R.K. ”Feature Comparison of LDL and SQL”, Control Data Corporation Interoffice Memorandum, March 23, 1987.Google Scholar
  18. [Gane]
    Gane, C. “Rapid System Development,” Prentice Hall, 1989.Google Scholar
  19. [GMN]
    Gallaire, H.,J. Minker and J.M. Nicolas,”Logic and Databases: a Deductive Approach,” Computer Surveys, Vol. 16, No. 2, 1984.Google Scholar
  20. [GENE88]
    R. Herdman, et al. “MAPPING OUR GENES Genome Projects: How Big, How Fast?” Congress of the United States, Office of Technology Assessment. The John Hopkins University Press, 1988.Google Scholar
  21. [JaCV]
    Jarke, M., J. Clifford and Y. Vassiliou, ”An Optimizing Prolog Front End to a Relational Query System,” Proc. 1984 ACM-SIGMOD Conference on Management of Data, pp. 296–306, 1986.Google Scholar
  22. [Kell]
    Kellogg, C., “A Practical Amalgam of Knowledge and Data Base Technology” Proc. of AAAI Conference, Pittsburg, Pa., 1982.Google Scholar
  23. [KNZ]
    Krishnamurthy, S. Naqvi and Zaniolo, ”Database Transactions in \(\mathcal{L}\mathcal{D}\mathcal{L}\)”, Proc. Logic Programming North American Conference 1989, pp. 795–830, MIT Press, 1989.Google Scholar
  24. [KrN1]
    Krishnamurthy and S. Naqvi, ”Non-Deterministic Choice in Datalog,” Proc. 3rd Int. Conf. on Data and Knowledge Bases, June 27–30, Jerusalem, Israel.Google Scholar
  25. [KrN2]
    Krishnamurthy and S. Naqvi, ”Towards a Real Horn Clause Language,” Proc. 1988 VLDB Conference, Los Angeles, California, August 1988.Google Scholar
  26. [KrZa]
    Krishnamurthy, R. and C. Zaniolo, ”Optimization in a Logic Based language for Knowledge and Data Intensive Applications,” in Advances in Database Technology, EDBT'88, (Schmidt, Ceri and Missikoff, Eds), pp. 16–33, Springer-Verlag 1988.Google Scholar
  27. [KuYo]
    Kunifji S., H. Yokota, ”Prolog and Relational Databases for 5th Generation Computer Systems,” in Advances in Logic and Databases, Vol. 2 (Gallaire, Minker and Nicolas eds.), Plenum, New York, 1984.Google Scholar
  28. [Li]
    Li, D. ”A Prolog Database System,” Research Institute Press, Letchworth, Hertfordshire, U.K., 1984Google Scholar
  29. [LeVi]
    Lefebvre, A. and Vieille, L. “On Deductive Query Evaluation in the DedGin System,” Proc. 1st Int. Conf. on Deductive and O-O Databases, Dec. 4–6, 1989, Kyoto, Japan.Google Scholar
  30. [Llo]
    Lloyd, J. W., Foundations of Logic Programming, Springer Verlag, (2nd Edition), 1987.Google Scholar
  31. [MaSu]
    Marek, V. and V.S. Subramanian, ”The Relationship between Logic Program Semantics and Non-Monotonic Reasoning,” Proc. 6th Int. Conference on Logic Programming, pp. 598–616, MIT Press, 1989.Google Scholar
  32. [Meta]
    Morris, K. et al. ”YAWN! (Yet Another Window on NAIL!), Data Engineering, Vol.10, No. 4, pp. 28–44, Dec. 1987.Google Scholar
  33. [Mi68]
    Michie, D. “'Memo’ Functions and Machine Learning” in Nature, April 1968.Google Scholar
  34. [NaKr]
    Naqvi, S. and R. Krishnamurthy, ”Semantics of Updates in logic Programming”, Proc. 7th ACM SIGMOD-SIGACT Symp. on Principles of Database Systems, pp. 251–261Google Scholar
  35. [Naq]
    Naqvi, S. ”A Logic for Negation in Database Systems,” in Foundations of Deductive Databases and Logic Programming, (Minker, J. ed.), Morgan Kaufman, Los Altos, 1987.Google Scholar
  36. [NaTs]
    S. Naqvi, and S. Tsur. “A Logical Language for Data and Knowledge Bases,” W. H. Freeman Publ., 1989.Google Scholar
  37. [Przl]
    Przymusinski, T., ”On the Semantics of Stratified Deductive Databases and Logic Programs”, in Foundations of Deductive Databases and Logic Programming, (Minker, J. ed.), Morgan Kaufman, Los Altos, 1987.Google Scholar
  38. [Prz2]
    Przymusinski, T., ”Non-Monotonic Formalism and Logic Programming,” Proc. 6th Int. Conference on Logic Programming, pp. 656–674, MIT Press, 1989.Google Scholar
  39. [RaBK]
    Ramakrishnan, R., C. Beeri and Krishnamurthy, ”Optimizing Existential Datalog Queries,” Proc. 7th ACM SIGMOD-SIGACT Symp. on Principles of Database Systems, pp. 89–102, 1988.Google Scholar
  40. [RaSh]
    Ramamohanarao, K. and J. Sheperd, “Answering Queries in Deductive Databases”, Proc. 4th Int. Conference on Logic Programming, pp. 1014–1033, MIT Press, 1987.Google Scholar
  41. [RoSh]
    Rowe, L. and K.A. Shones, “Data Abstraction, Views and Updates in RIGEL”, Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 71–81, 1979.Google Scholar
  42. [SaZ1]
    Saccá D., Zaniolo, C., ”Implementation of Recursive Queries for a Data Language based on Pure Horn Logic,” Proc. Fourth Int. Conference on Logic Programming, Melbourne, Australia, 1987.Google Scholar
  43. [SaZ2]
    Saccá D., Zaniolo, C., ”The Generalized Counting Method for Recursive Logic Queries,” Journal of Theoretical Computer Science, 61, 1988.Google Scholar
  44. [SaZ3]
    Saccá D., Zaniolo, C., ”Stable Models and Non-Determinism in Logic Programs with Negation,” MCC Tech. Rep., ACT-ST-202, 1989.Google Scholar
  45. [Sch77]
    Schmidt, J., “Some High Level Language Constructs for Data of Type Relations”, ACM Transactions on Database Systems, 2(3), pp. 140–173, 1977.CrossRefGoogle Scholar
  46. [Seta]
    Selinger, P.G. et al. ”Access Path Selection in a Relational Database Management System,” Proc. ACM SIGMOD Int. Conf. on Management of Data, 1979.Google Scholar
  47. [ShNa]
    Shmueli, O. and S. Naqvi, ”Set Grouping and Layering in Horn Clause Programs,” Proc. of 4th Int. Conf. on Logic Programming, pp. 152–177, 1987.Google Scholar
  48. [ShTZ]
    Shmueli, O., S. Tsur and C. Zaniolo, ”Rewriting of Rules Containing Set Terms in a Logic Data Language (LDL),” Proc. 7th ACM SIGMOD-SIGACT Symp. on Principles of Database Systems, pp. 15–28, 1988.Google Scholar
  49. [Tsur]
    Tsur S., “Applications of Deductive Database Systems,” Proc. IEEE COMCON Spring '90 Conf., San Francisco, Feb 26–March 2.Google Scholar
  50. [Ull]
    Ullman, J.D., Database and Knowledge-Based Systems, Vols I and II, Computer Science Press, Rockville, Md., 1989.Google Scholar
  51. [vEKo]
    van Emden, M.H., Kowalski, R., ”The semantics of Predicate Logic as a Programming Language”, JACM 23, 4, 1976, pp. 733–742.CrossRefGoogle Scholar
  52. [War]
    Warren, D.H.D., ”An Abstract Prolog Instruction Set,” Tech. Note 309, AI Center, Computer Science and Technology Div., SRI, 1983.Google Scholar
  53. [Zan1]
    Zaniolo, C. ”Prolog: a database query language for all seasons,” in Expert Database Systems, Proc. of the First Int. Workshop L. Kerschberg (ed.), Benjamin/Cummings, 1986.Google Scholar
  54. [Zan2]
    Zaniolo, C. ”Design and implementation of a logic based language for data intensive applications. Proceedings of the International Conference on Logic Programming, Seattle, 1988.Google Scholar
  55. [Zan3]
    Zaniolo, C. ”Object Identity and Inheritance in Deductive Databases: an Evolutionary Approach,” Proc. 1st Int. Conf. on Deductive and O-O Databases, Dec. 4–6, 1989, Kyoto, Japan.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Carlo Zaniolo
    • 1
  1. 1.MCC 3500 West Balcones Center DriveAustinUSA

Personalised recommendations