Earticle

초록

영어

To increase directional query efficiency, based on the study of existing algorithms of directional query, new pruning rules for directional query were given, combined with the new index structure MB-tree. The rules exclude the MBRs outside the query area and output all leaf nodes in the MBRs inside the query area. Based on the orders defined in MB-tree, a new algorithm of directional query is given combining with MB-tree by using recursive method, and the new algorithm can reduce I/O cost effectively. Experiment showed that the new directional query algorithm reduces the number of visited nodes, decreases I/O cost, and improves the efficiency of directional query.

목차

Abstract
 1. Introduction
 2. Related Work
  2.1. Directional Query
  2.2.MB-Tree
 3. Prune Rules
 4. Query Algorithm
 5. Experiment
 6. Conclusions and Future Work
 Acknowledgements
 References

키워드

저자

• Run-tao liu [ Institute of Information and Scientific Computing Technology, Harbin University of Science and Technology, Harbin 150080, China ]
• Yan-ming Wang [ Department of Applied Mathematics, College of Applied Sciences, Harbin University of Science and Technology, Harbin 150080, China ]
• Zhen-guo Zhao [ Department of Applied Mathematics, College of Applied Sciences, Harbin University of Science and Technology, Harbin 150080, China ]
• Guang -Yue Tian [ Department of Applied Mathematics, College of Applied Sciences, Harbin University of Science and Technology, Harbin 150080, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Database Theory and Application

• 간기

  격월간

• pISSN

  2005-4270

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605