Skip to main content

An Approach To Processing Queries In A Logic-Based Query Language

  • Chapter
On Knowledge Base Management Systems

Part of the book series: Topics in Information Systems ((TINF))

Abstract

We summarize the “capture rule” approach to planning queries in a rule-oriented database management system. Selecting from among strategies for the application of logical rules to data may be viewed as an advanced form of query optimization. Capture rules provide a framework within which a system can make such decisions. They also assist in the development of a theory of optimal strategies for logic processing. This paper surveys some of the known capture rules and suggests how they can be fit together into a system that provides “knowledge processing” with database management.

Work supported by NSF grant IST-84-12971 and grant of IBM Corp

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

Access this chapter

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. Afrati, F., C. H. Papadimitriou, G. Papageorgiou, and A. Roussou, “On testing convergence of the Sagiv-Ullman capture rule”, unpublished memorandum, Dept. of CS, Stanford Univ., Private communication, Feb., 1985.

    Google Scholar 

  2. Bancilhon, F., “On recursive rule evaluation in a knowledge base system”, Proc. Islamorada Workshop on Large Scale Knowledge Base and Reasoning Systems, M. L. Brodie, ed., CCA, Cambridge, Mass, 1985.

    Google Scholar 

  3. Codd, E. F., “A relational model for large shared data banks”, Comm. ACM., Vol. 13, No. 6, pp. 377–387, June 1970.

    Google Scholar 

  4. Erickson, R. D., “Optimality of stationary halting policies and finite termination of successive approximations”, TR — 33, Dept. of OR, Stanford Univ.

    Google Scholar 

  5. Genesereth, M. R., “MRS: a metalevel representation system”, HPP — 83 — 28, Dept. of CS, Stanford Univ., 1983.

    Google Scholar 

  6. Gallaire, H. and Minker, J. (eds.), Logic and Data Bases. New York, Plenum Press, 1978.

    MATH  Google Scholar 

  7. Henschen, L. J. and S. A. Naqvi, “On compiling queries in recursive first-order databases”, J. ACM, Vol. 31, No. 1, pp. 4785, January, 1984.

    Google Scholar 

  8. Kowalski, R., “Predicate logic as a programming language”, Proc. 1974IFIP Congress, pp. 569–574, North Holland, 1974.

    Google Scholar 

  9. Litwin, W., “M ALPHA, A Multidatabase manipulation language”, Proc. IEEEDEC, April, 1984.

    Google Scholar 

  10. Naish, L., “Automatic generation of control for logic programs”, TR 83/6, Dept. of CS, Univ. of Melbourne, 1983.

    Google Scholar 

  11. Naughton, J., Work in progress, Dept. of CS, Stanford Univ., 1985.

    Google Scholar 

  12. Newell, A., “The Knowledge Level,” Presidential Address, American Association for Artificial Intelligence, AAAI80, Stanford University, Stanford, CA (19 August 1980), in AI Magazine, Vol., No. 2 (Summer 1981 ), pp. 1–20.

    Google Scholar 

  13. Sagiv, Y. and J. D. Ullman, “Complexity of a top-down capture rule”, STAN - CS - 84 - 1009, Dept. of CS, Stanford Univ., July, 1984.

    Google Scholar 

  14. Stonebraker, M. and E. Wong, “Access control in a relational database management system by query modification”, Proc. ACM National Confi, pp. 180–187, 1974.

    Google Scholar 

  15. Sussman, G. J., T. Winograd, and E. Charniak, “Micro-planner reference manual”, MIT — AI 203a, AI Lab., MIT, Cambridge, Mass., 1970.

    Google Scholar 

  16. Todd, S. J. P., “The Peterlee relational test vehicle—a system overview”, IBM Systems J., Vol. 15, No. 4, pp. 285–308, 1976.

    Article  MATH  Google Scholar 

  17. Ullman, J. D. and A. Van Gelder, “Testing applicability of top- down capture rules”, STAN - CS - 85 - 1046, Dept. of CS, Stanford Univ., 1985.

    Google Scholar 

  18. Ullman, J. D., Principles of Database Systems, Computer Science Press, Rockville, Md., 1982.

    MATH  Google Scholar 

  19. Ullman, J., “Implementation of Logical Query Languages for Databases”, ACM Transactions on Database Systems, Vol. 10., No. 3, pp. 289–321, 1985

    Google Scholar 

  20. Van Gelder, A., “Deriving relations among argument sizes in logic programs”, unpublished manuscript, Dept. of CS, Stanford Univ., 1985.

    Google Scholar 

  21. Warren, D.H.D., “Efficient Processing of Interactive Relational Database Queries Expressed in Logic”, Proc. of the Seventh International Conference on Very Large Data Bases, Cannes, France, pp. 272–281, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag New York Inc.

About this chapter

Cite this chapter

Ullman, J.D. (1986). An Approach To Processing Queries In A Logic-Based Query Language. In: Brodie, M.L., Mylopoulos, J. (eds) On Knowledge Base Management Systems. Topics in Information Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4980-1_16

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-4980-1_16

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-9383-5

  • Online ISBN: 978-1-4612-4980-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics