Query optimization by simulated annealing
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Fractals for secondary key retrieval
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Introduction to algorithms
Linear clustering of objects with multiple attributes
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
CIKM '93 Proceedings of the second international conference on Information and knowledge management
A decomposition-based simulated annealing technique for data clustering
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Window query-optimal clustering of spatial objects
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Snakes and sandwiches: optimal clustering strategies for a data warehouse
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Globally Order Preserving Multidimensional Linear Hashing
Proceedings of the Fourth International Conference on Data Engineering
Set-Oriented Disk Access to Large Complex Objects
Proceedings of the Fifth International Conference on Data Engineering
Optimizing Spatial Data Structures For Static Data
IGIS '94 Proceedings of the International Workshop on Advanced Information Systems: Geographic Information Systems
The Impact of Global Clustering on Spatial Database Systems
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Query-Adaptive Data Space Partitioning using Variable-Size Storage Clusters
SSD '93 Proceedings of the Third International Symposium on Advances in Spatial Databases
QED: an efficient framework for temporal region query processing
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
| Hi-index | 0.00 |
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 Hilbert 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.