Techniques for Indexing Large Numbers of Constraints and Rules in a Database System

  • Akhil Kumar
Conference paper


This paper addresses the problem of indexing a large number of rules and constraints in a database system. The objective of such indexing is to be able to quickly identify the relevant constraints and rules, rather than search sequentially, every time insertions, deletions and modifications are made to the database. The constraints are represented as SQL queries which must return null answers. Each constraint is parsed and stored in one or more indexes. Algorithms for index maintenance and constraint retrieval are given.


Database System Horn Clause Internal Form Integrity Check Relevant Constraint 
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. [1]
    Bernstein, P., et. al., “Fast maintenance of integrity assertions using redundant aggregate data,” Proc. International VLDB Conference, 1980.Google Scholar
  2. [2]
    Ceri, S., and J. Widom, “Implementing set-oriented production rules as an extension to Starburst,” Proc. International VLDB Conference, 1981.Google Scholar
  3. [3]
    Date, C. J., An Introduction to Database Systems, Addison Wesley, 1991.Google Scholar
  4. [4]
    Dewitt, D., et. al., “Implementation techniques for main memory database systems,” Proc. ACM SIGMOD Conference, 1984.Google Scholar
  5. [5]
    Guttman, A., “R-Tree: A dynamic index structure for spatial searching,” Proc. ACM SIGMOD Conference, 1984.Google Scholar
  6. [6]
    Hanson, E., et. al., “A Predicate matching algorithm for database rule systems,” Proc. ACM SIGMOD Conference, 1990.Google Scholar
  7. [7]
    Hsu, A., and T. Imielinksi, “Integrity checking for multiple updates,” Proc. ACM SIGMOD Conference, 1985.Google Scholar
  8. [8]
    Kumar, A., “Techniques for indexing large numbers of constraints and rules in a database system,” Graduate School of Management, Cornell University, Technical Report, December 1991.Google Scholar
  9. [9]
    Nicolas, J-M, “Logic for improving integrity checking in relational data bases,” Acta Informatica 18, pp. 227–253, 1982.MathSciNetMATHCrossRefGoogle Scholar
  10. [10]
    Nievergelt, J. and H. Hinterberger, “The grid file: an adaptable, symmetric multikey file structure,” ACM Trans. on Database Systems, 9(4), March 1984.Google Scholar
  11. [11]
    Selinger, P., et. al., “Access path selection in a relational DBMS,” Proc. ACM SIGMOD Conference, 1979.Google Scholar
  12. [12]
    Shenoy, S., and Z. M. Ozsoyoglu, “Design and implementation of a semantic query optimizer,” IEEE Transactions on Knowledge and Data Engineering, Vol 1, No 3, 1989.Google Scholar
  13. [13]
    Stonebraker, M., “Implementation of integrity constraints and views by query modification,” Proc. ACM SIGMOD 1975.Google Scholar
  14. [14]
    Stonebraker, M., et. al., “The Postgres rules system,” IEEE Transactions on Software Engineering, Vol 14, No 7, July 1988.Google Scholar
  15. [15]
    Ullman, J., Principles of database and knowledge-base systems, Computer Science Press, 1988.Google Scholar
  16. [16]
    Urban, S., and L. Delcambre, “Constraint analysis: specifying operations on objects,” IEEE Transactions on Knowledge and Data Engineering, Vol 2, No 4, 1991.Google Scholar

Copyright information

© Springer-Verlag/Wien 1992

Authors and Affiliations

  • Akhil Kumar
    • 1
  1. 1.Graduate School of ManagementCornell UniversityIthacaUSA

Personalised recommendations