원문정보
보안공학연구지원센터(IJDTA)
International Journal of Database Theory and Application
vol.1 no.1
2008.12
pp.29-36
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
The B+-tree was proposed to support sequential processing for the B-tree. To the extent of authors’ knowledge, however, there have been no studies supporting sequential processing in multidimensional point access methods(PAMs). To do this, the cells in a multilevel and multidimensional space managed by a multidimensional PAM must be linearly ordered systematically. In this paper, we present ideas for an approach that linearly orders cells in a multilevel and multidimensional space. Then, we present ideas for a novel sequential processing algorithm for region queries using this approach.
목차
Abstract
1 Introduction
2 Characteristics of Space Filling Curves
3 Multifarious Granuled Grid(MGG) and MultifariousGranuled SFC(MGSFC)
3.1 Multifarious Granuled Grid(MGG)
3.2 Multifarious Granuled Space Filling Curve(MGSFC)
3.3 Region Query Processing
4 Conclusions
Reference
1 Introduction
2 Characteristics of Space Filling Curves
3 Multifarious Granuled Grid(MGG) and MultifariousGranuled SFC(MGSFC)
3.1 Multifarious Granuled Grid(MGG)
3.2 Multifarious Granuled Space Filling Curve(MGSFC)
3.3 Region Query Processing
4 Conclusions
Reference
저자정보
참고문헌
자료제공 : 네이버학술정보