The design and analysis of spatial data structures
The design and analysis of spatial data structures
A predicate matching algorithm for database rule systems
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Segment indexes: dynamic indexing techniques for multi-dimensional interval data
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Selection predicate indexing for active databases using interval skip lists
Information Systems
Multidimensional access methods
ACM Computing Surveys (CSUR)
Matching events in a content-based subscription system
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Achieving scalability and expressiveness in an Internet-scale event notification service
Proceedings of the nineteenth annual ACM symposium on Principles of distributed 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
Continuously adaptive continuous queries over streams
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
APEX: an adaptive path index for XML data
Proceedings of the 2002 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
IEEE Transactions on Computers
Continual Queries for Internet Scale Event-Driven Information Delivery
IEEE Transactions on Knowledge and Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Efficient Filtering of XML Documents for Selective Dissemination of Information
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Indexing and Querying XML Data for Regular Path Expressions
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient Matching for Web-Based Publish/Subscribe Systems
CooplS '02 Proceedings of the 7th International Conference on Cooperative Information Systems
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Efficient Filtering of XML Documents with XPath Expressions
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Monitoring streams: a new class of data management applications
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Indexing Continual Range Queries with Covering Tiles for Fast Locating of Moving Objects
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Efficient Processing of Continual Range Queries for Location-Aware Mobile Services
Information Systems Frontiers
A framework of sensor-cloud integration opportunities and challenges
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
| Hi-index | 0.00 |
Fast matching of events against a large number of range predicates is important for many applications. We present a novel VCR indexing scheme for highly-overlapping 2D range predicates. VCR stands for virtual construct rectangle. Each predicate is decomposed into one or more VCRs, which are then considered to be activated. The predicate ID is then stored in the ID lists associated with these activated VCRs. Event matching is conceptually simple. For each event point, the search result is stored in the ID lists associated with the activated VCRs that cover the event point. However, it is computationally nontrivial to identify the activated covering VCRs. We define a covering VCR set for each event point and present an algorithm for fast event matching. Simulations are conducted to study the performance of VCR indexing.