Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Publisher | Springer Verlag |
| Pages | 271-283 |
| Number of pages | 13 |
| Volume | 1846 |
| ISBN (Print) | 9783540676270 |
| Publication status | Published - 2000 |
| Event | 1st International Conference on Web-Age Information Management, WAIM 2000 - Shanghai, China Duration: 2000 Jun 21 → 2000 Jun 23 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 1846 |
| ISSN (Print) | 03029743 |
| ISSN (Electronic) | 16113349 |
Other
| Other | 1st International Conference on Web-Age Information Management, WAIM 2000 |
|---|---|
| Country | China |
| City | Shanghai |
| Period | 00/6/21 → 00/6/23 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
- Theoretical Computer Science
Cite this
Hana tree : A dynamic and robust access method for spatial data handling. / Kwon, Yongwon; Jeong, Chang-Sung.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1846 Springer Verlag, 2000. p. 271-283 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1846).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Hana tree
T2 - A dynamic and robust access method for spatial data handling
AU - Kwon, Yongwon
AU - Jeong, Chang-Sung
PY - 2000
Y1 - 2000
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84949009792&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84949009792&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84949009792
SN - 9783540676270
VL - 1846
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 271
EP - 283
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PB - Springer Verlag
ER -