Polynomial Heuristics for Query Optimization
Research on query optimization has traditionally focused on exhaustive enumeration of an exponential number of candidate plans. Alternatively, heuristics for query optimization are restricted in several ways, such as by either focusing on join predicates only, ignoring the availability of indexes, or in...
The standard approach to join-query optimization is cost based, which requires developing a cost model, assigning an estimated cost to each query-processing plan, and searching in the space of all plans for a plan of minimal cost. But as the number of joins increases, the size of the ...
Due to its direct impact on the performance of relational database management systems (DBMS), query processing algorithms have been the subject of considerable study. Typical processing strategies involve the calculation of elaborate cost functions to find an "optimum" one. The topic of this paper ...
A heuristics-based approach to query optimization in structureddocument databasesThe number of documents published via the World Wide Web in the\nform of SGML/HTML has been rapidly growing for years. Efficient,\ndeclarative access mechanisms for this type of document-structured\ndocuments in general...
Bruno N.: Polynomial heuristics for query optimization. In: Proc. of Int. Conf. of Data Engineering. pp.589-600. IEEE,USA( 2010)Bruno, N., Galindo-Legaria, C.A., Joshi, M.: Polynomial heuris- tics for query optimization. In: ICDE, pp. 589-600 (2010)...
There have been several studies addressing the efficiency of different algorithms in solving TSPs. However, the number of nodes involved in these studies is far less than the modern PCB design requirement. This study is to evaluate the efficiency of documented combinatorial optimization algorithms for...
Alternatively, heuristics for query optimization are restricted in several ways, such as by either focusing on join predicates only, ignoring the availability of indexes, or in general having high-degree polynomial complexity. In this paper we propose a heuristic approach to very efficiently obtain ...