Abstract
Database programming languages integrate concepts of databases and programming languages to provide both implementation tools for dataintensive applications and high-level user interfaces to databases. Frequently, database programs contain a large amount of application knowledge which is hidden in the procedural code and thus difficult to maintain with changing data and user views.
This chapter presents a first attempt to improve the situation by supporting the integrated definition and management of data and rules based on a set-oriented and predicative approach. For the definition of rules, we introduce and justify a new declarative language construct called constructor. Furthermore, we demonstrate how a Recursive Database Model can be used for constructor representation, thus allowing for the definition, update, and querying of large rule bases. The use of database technology for integrated fact and rule base management is shown to have some important advantages in terms of fact and rule integrity, question-answering, and explanation of results.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Atkinson, M.P., K. Chrisholm, and P. Cockshott, “The New Edinburgh Persistent Algorithmic Language”, Univ. of Edinburgh, Dept. of Computer Science, CSR-90-81, August 1981.
Aho, A.V., and J.D. Ullman, “Universality of Data Retrieval Languages”, Proc. ACM 6th Symposium on Principles of Programming Languages, San Antonio, Texas, January 1979, pp. 110-117.
Buneman, P., and M.P. Atkinson, “Inheritance and Persistence in Database Programming Languages”, Proc. 1986 ACM SIGMOD International Conference on Management of Data, Washington, DC, May 1986, pp. 4-15.
Brachman, R.J., and H.J. Levesque, “What Makes a Knowledge Base Knowledgeable? A View of Databases from the Knowledge Level”, in [KERS86], 1986, pp. 69-78.
Brodie, M.L., J. Mylopoulos, and J.W. Schmidt (eds.), On Conceptual Modelling: Perspectives from Artificial Intelligence, Databases and Programming Languages, Springer-Verlag, Berlin, Heidelberg, 1984.
Bancilhon, F., and R. Ramakrishnan, “An Amateur’s Introduction to Recursive Query Processing Strategies”, Proc. ACM 1986 SIGMOD International Conference on Management of Data, Washington, DC, May 1986, pp. 16-52.
Chandra, A.K., and D. Harel, “Horn Clauses and the Fixpoint Query Hierarchy”, ACM Symposium on Principles of Database Systems, Los Angeles, 1982, pp. 158-163.
Clocksin, W.F., and C.S. Mellish, Programming in PROLOG, 3rd ed., Springer-Verlag, Berlin, Heidelberg, 1987.
Codd, E.F., “A Relational Model of Data for Large Shared Data Banks”, Communications of the ACM, Vol. 13, No. 6, June 1970, pp. 377–387.
Codd, E.F., “Extending the Database Relational Model to Capture More Meaning”, ACM Transactions on Database Systems, Vol. 4, No. 4, December 1979, pp. 397–434.
Eckhardt, H., J. Edelman, J. Koch, M. Mall, and J.W. Schmidt, “Draft Report on the Database Programming Language DBPL”, DBPL-Memo 091-85, Johann Wolfgang Goethe-Univ. Frankfurt, West Germany, 1985.
Gallaire, H., J. Minker, and J.-M. Nicolas, “Logic and Databases: A Deductive Approach”, ACM Computing Surveys, Vol. 16, No. 2, June 1984, pp. 153–185.
Gibbs, S., and D. Tsichritzis, “A Data Modelling Approach for Officfe Information Systems”, ACM Transactions on Office Information Systems, Vol. 1, No. 4, October 1983.
Haskins, R.L., and R.A. Lorie, “On Extending the Functions of a Relational Database System”, Proc. ACM SIGMOD International Conference on Management of Data, Orlando, FL, June 1982.
Hoare, C.A.R., “Recursive Data Structures”, International Journal of Computer and Information Science, Vol. 4, No. 2, 1975.
Ioannidis, Y., L.L. Shinkle, and E. Wong, “Enhancing INGRES with Deductive Power”, in [KERS84], pp. 847-850.
Jarke, M., “Common Subexpression Isolation in Multiple Query Optimization”, in W. Kim, D.S. Reiner, D.S. Batory (eds.), Query Processing in Database Systems, Topics in Information Systems, Springer-Verlag, Berlin, Heidelberg, 1985.
Jarke, M., “External Semantic Query Simplification: A Graph-Theoretic Approach and Its Implementation in PROLOG”, in [KERS86], pp. 675-692.
Jarke, M., and J. Koch, “Range Nesting: A Fast Method to Evaluate Quantified Queries”, Proc. 1983 ACM SIGMOD International Conference on Management of Data, San Jose, CA, May 1983, pp. 96-206.
Jarke, M., V. Linnemann, and J.W. Schmidt, “Data Constructors: On the Integration of Rules and Relations”, Proc. 11th International Conference on Very Large Databases, Stockholm, 1985, pp. 227-240.
Jarke, M., and Y. Vassiliou, “Coupling Expert Systems with Database Management Systems”, in [REIT84b], 1984, pp. 65-85.
Kerschberg, L. (ed.), Proc. 1st International Workshop on Expert Database Systems, Kiawah Island, South Carolina, October 1984.
Kerschberg, L. (ed.), Expert Database Systems, see [KERS84], 1st International Workshop on Expert Database Systems, Benjamin/Cummings Publishing Company, Inc., Menlo Park, CA, 1986.
Koch, J., Relationale Anfragen: Zerlegung und Optimierung, Ph.D. Dissertation (in German) 1985, Informatik Fachberichte, Vol. 101, Springer-Verlag, Berlin, Heidelberg, 1985.
Lamersdorf, W., “Recursive Data Models for Non-Conventional Database Applications”, Proc. IEEE International Conference on Data Engineering, Los Angeles, April 1984.
Lamersdorf, W., Semantische Reprasentation komplexer Objektstrukturen: Modellefiir nichtkonventionelle Datenbankanwendungen, Ph.D. Dissertation (in German) 1985, Informatik Fachberichte, Vol. 100, Springer-Verlag, Berlin, Heidelberg, 1985.
Linneman, V., “Constructorset’s Database Support for Knowledge Based Systems”, IEEE 2nd International Conference on Data Engineering, Los Angeles, February 1986, pp. 244-251.
Lamersdorf, W., G. Miiller, and J.W. Schmidt, “Language Support for Office Modelling”, Proc. 10th Conference on Very Large Databases, Singapore, August 1984, pp. 280-290.
Mylopoulos, J., P.A. Bernstein, and H.K.T. Wong, “A Language Facility for Designing Interactive Database-Intensive Applications”, ACM Transactions on Database Systems, Vol. 5, No. 2, June 1980, pp. 185–207.
Merrett, T.H., Relational Information Systems, Chapter 5, Prentice-Hall, Englewood Cliffs, NJ, 1984.
Schmidt, J.W., “Some High-Level Language Constructs for Data of Type Relation”, ACM Transactions on Database Systems, Vol. 2, No. 3, September 1977, pp. 247–261.
Smith, J.M., S. Fox, and T. Landers, Reference Manualfor ADAPLEX, Technical Report CCA-81-02, Computer Corporation of America, Cambridge, MA, January 1981.
Schmidt, J.W., and V. Linnemann, “Higher Level Relational Objects”, Proc. 4th British National Conference on Databases, Cambridge Univ. Press, July 1985, pp. 1-23.
Schmidt, J.W., and M. Mall, “Abstraction Mechanisms for Database Programming”, Proc. SIGPLAN Symposium on Programming Language Issues in Software Systems, San Francisco, June 1983, pp. 83-93.
Schek, H.J., and P. Pistor, “Data Structures for an Integrated Data Base Management and Information Retrieval System”, Proc. 8th International Conference on Very Large Databases, Mexico City, September 1982, pp. 197-207.
Wasserman, A.I., “The Data Management Facilities of PLAIN”, Proc. ACM SIGMOD Conference, Boston, May 1979.
Wirth, N., Programming in Modula-2, 3rd ed., Springer-Verlag, Berlin, Heidelberg, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schmidt, J.W., Ge, L., Linnemann, V., Jarke, M. (1989). Integrated Fact and Rule Management Based on Relational Technology. In: Schmidt, J.W., Thanos, C. (eds) Foundations of Knowledge Base Management. Topics in Information Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83397-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-83397-7_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-83399-1
Online ISBN: 978-3-642-83397-7
eBook Packages: Springer Book Archive