Skip to main content

A geometric approach to indexing large rule bases

  • Conference paper
  • First Online:
Advances in Database Technology — EDBT '92 (EDBT 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 580))

Included in the following conference series:

Abstract

The efficiency of finding qualifying rules against updates in large production systems has always been an important research issue. In database implementations of rule systems, this problem is even more critical. Predicate Indexing is a reduced version of the above problem when only selection conditions are considered. In this paper we draw a similarity between predicate indexing and indexing of geometric data, and discuss index design issues. Results from experiments using special data structures are also presented.

This research was sponsored partially by the National Science Foundation under Grants IRI-8719458 and IRI-9057573 (PYI Award), by DEC and Bellcore, and by the Air Force Office for Scientific Research under Grant AFOSR-89-0303.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Comer. The Difficulty of Optimum Index Selection. ACM Transactions on Database Systems, 3(4):440–445, December 1978.

    Google Scholar 

  2. C. Faloutsos, T. Sellis, and N. Roussopoulos. Analysis of Object Oriented Spatial Access Methods. In Proceedings of the ACM-SIGMOD International Conference on the Management of Data, pages 426–439, 1987.

    Google Scholar 

  3. S. Finkelstein, M. Schkolnick, and P. Tiberio. Physical Database Design for Relational Databases. ACM Transactions on Database Systems, 13(1):91–128, March 1988.

    Google Scholar 

  4. C. L. Forgy. OPS5 User's Manual. Technical Report CMU-CS-81-135, Dept. of Computer Science, Carnegie-Mellon University, Pittsburgh, PA, July 1981.

    Google Scholar 

  5. C. L. Forgy. Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem. Artificial Intelligence, 19:17–37, 1982.

    Google Scholar 

  6. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freemand and Company, New York, 1979.

    Google Scholar 

  7. A. Gupta. Parallelism in Production Systems. PhD thesis, Department of Computer Science, Carnegie-Mellon University, March 1986.

    Google Scholar 

  8. A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. In Proceedings of the ACM-SIGMOD International Conference on the Management of Data, pages 47–57, 1984.

    Google Scholar 

  9. E. N. Hanson, M. Chaabouni, C.-H. Kim, and Y.-W. Wang. A Predicate Matching Algorithm for Database Rule Systems. In Proceedings of the ACM-SIGMOD International Conference on the Management of Data, pages 271–280, Atlantic City, NJ, May 1990.

    Google Scholar 

  10. C. L. Liu. Introduction to Combinatorial Mathematics. McGraw-Hill Book Company, New York, 1968.

    Google Scholar 

  11. J. T. Robinson. The K-D-B Tree: A Search Structure for Large Multidimensional Dynamic Indexes. In Proceedings of the ACM-SIGMOD International Conference on the Management of Data, 1981.

    Google Scholar 

  12. H. Samet. The Design and Analysis of Spatial Data Structure. Addison-Wesley Publishing Company, Inc., 1990.

    Google Scholar 

  13. T. Sellis, N. Roussopoulos, and C. Faloutsos. The R+-tree: A Dynamic Index for Multi-Dimensional Objects. In Proceedings of the 13th International Conference on Very Large Data Bases, Brighton, England, 1987.

    Google Scholar 

  14. T. Sellis. Special Issue on Rule Management and Processing in Expert Database Systems. SIGMOD Record, 18(3), September 1989.

    Google Scholar 

  15. T. Sellis, L. Raschid, and C.-C. Lin. Data Intensive Production Systems: The DIPS Approach. In [SELL89a].

    Google Scholar 

  16. T. Sellis and C.-C. Lin. A Study of Predicate Indexing for DBMS Implementations of Production Systems. Technical Report, Dept. of Computer Science, University of Maryland, College Park, MD, February 1991.

    Google Scholar 

  17. M. Stonebraker, T. Sellis, and E. Hanson. An Analysis of Rule Indexing Implementations in Database Systems. In Expert Database Systems: Proceedings From the First International Conference, pages 465–476. Benjamin/Cummings Publishing Company, Inc., Menlo Park, CA, 1987.

    Google Scholar 

  18. M. Stonebraker, E. N. Hanson, and S. Potamianos. The POSTGRES Rule Manager. IEEE Transactions on Software Engineering, 14(7):897–907, July 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Alain Pirotte Claude Delobel Goerg Gottlob

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sellis, T., Lin, C.C. (1992). A geometric approach to indexing large rule bases. In: Pirotte, A., Delobel, C., Gottlob, G. (eds) Advances in Database Technology — EDBT '92. EDBT 1992. Lecture Notes in Computer Science, vol 580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032445

Download citation

  • DOI: https://doi.org/10.1007/BFb0032445

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55270-3

  • Online ISBN: 978-3-540-47003-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics