NobleBlocks
Public

An Efficient Query Processing Data Structure for Moving Objects using Information of Future Positions-High Performance Data Access by Direct Indexing-

Published in IEEJ Transactions on Electronics Information and Systems • Jan 1, 2007
NobleIDNI1P74W68R79S40
Authors:
Hiroyuki Dekihara
,
Y. Nakamura

Abstract

We propose a novel data structure, called the DIMD-tree, that provides efficient successive spatial searches in GPS navigation systems, mobile phone systems and so forth. The DIMD-tree can be applicable for the geographic data management of positioning systems as well as the query processing for cur...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!