Abstract
In this paper, an efficient access method for integrating multi-scale geometric data is proposed. Previous access methods do not access multi-scale geometric data efficiently. To solve it, a few access methods for multi-scale geometric data, are known. However these methods do not support all types of multi-scale geometric data, because they support only a selection operation and a simplification operation of all map generalization operations. We propose a new method for integrating multi-scale geometric data. In the proposed method, collections of indexes in its own scale are integrated into a single index structure. By the integration, not only does the proposed method offers fast search, but also the proposed method does not introduce data redundancy. Moreover, the proposed method supports all types of multi-scale geometric data. The experimental results show that our method is an efficient method for integrating multi-scale geometric data.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Becker, H.-W. Six, and P. Widmayer, “Spatial Priority Search: an Access Technique for Scaless Maps”, Proceedings ACM SIGMOD Conference, pp.128–137, Denver, CO, 1991.
N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, “The R*-tree: An Efficient and Robust Access Method for Points and Rectangles”, Proceedings ACM SIGMOD Conference, pp.322–331, Atlantic City, NJ, 1990.
M. Bertolotto and M.J. Egenhofer, “Progressive Vector Transmission”, Proceedings 7th ACM-GIS Symposium, pp.152–157, Kansas City, USA, Nov. 1999.
D.H. Douglas and T.K. Peucker, “Algorithms for the Reduction of Points Required to Rep-resent a Digitized Line or its Caricature”, Canadian Cartography, 10, pp. 112–122, 1973.
P.F.C. Edward and K.W.C. Kevin, “On Multi-Scale Display of Geometric Objects”, Data and Knowledge Engineering, 40(1), pp. 91–119, 2002.
V. Gaede and O. Gunther, “Multidimensional Access Methods”, ACM Computing Surveys, 30(2), pp. 170–231, 1998.
A. Guttman, “R-trees: A Dynamic Index Structure for Spatial Searching”, Proceedings ACM SIGMOD Conference, pp. 47–54, Boston, Ma., 1984.
A. Hutflesz, H.-W. Six, and P. Widmayer, “The R-file: An Efficient Access Structure for Proximity Queries”, Proceedings 6th IEEE ICDE Conference, pp. 372–379, Los Angeles, CA, 1990.
I. Kamel and C. Faloutsos., “Hilbert R-tree: An Improved R-tree Using Fractals”, Proceed-ings 20th VLDB Conference, pp. 500–509, Santiago de Chile, Chile, 1994.
J. Nievergelt,, H. Hinterberger, and K.C. Sevcik, “The Grid file: an Adaptable, Symmetric Multikey File Structure”, ACM Transactions on Database Systems. 9(1), pp. 38–71, 1984.
P.V. Oosterom, “The Reactive-tree: a Storage Structure for a Seamless, Scaless Geographic Database”, Proceedings of Auto-Carto, 10, pp. 393–407, 1991.
P.V. Oosterom and V. Schenkelaars, “The Development of an Interactive Multi-scale GIS”, International Journal of Geographic Information Systems, pp. 489–507, 1995.
A. Ruas, “Multiple representation and generalization”, Lecture Notes for “sommarkurs: kartografi”, 1995.
H. Samet, “The Quadtree and Related Hierarchical Data Structure”, ACM Computing Surveys, 16(2), pp. 187–260, 1984.
H. Samet and R.E. Webber, “Storing a collection of polygons using quadtrees”, ACM Transactions on Graphics, 4(3), pp. 182–222, 1985.
T. Sellis, N. Roussopoulos, and C. Faloutsos, “The R+-tree: A Dynamic Index for Multidi-mensional Objects”, Proceedings 13th VLDB Conference, pp. 507–518, Brighton, England, 1987.
S. Timpf, “Cartographic Objects in a Multi-scale Data Structure”, Geographic Information Research: Bridging the Atlantic. 1(1), pp. 224–234, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kwon, JH., Yoon, YI. (2002). An Access Method for Integrating Multi-scale Geometric Data. In: Manolopoulos, Y., Návrat, P. (eds) Advances in Databases and Information Systems. ADBIS 2002. Lecture Notes in Computer Science, vol 2435. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45710-0_17
Download citation
DOI: https://doi.org/10.1007/3-540-45710-0_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44138-0
Online ISBN: 978-3-540-45710-7
eBook Packages: Springer Book Archive