Efficient Access Technique Using Levelized Data in Web-Based GIS

  • Joon-Hee Kwon
  • Yong-Ik Yoon
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2419)


An efficient access technique is one of the most important requirements in web-based GIS. With levelized spatial data we can access spatial data efficiently, because of no access to the fully detailed spatial data. Previous spatial access methods have disadvantages, such as data redundancy and low search performance, for levelized spatial data. To solve it, a few spatial access methods for levelized spatial data, are proposed. However these methods support only a few kinds of levelized data, i.e, data through a selection operation and a simplification operation. For the effects, we propose a new spatial access method supporting all kinds of levelized spatial data. A new access structure is designed and implemented. Experiments are then performed on real data sets. The results show that our method offers both high search performance and no data redundancy.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    B. Becker, H-W. Six, and P. Widmayer, “Spatial Priority Search: An Access Technique for Scaless Maps”, Proceedings of ACM SIGMOD, Denver, Colorado, pp. 128–137. 1991.Google Scholar
  2. 2.
    N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, “The R*-tree: an Efficient and Robust Access Method for Points and Rectangles”, Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 322–331, Atlantic City, NJ, 1990.Google Scholar
  3. 3.
    D.H. Douglas, T.K. Peucker, “Algorithms for the Reduction of Points Required to Represent a Digitized Line or its Caricature”, Canadian Cartography, 10, pp. 112–122, 1973.Google Scholar
  4. 4.
    P.F.C Edward, K.W.C Kevin, “On Multi-Scale Display of Geometric Objects”, International Journal on Data and Knowledge Engineering, 40(1), pp. 91–119, 2002.MATHCrossRefGoogle Scholar
  5. 5.
    V. Gaede, O. Gunther, “Multidimensional Access Methods”, ACM Computing Surveys, 30(2), pp. 170–231, 1998.CrossRefGoogle Scholar
  6. 6.
    Guttman, “R-trees: A Dynamic Index Structure for Spatial Searching”, Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 47–54, Boston, Ma., 1984.Google Scholar
  7. 7.
    Hutflesz, H-W. Six, and P. Widmayer, “The R-file: An Efficient Access Structure for Proximity Queries”, Proceedings of IEEE 6th International Conference on Data Engineering, pp. 372–379, Los Angeles, CA, 1990.Google Scholar
  8. 8.
    Kamel, C. Faloutsos., “Hilbert R-Tree: An Improved R-Tree Using Fractals”, Proceedings of 20th VLDB, Santiago de Chile, Chile, pp. 500–509, 1994.Google Scholar
  9. 9.
    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.CrossRefGoogle Scholar
  10. 10.
    P.V. Oosterom, “The Reactive-tree: A Storage Structure for a Seamless, Scaless Geographic Database”, Proceedings of Auto-Carto, 10, pp. 393–407, 1991.Google Scholar
  11. 11.
    P.V. Oosterom, V. Schenkelaars, “The development of an Interactive multi-scale GIS”, International Journal of Geographic Information Systems, pp. 489–507, 1995.Google Scholar
  12. 12.
    Ruas, “Multiple representation and generalization”, Lecture Notes for “sommarkurs: kartografi”, 1995.Google Scholar
  13. 13.
    H. Samet, “The Quadtree and Related Hierarchical Data Structure”, ACM Computing Surveys, 16(2), pp. 187–260, 1984.CrossRefMathSciNetGoogle Scholar
  14. 14.
    T. Sellis, N. Roussopoulos, and C. Faloutsos, “The R+-tree: A Dynamic Index for Multidimensional Objects”, Proceedings of the 13th International Conference on VLDB, pp. 507–518, Brighton, England, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Joon-Hee Kwon
    • 1
  • Yong-Ik Yoon
    • 1
  1. 1.Department of Computer ScienceSookmyung Women’s UniversitySeoulKorea

Personalised recommendations