Please wait a minute...
浙江大学学报(工学版)
J4  2013, Vol. 47 Issue (3): 442-448    DOI: 10.3785/j.issn.1008-973X.2013.03.007
计算机技术     
面向动态环境的移动对象自适应索引方法
陈楠1,寿黎但2,陈刚2,陈珂2,胡天磊2
1. 浙江省烟草公司 信息中心, 浙江 杭州 310001| 2. 浙江大学 计算机科学与技术学院, 浙江 杭州 310027
elf-tuning indexing of moving objects for dynamic environment
CHEN Nan1, SHOU Li-dan2, CHEN Gang2, CHEN Ke2,HU Tian-lei2
1. Information Centre, Zhejiang Tobacco Corporation, Hangzhou 310001, China
2. College of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China
 全文: PDF  HTML
摘要：

为适应动态变化的应用环境,提高索引的综合性能,提出一种自适应的移动对象索引——STBx树.给出了STBx树的索引结构、更新算法和查询算法,并且在性能分析的基础上给出了STBx树进行自适应调节的方法.STBx树以自学习和自适应的运行,在不打断服务的情况下对自身的更新性能和查询性能进行调节,从而达到最佳的平稳的综合性能,以适应更新操作和查询操作的比例以及性能需求动态变化的环境.实验表明：STBx树在动态应用环境下能够实现自适应的调节,并提供优秀的综合性能,优于传统的TPR*树和Bx树.
Abstract:

A novel index of moving objects based on Bx-tree, named STBx-tree was proposed in order to adapt to dynamic environment and improve overall performance. The index structure, update algorithm and query algorithm of STBx-tree were described. In addition, the self-tuning technique of STBx-tree was designed and represented based on the performance analysis. STBx-tree adapts to dynamic environment in a self-learning and self-tuning way without interrupting the indexing service. STBx-tree adjusts its update and query performance to obtain optimal and smooth overall performance, when the proportion of query and update operations in the application dynamically changes over time. Experimental results show that STBx-tree worked well and efficiently in dynamic environment, and outperformed the existing indexes of TPR*-tree and Bx-tree．
出版日期: 2013-03-01
:  TP 392  
基金资助:

国家自然科学基金资助项目(60603044, 60803003);国家“863”高技术研究发展计划资助项目(2009AA01Z137);浙江省科技计划资助项目(2008c141060).
通讯作者: 陈刚，男，教授，博导.     E-mail: cg@zju.edu.cn
作者简介: 陈楠(1983- )，男，博士，从事数据库、商务智能、GIS和物联网等的研究和应用. E-mail: cnasd715@zju.edu.cn
服务　　
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章　　

引用本文:

陈楠,寿黎但,陈刚,陈珂,胡天磊. 面向动态环境的移动对象自适应索引方法[J]. J4, 2013, 47(3): 442-448.

CHEN Nan, SHOU Li-dan, CHEN Gang, CHEN Ke, HU Tian-lei. elf-tuning indexing of moving objects for dynamic environment. J4, 2013, 47(3): 442-448.

链接本文:

http://www.zjujournals.com/eng/CN/10.3785/j.issn.1008-973X.2013.03.007    或    http://www.zjujournals.com/eng/CN/Y2013/V47/I3/442

［1］ WOLFSON O, XU B, CHAMBERLAIN S, et al. Moving objects databases: issues and solutions［C］∥ Proceedings of the 10th International Conference on Scientific and Statistical Database Management (SSDBM). Capri: IEEE Computer Society, 1998:111-122．
［2］ BECKMANN N, KRIEGEL H, SCHNEIDER R, et al. The R*-tree: an efficient and robust access method for points and rectangles［C］∥ Proceedings of the 1990 ACM International Conference on Management of Data (SIGMOD). Atlantic City: ACM, 1990: 322-331．
［3］ SALTENIS S, JENSEN C S, LEUTENEGGER S T,et al. Indexing the positions of continuously moving objects［C］∥ Proceedings of the 2000 ACM International Con-ference on Management of Data (SIGMOD). Dallas: ACM, 2000: 331-342．
［4］ TAO Y, PAPADIAS D, SUN J. The TPR*-tree: an optimized spatio-temporal access method for predictive queries［C］∥ Proceedings of the 29th International Conference on Very Large Data Bases (VLDB). Berlin: Morgan Kaufmann, 2003: 790-801．
［5］ SALTENIS S, JENSEN C S. Indexing of moving objects for location-based services［C］∥Proceedings of the 18th International Conference on Data Engineering (ICDE). San Jose: IEEE Computer Society, 2002: 463-472．
［6］ PRABHAKAR S, XIA Y, KALASHNIKOV D V, et al. Query indexing and velocity constrained indexing: scalable techniques for continuous queries on moving objects［J］. IEEE Transactions on Computers, 2002, 51(10): 1124-1140．
［7］ 丁晓锋, 卢炎生, 潘鹏, 等. 基于U-tree的不确定移动对象索引策略［J］. 软件学报, 2008, 19(10): 2696-2705．
DING Xiao-feng, LU Yan-sheng, PAN Peng, et al. U-tree based indexing method for uncertain moving objects［J］. Journal of Software, 2008, 19(10): 2696-2705．
［8］ JENSEN C S, LIN D, OOI B C. Query and update efficient B+-tree based indexing of moving objects［C］∥ Proceedings of 30th the International Conference on Very Large Data Bases (VLDB). Toronto: Morgan Kaufmann, 2004: 768-779．
［9］ YIU M L, TAO Y, MAMOULIS N. The Bdual-tree: indexing moving objects by space filling curves in the dual space［J］. VLDB Journal, 2008, 17(3): 379-400．
［10］ CHEN S, NASCIMENTO M A, OOI B C, et al. Continuous online index tuning in moving object databases［J］. ACM Transactions Database Systems (TODS), 2010, 35(3):145．
［11］ FALOUTSOS C, ROSEMAN S. Fractals for secondary key retrieval［C］∥ Proceedings of the ACM Symposium on Principles of Database Systems (PODS). Philadelphia: ACM , 1989:247-252．
No related articles found!