• Article
  • | |
  • Metrics
  • |
  • Reference [7]
  • |
  • Related
  • | | |
  • Comments
    Abstract:

    An index structure ACEI (advanced CEI) is proposed in this paper to optimize the storage of CEI (containment-encoded intervals)-based interval index structure for data stream processing which involves a lot of operations of the numerical range query. It is necessary to construct a main memory-based query index with a low storage cost and little search time. The CEI index structure has low storage utilization, although it supports for high-speed query. To solve this problem, index structure ACEI is proposed. Based on CEI, through structural adjustment and optimization of parameters, ACEI can maintain the high speed of query operation and reduce the space complexity from O(R+N·W/L+N·log(L)) to O(sqrt(R·N)+ N·sqrt(W)). Experiments show that ACEI structure can greatly improve the storage utilization and can be used for interval index against a large endpoint range.

    Reference
    [1] Carney D, Cetintemel U, Cherniack M, Convey C, Lee S, Seidman G, Stonebraker M, Tatbul N, Zdonik S. Monitoring streams—A new class of data management applications. In: Proc. of the Very Large Data Bases. 2002. http://portal.acm.org/citation.cfm?id= 1287389
    [2] Madden SR, Shah MA, Hellerstein JM, Raman V. Continuously adaptive continuous queries over streams. In: Proc. of the ACM SIGMOD Int’l Conf. on Management of Data. 2002. http://portal.acm.org/citation.cfm?id=564691.564698
    [3] Wu KL, Chen SK, Yu PS. Interval query indexing for efficient stream processing. In: Proc. of the ACM CIKM. 2004. http://portal.acm.org/citation.cfm?id=1031171.1031188
    [4] Wu KL, Chen SK, Yu PS. Query indexing with containment-encoded intervals for efficient stream processing. Knowledge and Information Systems, 2006,9(1):62-90.
    [5] Hanson EN, Chaabouni M. The IBS-tree: A data structure for finding all intervals that overlap a point. WSU-CS-90-11. Wright State University, 1994.
    [6] Hanson EN, Johnson T. The interval skip list: A data structure for finding all intervals that overlap a point. In: Proc. of the 1991 Workshop on Algorithms and Data Structures (WADS). 1991. 153-164. http://www.springerlink.com/content/d6j035h3t44n1541/
    [7] de Berg M, van Kreveld M, Overmars M, Schwarzkopf O. Computational Geometry: Algorithms and Applications. Springer-Verlag, 2000.
    Related
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

姚秋林,王映,刘萍,郭莉.一种空间更优的数据流查询包含编码区间索引.软件学报,2009,20(9):2462-2469

Copy
Share
Article Metrics
  • Abstract:3758
  • PDF: 5604
  • HTML: 0
  • Cited by: 0
History
  • Received:August 07,2007
  • Revised:June 03,2008
You are the first2044853Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063