Paper Info
Title
An efficient balanced hierarchical data structure for multiversion accesses to spatio-temporal data
Abstract
In the management of spatio-temporal data, a data structure must manage multiple versions of a data structure efficiently, and provide quick and flexible search methods not only for temporal or spatial queries, but also for the combined queries of spatial and temporal intervals. The persistent MD-tree, called the PMD-tree is developed by extending a hierarchical data structure to support accesses to multiple versions. The PMD-tree has the novel properties that the tree representing any time aspect of a data structure is always balanced, and that the storage utilization rate is more than 66.6%. The algorithms of the PMD-tree, space and time analyses, and search performances compared to the MD-tree are described in the paper.
Year
Venue
Keywords
1998
EUSIPCO
query processing,search problems,spatiotemporal phenomena,tree data structures,pmd-tree,balanced hierarchical data structure,multiversion spatiotemporal data accesses,persistent md-tree,search methods,search performances,space analysis,spatial queries,spatiotemporal data management,temporal queries,time analysis
Field
DocType
ISBN
Data structure,Data mining,Computer science,Time aspect,Theoretical computer science,Temporal database,Utilization rate,Hierarchical database model,K-D-B-tree
Conference
978-960-7620-06-4
Citations 
PageRank 
References 
1
3.42
0
Authors
2
Name
Order
Citations
PageRank
Dekihara, H.113.42
Yasuaki Nakamura2105140.45