Loading…
Event matching technique for multidimensional range predicate
Event matching technique against lots of multidimensional range predicates is important in the many applications. Existing techniques are restricted to the domain that all the predicates are specified by the user. However, generally some predicates can be omitted by the application requirement. If s...
Saved in:
Main Authors: | , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Event matching technique against lots of multidimensional range predicates is important in the many applications. Existing techniques are restricted to the domain that all the predicates are specified by the user. However, generally some predicates can be omitted by the application requirement. If some predicates are omitted, it is impossible to insert predicates to existing indexing scheme. One of alternatives can be naïve sequential matching that all the events are compared with all the predicates one by one and more advanced alternative is intersection of multi 1-d index. To solve this problem, we propose a novel index scheme for multidimensional range predicates that can be omitted by the application requirement. |
---|---|
DOI: | 10.1109/ICCIE.2010.5668437 |