Paper Info
Title
The multidimensional persistent tree: A spatiotemporal data management structure suitable for spatial search
Abstract
Multidimensional data structures have been proposed for management of spatial data including points, lines, and regions. Concomitantly, more research on temporal databases as a way to handle temporal information is needed. Although the management of spatiotemporal data becomes increasingly important in geographic information systems and computer-aided design, these data structures cannot manage spatiotemporal data efficiently. In this paper, the MP-tree (multidimensional persistent tree) is proposed for handling multidimensional data with insertion/deletion version without the loss of efficiency of a spatial search. The MP-tree is developed by extending conventional spatial data structure using techniques of Persistent Search Tree. The advantages and disadvantages of conventional methods with respect to both search and memory efficiency are discussed. Finally, using computer simulations, the MP-tree is shown to have better performances for both range search and spatiotemporal search.
Year
DOI
Venue
1996
10.1002/scj.4690270606
SYSTEMS AND COMPUTERS IN JAPAN
Keywords
Field
DocType
spatial data management,data structure,database,spatiotemporal data management
Spatial analysis,Geographic information system,Data structure,Data mining,Computer science,Temporal database,Tree structure,Group method of data handling,Data management,Search tree
Journal
Volume
Issue
ISSN
27
6
0882-1666
Citations 
PageRank 
References 
0
0.34
3
Authors
4
Name
Order
Citations
PageRank
Teruhiko Teraoka1955.44
Minoru Maruyama29813.89
Yasuaki Nakamura3105140.45
Shogo Nishida422752.41