Skip to main content
SpringerLink
Log in

Accessing Relational and NF2 Databases Through Database Set Predicates

  • Conference paper
ALPUK 91

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

Database set predicates extend the definition of set predicates as they are known in logic programming languages with access to external relational or NF2 (Non First Normal Form) database systems. A database set predicate is a predicate of the form db_set_predicate (ProjectionTerm, DatabaseGoal, ResultList).

ProjectionTeimis an atomic or compound term, DatabaseGoal a possibly complex database goal, and Result List a data structure that captures the instantiations of Pro j ect ionTerm computed by the evaluation of DatabaseGoal. Database set predicates can access a multitude of external database systems efficiently through maximally restrictive queries. Database set predicates embed the set-orientated database evaluation into the tuple-orientated evaluation of logic languages, thus avoiding the memory management and control flow problems of traditional approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bocca, J. “EDUCE — A Marriage of Convenience: Prolog and a Relational DBS”, in Proceedings of the Third Symposium on Logic Programming, Salt Lake City, 1986

    Google Scholar 

  2. Bocca, J., Dahmen, M. and Macartney, G. KB-Prolog User Guide, Technical Report, 4.9.1989, ECRC, Munich

    Google Scholar 

  3. Ceri, S., Gottlob, G. and Wiederhold, G. “Interfacing relational databases and Prolog efficiently.”, in Proceedings of the First International Conference on Expert Database Systems, ed. Kershberg, L., Benjamin-Cummings, 1987

    Google Scholar 

  4. Ceri, S., Gottlob, G. and Tanca, L. “Logic Programming and Databases”, Springer Verlag, 1990

    Book  Google Scholar 

  5. Chimetti, D., Gamboa, R., Krishnamurthy, R., Naqvi, S., Tsur, S. and Zaniolo, C. “The LDL System Prototype”, in IEEE Transactions on Knowledge and Data Engineering, vol 2, No. 1, March 1990

    Google Scholar 

  6. Chang, C. L. and Walker, A. “PROSQL: A Prolog programming interface with SQL/DS”, in Proceedings of the First Workshop on Expert Database Systems, ed. Kershberg, L., Benjamin-Cummings, 1986

    Google Scholar 

  7. Clocksin, W. and Mellish, C. Programming in Prolog, Springer Verlag, 1987

    Book  MATH  Google Scholar 

  8. Draxler, C. “Name Reactions in Organic Chemistry — A New Application Domain for Deductive Databases”, in Proceedings of DEXA 90, Springer Verlag, Vienna, 1990

    Google Scholar 

  9. Draxler, C. Logic Programming and Databases: An Overview over Coupled Systems and a New Approach based on Set Predicates, Technical Report No. 90.09, Computer Science Department, University of Zurich, Sept. 1990

    Google Scholar 

  10. Gallaire, H. and Minker, J. Logic and Databases, Plenum Press, 1978

    Google Scholar 

  11. Gallaire, H., Minker, J. and Nicolas, J-M. “Logic and Databases: a Deductive Approach”, in Computing Surveys, vol 16, No 2, June 1984

    Google Scholar 

  12. Ioannides, Y., Chen, J., Friedman, M. and Tsan-Garis, M. “BERMUDA — An architectural perspective on interfacing Prolog to a database machine” in Proceedings of the Second International Conference on Expert Database Systems, ed. Kershberg, L., Benjamin-Cummings, 1988

    Google Scholar 

  13. Korth, H. and Roth, M. “Query Languages for Nested Relational Databases”, in Proceedings of ICDT 90, Paris, ed. S. Abiteboul, Lecture Notes in Computer Science No. 470, Springer Verlag, Berlin, 1990

    Google Scholar 

  14. Kowalski, R. Logic and Databases, Research Report 82/25, Dept. of Computing, Imperial College of Science and Technology, London 1982

    Google Scholar 

  15. Li, D. A Prolog Database System. Research Studies Press, John Wiley & Sons Ltd., 1984

    MATH  Google Scholar 

  16. Manthey, R., Küchenhoff, V. and Wallace, M. KBL: Design Proposal of a conceptual language for EKS, ECRC Technical Report TR-KB-29, Jan. 89, Munich, 1989

    Google Scholar 

  17. Nussbaum, M. Delayed evaluation in logic programming: an inference mechanism for large knowledge bases, Diss No. 8542 ETH Zurich, 1988

    MATH  Google Scholar 

  18. O’Keefe, R. The Craft of Prolog, MIT Press, 1990

    Google Scholar 

  19. O’Hare, A. and Sheth, A. “The Interpreted-Compiled Range of AI/DB Systems”, in ACM SIGMOD Record, vol 18, No 1, March, 1989

    Google Scholar 

  20. Quintus Prolog Database Interface Manual Quintus Inc., Sunnyvale

    Google Scholar 

  21. Roussel, P. Prolog: Manuel de Reference et Utilisation. Technical Report, Groupe d’Intelligence Artificielle, Universite d’Aix-Marseille II, Marseille 1975

    Google Scholar 

  22. Warren, D. H. D. “Higher-order extensions to Prolog: are they needed?”, in Machine Intelligence 10, Ellis Horwood, 1982

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Zurich University, Winterthurerstrasse 190, CH 8057, Zurich, Switzerland

    Christoph Draxler

Authors
  1. Christoph Draxler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dream Group, Department of Artificial Intelligence, University of Edinburgh, 80 South Bridge, Edinburgh, EH1 1HN, Scotland

    Geraint A. Wiggins MA, PhD

  2. Department of Artificial Intelligence, University of Edinburgh, 80 South Bridge, Edinburgh, EH1 1HN, Scotland

    Chris Mellish MA, PhD

  3. Artificial Intelligence Applications Institute, University of Edinburgh, 80 South Bridge, Edinburgh, EH1 1HN, Scotland

    Tim Duncan BA, MSc

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag London

About this paper

Cite this paper

Draxler, C. (1992). Accessing Relational and NF2 Databases Through Database Set Predicates. In: Wiggins, G.A., Mellish, C., Duncan, T. (eds) ALPUK 91. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3546-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3546-3_9

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19734-8

  • Online ISBN: 978-1-4471-3546-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation