Database Paper Browser

Back to papers

A Predicate Matching Algorithm for Database Rule Systems

Summary: Proposes an efficient predicate-matching algorithm for large database rule systems, outperforming hashing/sequential search on predicates in ordered domains. IBS-tree enables fast retrieval of overlapping intervals with dynamic insert/delete, boosting forward-chaining performance. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2491
Venue
SIGMOD
Year
1990
Pagerank
9.062692e-05
Overall Rank
2,305 | 83.97%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1 Access Path Selection in a Relational Database Management System 1979 SIGMOD 0.0040449103
2 R-Trees: A Dynamic Index Structure For Spatial Searching 1984 SIGMOD 0.0032169493
Previous Page 1 / 1 Next

Semantically Similar Papers