Efficient Region Query Processing by Optimal Page Ordering

  • Dae -Soo Cho
  • Bong -Hee Hong
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1884)


A number of algorithms of clustering spatial data for reducing the number of disk seeks required to process spatial queries have been developed. One of the algorithms is the scheme of page ordering, which is concerned with the order of pages in one-dimensional storage for storing two-dimensional spatial data. The space filling curves, especially the Hubert curves, have been so far used to impose an order on all of pages. Page ordering based on the space filling curves, however, does not take into account the uneven distribution of spatial objects and the types of spatial queries. We will develop a cost model to define the page ordering problem based on performance measurement and then find out the method of page ordering for efficiently processing region queries in static databases. The experimental results will show that the newly proposed ordering method achieves better clustering than older methods.


Cost Model Travel Salesman Problem Travel Salesman Problem Hamiltonian Cycle Spatial Object 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Thomas Brinkhoff, and Hans-Peter Kriegel, “The Impact of Global Clustering on Spatial Database Systems”, pp168–179, VLDB, 1994Google Scholar
  2. 2.
    Lukas Bachmann, Bernd-Uwe Pagel, and Hans-Werner Six, “Optimizing Spatial Data Structures For Static Data”, pp247–258, IGIS, 1994Google Scholar
  3. 3.
    Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, “Introduction to algorithms”, McGraw-Hill Company, 1989Google Scholar
  4. 4.
    Cisbert Droge, and Hans-Jörg Schek, “Query-Adaptive Data Space Partitioning using Variable-Size Storage Clusters”, pp337–356, SSD, 1993Google Scholar
  5. 5.
    Christos Faloutsos, and Shari Roseman, “Fractanls for Secondary Key Retrieval”, pp247–252, PODS, 1989Google Scholar
  6. 6.
    Kien A. Hua, Sheau-Dong Lang, and Wen K. Lee, “A Decomposition-Based Simulated Annealing Technique for Data Clustering”, pp117–128, PODS, 1994Google Scholar
  7. 7.
    Andreas Hutflesz, Hans-Werner Siz, and Peter Widmayer, “Globally Order Preserving Multidimensional Linear Hashing”, pp572–579, ICDE, 1988Google Scholar
  8. 8.
    Y. E. Ioannidis, and Eugene Wong, “Query optimization by simulated annealing”, pp9–11, SIGMOD, 1987Google Scholar
  9. 9.
    H. V. Jagadish, “Linear Clustering of Objects with Multiple Attributes”, pp332–342, SIGMOD, 1990Google Scholar
  10. 10.
    H. V. Jagadish, Laks V. S. Lakshmanan, and Divesh Srivastava, “Snakes and Sandwiches: Optimal Clustering Strategies for a Data Warehouse”, pp37–48, SIGMOD, 1999Google Scholar
  11. 11.
    Ibrahim Kamel, and Christos Faloutsos, “On Packing R-trees, Information & Knowledge Management”, pp490–499, CIKM, 1993Google Scholar
  12. 12.
    Ibrahim Kamel, and Christos Faloutsos, “Hilbert R-tree: An improved R-tree using fractals”, pp500–509, VLDB, 1994Google Scholar
  13. 13.
    Bernd-Uwe Pagel, Hans-Werner Six, and Mario Winter, “Window Query-Optimal Clustering of Spatial Objects”, pp86–94, PODS, 1995Google Scholar
  14. 14.
    G. Reinelt, “The Traveling Salesman Problem”, Springer Verlag, 1994.Google Scholar
  15. 15.
    Gerhard Weikum, “Set-Oriented Disk Access to Large Complex Objects”, pp426–433, ICDE, 1989Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Dae -Soo Cho
    • 1
  • Bong -Hee Hong
    • 1
  1. 1.Department of Computer EngineeringPusan National UniversityPusanSouth Korea

Personalised recommendations