Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2009.16-D.4.507

Efficient Query Indexing for Short Interval Query  

Kim, Jae-In (전남대학교 전자컴퓨터공학부)
Song, Myung-Jin (전남대학교 전자컴퓨터공학부)
Han, Dae-Young (전남대학교 전자컴퓨터공학부)
Kim, Dae-In (전남대학교 전자컴퓨터공학부)
Hwang, Bu-Hyun (전남대학교 전자컴퓨터공학부)
Publication Information
The KIPS Transactions:PartD / v.16D, no.4, 2009 , pp. 507-516 More about this Journal
Abstract
In stream data processing system, generally the interval queries are in advance registered in the system. When a data is input to the system continuously, for realtime processing, a query indexing method is used to quickly search queries. Thus, a main memory-based query index with a small storage cost and a fast search time is needed for searching queries. In this paper, we propose a LVC-based(Limited Virtual Construct-based) query index method using a hashing to meet the both needs. In LVC-based query index, we divide the range of a stream into limited virtual construct, or LVC. We map each interval query to its corresponding LVC and the query ID is stored on each LVC. We have compared with the CEI-based query indexing method through the simulation experiment. When the range of values of input stream is broad and there are many short interval queries, the LVC-based indexing method have shown the performance enhancement for the storage cost and search time.
Keywords
Data Stream; Interval Query; Query Indexing; Continuous Query;
Citations & Related Records
연도 인용수 순위
  • Reference
1 E. Hanson, M, Chaabouni, C. Kim, and Y. Wang, 'A Predicate Matching Algorithm for Database Rule Systems', In Proc. of ACM SIGMOD 1990, 1990   DOI
2 K.-L. Wu, S.-K. Chen, and P. S. Yu, 'Interval query indexing for efficient stream processing', In CIKM 2004, pp.88-97, 2004.11   DOI
3 Motwani, R. et al., 'Query Processing, Approximation, and Resource Management in a Data Stream Management System', In Proc. The First Biennial Conf. on Innovative Data Systems Research, Asiloma, California, pp.245-256, 2003.1
4 B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom, 'Models and Issues in Data Stream systems', Proc. of ACM PODS 2002, Madison, Wisconsin, United States, 2002   DOI
5 A. Guttman, 'R-trees: A dynamic index structure for spatial searching', ACM Computing Surveys, Vol.30, No.2, 1998.6
6 D.Carney, U. Cetintemel, M. Cherniack, C. Convey, S. Lee, G. Seidman, M. Stonebraker, N. Tatbul and S. Zdonik, 'Monitoring stream - a new class of data management applications', In Proc. of Very Lage Data Bases, 2002
7 H. Edelsbrunner. 'Dynamic data structures for othogonal intersection queries', Technical Report 59, institute for Information Processing, Technical University of Graz, Graz, Austria, 1980
8 E. Hanson, ISlist.tar: A tar file containing C++ source code for IS-lists, http://www-pub.cise.ufl.edu/~hanson/IS-lists/
9 E. Hanson and T. Johnson, 'Selection Predicate Indexing for Active Database Using Interval Skip Lists', Information Systems, Vol.21, No.3, 1996   DOI   ScienceOn
10 Terry, D. et al., 'Continuous Queries over Append-Only Databases', In Proc, Int'l Conf. on Management of Data, ACM SIGMOD, San Diego, California, pp.321-330, 1992.6   DOI
11 S. R. Madden, M. A. Shah, J. M. Hellerstein, and V. Raman. 'Continuously Adaptive Continuous Queries over Streams', Proc. of ACM SIGMOD 2002, Madison, Wisconsin, United States, 2002   DOI
12 H. Samet, Design and Analysis of Spatial Data Structures, Addison-Wesley, 1990
13 K.-L. Wu, S.-K. Chen, P. S. Yu and M. Mei. 'Efficient interval indexing for content-based subscription e-commerce and e-serviec', In Proc. of IEEE Int. Conf. on e-Commerce Technology for Dynamic E-Business, 2004.12   DOI