View : 21 Download: 0
SMILE tree: A stream data multi-query indexing technique with level-dimension nodes and extended-range nodes
- SMILE tree: A stream data multi-query indexing technique with level-dimension nodes and extended-range nodes
- Lee M.; Yoon H.; Kim Y.J.; Lee Y.-K.
- Ewha Authors
- SCOPUS Author ID
- Issue Date
- Journal Title
- Proceedings of the 2nd International Conference on Ubiquitous Information Management and Communication, ICUIMC-2008
- 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. © 2008 ACM.
- Appears in Collections:
- 엘텍공과대학 > 컴퓨터공학과 > Journal papers
- Files in This Item:
There are no files associated with this item.
- RIS (EndNote)
- XLS (Excel)
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.