Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2008.15-D.3.297

QUISIS: A Query Index Method Using Interval Skip List  

Min, Jun-Ki (한국기술교육대학교 인터넷미디어공학부)
Publication Information
The KIPS Transactions:PartD / v.15D, no.3, 2008 , pp. 297-304 More about this Journal
Abstract
Due to the proliferation of the Internet and intranet, new application domains such as stream data processing have emerged. Stream data is real-timely and continuously generated. In stream data environments, a lot of queries are registered, and then, the arrived data item is evaluated by registered queries. Thus, to accelerate the query performance, diverse continuous query index schemes have been proposed for stream data processing systems. In this paper, we focus on the query index technique for stream data. In general, a stream query contains the range condition. Thus, by using range conditions, the queries can be indexed. In this paper, we propose an efficient query index scheme, called 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. Through the experimental study, we show the efficiency of our proposed method.
Keywords
Stream Data; Index; Query Index;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. Babu, R. Motwani, K. Munagala, I. Nishizawa, J. Widom, “Adaptive ordering of pipelined stream filters,” In Proceedings of ACM SIGMOD Conference, pp.407-418, 2004
2 S. Madden, M.A. Shah, J.M. Hellerstein, V. Raman, “Continuously adaptive continuous queries over streams,” In Proceedings of ACM SIGMOD Conference, 2002
3 A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” In Proceedings of ACM SIGMOD Conference, 1984
4 T. Brinkhoff, H. Kriegel, R. Scheneider, B. Seeger, “The R*-tree: An Efficient and Robust Access Method for Points and Rectangles,” In Proceedings of ACM SIGMOD Conference, 1990
5 H. S. Lim, J. G. Lee, M. J. Lee, K. Y. Whang, I. Y. Song, “Continuous query processing in data streams using duality of data and queries,” In Proceedings of ACM SIGMOD Conference, pp.313-324, 2006
6 J. Lee, Y. Lee, S. Kang, H. Jin., S. Lee, B. Kim, J. Song, “BMQ-Index: Shared and Incremental Processing of Border Monitoring Queries over Data Streams,” In Proceedings of International Conference on Mobile Data Management (MDM'06), 2006
7 D. Carney, U. Cetintemel, M. Cherniack, C. Convey, S. Lee, G. Seidman, M. Stonebraker, N. Tatbul, S. B.Zdonik, “Monitoring streams - a new class of data management applications,” In Proceedings of VLDB Conference, pp.215-226, 2002
8 Niagara Project (http://www.cs.wis.edu/niagara)
9 C. Cortes, K. Fisher, D. Pregibon, A. Rogers, “Hancock: a language for extracting signatures from data streams,” In Proceedings in ACM SIGKDD Conference, pp.9-17, 2000
10 A. Arasu, B. Babcock, S. Babu, M. Datar, K. Ito, R. Motwani, I. Nishizawa, U. Srivastava, D. Thomas, R. Varma, J. Widom, J., “Stream: The stanford stream data manager,” IEEE Data Engineering Bulletin, Vol.26, No.1, pp.19-26, 2003
11 J. M. Hellerstein, M. J. Franklin, S. Chandrasekaran, A. Deshpande, K. Hildrum, S. Madden, V. Raman, V., M. A. Shah, “Adaptive query processing: Technology in evolution,” IEEE Data Engineering Bulletin, Vol.23, No.2, pp.7-18, 2000
12 K.A. Ross, “Conjunctive selection conditions in main memory,” In Proceedings of PODS, 2002
13 B. Babcock, S. Babu, M. Datar, R. Motwani, “Chain : Operator scheduling for memory minimization in data stream systems,” In Proceedings of ACM SIGMOD Conference, pp. 253-264, 2003
14 D. Carney, U. Cetintemel, A. Rasin, S. B. Zdonik, M. Cherniack, M. Stonebraker, “Operator scheduling in a data stream manager,” In Proceedings of VLDB Conference, pp. 838-849, 2003
15 H. M. Deitel, 'An Introduction to Operating Systems,' Addison-Wesley, 1990
16 E.N. Hanson, T. Johnson, “Selection Predicate Indexing for Active Databases Using Interval Skip Lists,” Information Systems 21,1996
17 R. Avnur, J. M. Hellerstein, “Eddies: Continuously adaptive query processing,” In Proceedings of ACM SIGMOD Conference, pp.261-272, 2000
18 D. Terry, D. Goldberg, D. Nichols, B. Oki, “Continuously Queries over Append-Only Databases,” In Proceedings of ACM SIGMOD Conference, 1992
19 S. Choi, J. Lee, S.M. Kim, S. Jo, J. Song, Y.J. Lee, “Accelerating Database Processing at e-Commerce Sites,” In Proceedings of International Conference on Electronic e-Commerce and Web Technologies. (2004)
20 S. Chandrasekaran, O. Cooper, A. Deshpande, M. J. Franklin, J. M. Hellerstein, W. Hong, S. Krishnamurthy, S. Madden, F. Reiss, M. A. Shah, “Telegraphcq: Continuous dataflow processing,” In Proceedings of ACM SIGMOD Conference, pp.668, 2003