A Query Index for Stream Data Using Interval Skip Lists Exploiting Locality

Authors:
Jun-Ki Min
Affiliations:
School of Internet-Media Engineering, Korea University of Technology and Education, Byeongcheon-myeon, Cheonan, Chungnam, 330-708, Republic of Korea
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Year:
2007

Citing 7
Cited 0

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
Selection predicate indexing for active databases using interval skip lists

Information Systems
Conjunctive selection conditions in main memory

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Continuously adaptive continuous queries over streams

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
TelegraphCQ: continuous dataflow processing

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
BMQ-Index: Shared and Incremental Processing of Border Monitoring Queries over Data Streams

MDM '06 Proceedings of the 7th International Conference on Mobile Data Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

To accelerate the query performance, diverse continuous que- ry index schemes have been proposed for stream data processing systems. In general, a stream query contains the range condition. Thus, by using range conditions, the queries are indexed. In this paper, we propose an efficient range query index scheme QUISIS using a modified Interval Skip Lists to accelerate search time. QUISIS utilizes a locality where a value which will arrive in near future is similar to the current value.