Data structures and network algorithms
Data structures and network algorithms
The HiPAC project: combining active databases and timing constraints
ACM SIGMOD Record - Special Issue on Real-Time Database Systems
Hierarchical representations of collections of small rectangles
ACM Computing Surveys (CSUR)
IEEE Transactions on Software Engineering
Expert systems for configuration at Digital: XCON and beyond
Communications of the ACM
Data intensive production systems: the DIPS approach
ACM SIGMOD Record
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Incremental evaluation of rules and its relationship to parallelism
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
OOPSLA '91 Conference proceedings on Object-oriented programming systems, languages, and applications
Rule condition testing and action execution in Ariel
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
The point-range tree: a data structure for indexing intervals
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Incremental computation of nested relational query expressions
ACM Transactions on Database Systems (TODS)
Matching events in a content-based subscription system
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Discrimination network for rule condition matching in object-oriented database rule systems
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Efficient query monitoring using adaptive multiple key hashing
Proceedings of the eleventh international conference on Information and knowledge management
The Integration of Rule Systems and Database Systems
IEEE Transactions on Knowledge and Data Engineering
Temporal Triggers in Active Databases
IEEE Transactions on Knowledge and Data Engineering
Incremental Computation of Time-Varying Query Expressions
IEEE Transactions on Knowledge and Data Engineering
The Design and Implementation of the Ariel Active Database Rule System
IEEE Transactions on Knowledge and Data Engineering
Incremental Computation of Set Difference Views
IEEE Transactions on Knowledge and Data Engineering
Trigger Condition Testing and View Maintenance Using Optimized Discrimination Networks
IEEE Transactions on Knowledge and Data Engineering
Publish/Subscribe on the Web at Extreme Speed
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Implementing Set-Oriented Production Rules as an Extension to Starburst
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Alert: An Architecture for Transforming a Passive DBMS into an Active DBMS
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
A Case for Message Oriented Middleware
Proceedings of the 13th International Symposium on Distributed Computing
Generic Constraints for Content-Based Publish/Subscribe
CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
Efficient filtering of XML documents with XPath expressions
The VLDB Journal — The International Journal on Very Large Data Bases
A flexible and recoverable client/server database event notification system
The VLDB Journal — The International Journal on Very Large Data Bases
A predicate-based caching scheme for client-server database architectures
The VLDB Journal — The International Journal on Very Large Data Bases
Event matching in symmetric subscription systems
CASCON '02 Proceedings of the 2002 conference of the Centre for Advanced Studies on Collaborative research
Efficient matching for state-persistent publish/subscribe systems
CASCON '03 Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research
VCR indexing for fast event matching for highly-overlapping range predicates
Proceedings of the 2004 ACM symposium on Applied computing
On the abductive or deductive nature of database schema validation and update processing problems
Theory and Practice of Logic Programming
Interval query indexing for efficient stream processing
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Mobile services discovery and selection in the publish/subscribe paradigm
CASCON '04 Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research
Continuous query processing in data streams using duality of data and queries
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Pruning subscriptions in distributed publish/subscribe systems
ACSC '06 Proceedings of the 29th Australasian Computer Science Conference - Volume 48
Supporting arbitrary Boolean subscriptions in distributed publish/subscribe systems
Proceedings of the 3rd international Middleware doctoral symposium
The arbitrary Boolean publish/subscribe model: making the case
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Combining flexibility and scalability in a peer-to-peer publish/subscribe system
Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware
Design of B+tree-based predicate index for efficient event matching
APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A detailed investigation of memory requirements for publish/subscribe filtering algorithms
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
Semantic similarity based ontology cache
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
Dimension transform based efficient event filtering for symmetric publish/subscribe system
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Efficient filtering query indexing in data stream
WISE'06 Proceedings of the 7th international conference on Web Information Systems
Combining flexibility and scalability in a peer-to-peer publish/subscribe system
Middleware'05 Proceedings of the ACM/IFIP/USENIX 6th international conference on Middleware
Adaptive two-level optimization for selection predicates of multiple continuous queries
Journal of Intelligent Information Systems
Analysis and optimization for boolean expression indexing
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
Forward-chaining rule systems must test each newly asserted fact against a collection of predicates to find those rules that match the fact. Expert system rule engines use a simple combination of hashing and sequential search for this matching. We introduce an algorithm for finding the matching predicates that is more efficient than the standard algorithm when the number of predicates is large. We focus on equality and inequality predicates on totally ordered domains. This algorithm is well-suited for database rule systems, where predicate-testing speed is critical. A key component of the algorithm is the interval binary search tree (IBS-tree). The IBS-tree is designed to allow efficient retrieval of all intervals (e.g. range predicates) that overlap a point, while allowing dynamic insertion and deletion of intervals. The algorithm could also be used to improve the performance of forward-chaining inference engines for large expert systems applications.