earticle

논문검색

The New Strategy of Object-Based Directional Query

원문정보

Run-tao liu, Yan-ming Wang, Zhen-guo Zhao, Guang -Yue Tian

보안공학연구지원센터(IJDTA) International Journal of Database Theory and Application Vol.7 No.6 2014.12 pp.55-62
피인용수 : 0건 (자료제공 : 네이버학술정보)

초록

영어

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

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.