The BANG file: A new kind of grid file
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Fractals for secondary key retrieval
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The LSD tree: spatial access to multidimensional and non-point objects
VLDB '89 Proceedings of the 15th international conference on Very large data bases
The buddy tree: an efficient and robust access method for spatial data base
Proceedings of the sixteenth international conference on Very large databases
A general solution of the n-dimensional B-tree problem
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
A Mapping Function for the Directory of a Multidimensional Extendible Hashing
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Generalized Search Trees for Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
The Multilevel Grid File - A Dynamic Hierarchical Multidimensional File Structure
Proceedings of the Second International Symposium on Database Systems for Advanced Applications
| Hi-index | 0.00 |
In this paper, we present a new multidimensional access method, called hana tree, which can provide an efficient and robust way for dynamic modifications and interactive queries to spatial database. We designed a new multidimensional binary encoding scheme, hana code, for representing points and page regions in hana tree. When a new spatial data is inserted in uncovered data space, the page region of the existing node is expanded to include it instead of creating a new one. These properties allow the decrease in the total number of nodes and the reduction in the number of nodes accessed during search, thus improving the overall performance in storage space utilization and various operations Also, we shall describe our experimental results where hana tree is compared to other point access methods to show the superiority of hana tree.