SMILE tree: a stream data multi-query indexing technique with level-dimension nodes and extended-range nodes

Authors:
Minsoo Lee;Hyejung Yoon;Yearn Jeong Kim;Yoon-kyung Lee
Affiliations:
Ewha Womans University, Seoul, Korea;Ewha Womans University, Seoul, Korea;Ewha Womans University, Seoul, Korea;Ewha Womans University, Seoul, Korea
Venue:
Proceedings of the 2nd international conference on Ubiquitous information management and communication
Year:
2008

Citing 8
Cited 0

Multidimensional binary search trees used for associative searching

Communications of the ACM
Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases

ACM Computing Surveys (CSUR)
Models and issues in data stream systems

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
TinyDB: an acquisitional query processing system for sensor networks

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Query indexing with containment-encoded intervals for efficient stream processing

Knowledge and Information Systems
Multi-query optimization for sensor networks

DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A sensor network consists of a network of sensors that can perform computation and also communicate with each other through wireless communication. Some important characteristics of sensor networks are that the network should be self administered and the power efficiency should be greatly considered due to the fact that it uses battery power. In sensor networks, when large amounts of various stream data is produced and multiple queries need to be processed simultaneously, the power efficiency should be maximized. This work proposes a technique to create an index on multiple monitoring queries so that the multi-query processing performance could be increased and the memory and power could be efficiently used. The proposed SMILE tree modifies and combines the ideas of spatial indexing techniques such as k-d trees and R+-trees. The k-d tree can divide the dimensions at each level, while the R+-tree improves the R-tree by dividing the space into a hierarchical manner and reduces the overlapping areas. By applying the SMILE tree on multiple queries and using it on stream data in sensor networks, the response time for finding an indexed query takes in some cases 50% of the time taken for a linear search to find the query.