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.
Cite
CITATION STYLE
Sellis, T., & Lin, C. C. (1992). A geometric approach to indexing large rule bases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 580 LNCS, pp. 405–420). Springer Verlag. https://doi.org/10.1007/BFb0032445
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
