The MP-tree: a data structure for spatio-temporal data

Author

Teraoka, Teruhiko ; Maruyama, Minoru ; Nakamura, Yasuaki ; Nishida, Shogo

Author_Institution

Central Res. Lab., Mitsubishi Electr. Corp., Hyogo, Japan

fYear

1995

fDate

28-31 Mar 1995

Firstpage

326

Lastpage

333

Abstract

The MP-tree (Multi-dimensional Persistent tree), a data structure for managing spatio-temporal data, is proposed. The MP-tree is developed by extending conventional spatial data structures using techniques of Persistent Search Tree. In this paper, the structure and operations of the MP-tree are described and the performance of the MP-tree is compared with three possible methods. Through computer simulations, it is shown performance of the MP-tree is better than the three methods for range searching for current version. For multiversion range searching, the MP-tree is also shown to be better when the length of query time interval is short

Keywords

spatial data structures; temporal databases; MP-tree; data structure; multi-dimensional persistent tree; multiversion range searching; persistent search tree; query time interval; spatio-temporal data; Computer graphics; Computer simulation; Costs; Data structures; Design automation; Information management; Management information systems; Nearest neighbor searches; Tree data structures; Tree graphs;

fLanguage

English

Publisher

ieee

Conference_Titel

Computers and Communications, 1995., Conference Proceedings of the 1995 IEEE Fourteenth Annual International Phoenix Conference on

Conference_Location

Scottsdale, AZ

Print_ISBN

0-7803-2492-7

Type

conf

DOI

10.1109/PCCC.1995.472473

Filename

472473