Spatial query processing in an object-oriented database system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
EDBT '90 Proceedings of the 2nd international conference on extending database technology: Advances in Database Technology
Randomized algorithms for optimizing large join queries
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Rule-based optimization and query processing in an extensible geometric database system
ACM Transactions on Database Systems (TODS)
Towards an analysis of range query performance in spatial data structures
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Spatial data models and query processing
Modern database systems
Topological relations in the world of minimum bounding rectangles: a study with R-trees
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Building a scaleable geo-spatial DBMS: technology, implementation, and evaluation
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Selectivity estimation in spatial databases
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Analysis of two-step index structure for complex spatial objects
Information Sciences—Applications: An International Journal
Approximating block accesses in database organizations
Communications of the ACM
Database System Concepts
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Accurate estimation of the number of tuples satisfying a condition
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The Effect of Buffering on the Performance of R-Trees
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Extending a DBMS for Geographic Applications
Proceedings of the Fifth International Conference on Data Engineering
Cost Models for Join Queries in Spatial Databases
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Optimization for Spatial Query Processing
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
A Cost Model for Estimating the Performance of Spatial Joins Using R-trees
SSDBM '97 Proceedings of the Ninth International Conference on Scientific and Statistical Database Management
Query Optimization Techniques Utilizing Path Indexes in Object-Oriented Database Systems
Proceedings of the Fifth International Conference on Database Systems for Advanced Applications (DASFAA)
Early Separation of Filter and Refinement Steps in Spatial Query Optimization
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
The Volcano Optimizer Generator: Extensibility and Efficient Search
Proceedings of the Ninth International Conference on Data Engineering
OPT++ : an object-oriented implementation for extensible database query optimization
The VLDB Journal — The International Journal on Very Large Data Bases
A query optimization in distributed database systems
A query optimization in distributed database systems
Hi-index | 0.00 |
Recently, we proposed an optimization strategy for spatial and non-spatial mixed queries. In the strategy, the filter step and the refinement step of a spatial operator are regarded as individual algebraic operators, and are early separated at the algebraic level by the query optimizer. By doing so, the optimizer using the strategy could generate more diverse and efficient plans than the traditional optimizer. We called this optimization strategy the Early Separated Filter And Refinement (ESFAR).In this paper, we improved the cost model of the ESFAR optimizer considering the real life environment such as the LRU buffer, the clustering of the dataset, and the selectivity of the real data distribution. And we conducted a new experiment for ESFAR by comparing the optimization result generated by the new cost model and the actual execution result using real data. The experimental result showed that our cost model is accurate and our ESFAR optimizer estimates the costs of execution plans well.Since the ESFAR strategy has more operators and more rules than the traditional one, it consumes more optimization time. In this paper, we apply two existing heuristic algorithms, the iterative improvement (II) and the simulated annealing (SA), to the ESFAR optimizer. Additionally we propose a new heuristic algorithm to find a good initial state of II and SA. Through experiments, we show that the II and SA algorithms in the ESFAR strategy find a good sub-optimal plan in reasonable time. Mostly the heuristic algorithms find a lower cost plan in less time than the optimal plan generated by the traditional optimizer Especially the II algorithm with the initial state heuristic rapidly finds a plan of a high quality.