Hana tree: A dynamic and robust access method for spatial data handling

Yongwon Kwon, Chang-Sung Jeong

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages271-283
Number of pages13
Volume1846
ISBN (Print)9783540676270
Publication statusPublished - 2000
Event1st International Conference on Web-Age Information Management, WAIM 2000 - Shanghai, China
Duration: 2000 Jun 212000 Jun 23

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1846
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other1st International Conference on Web-Age Information Management, WAIM 2000
CountryChina
CityShanghai
Period00/6/2100/6/23

Fingerprint

Data Handling
Data handling
Spatial Data
Vertex of a graph
Spatial Database
Encoding
Query
Binary
Decrease
Experimental Results

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Kwon, Y., & Jeong, C-S. (2000). Hana tree: A dynamic and robust access method for spatial data handling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1846, pp. 271-283). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1846). Springer Verlag.

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 proceedingConference contribution

Kwon, Y & Jeong, C-S 2000, Hana tree: A dynamic and robust access method for spatial data handling. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1846, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1846, Springer Verlag, pp. 271-283, 1st International Conference on Web-Age Information Management, WAIM 2000, Shanghai, China, 00/6/21.
Kwon Y, Jeong C-S. Hana tree: A dynamic and robust access method for spatial data handling. In 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)).
Kwon, Yongwon ; Jeong, Chang-Sung. / Hana tree : A dynamic and robust access method for spatial data handling. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1846 Springer Verlag, 2000. pp. 271-283 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{a29deda34ce7466fb94a019529691f3b,
title = "Hana tree: A dynamic and robust access method for spatial data handling",
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.",
author = "Yongwon Kwon and Chang-Sung Jeong",
year = "2000",
language = "English",
isbn = "9783540676270",
volume = "1846",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "271--283",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

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 -