Skip to main content
SpringerLink
Log in

Query Optimization in Distributed Relational Databases

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

The query optimizer is the DBMS (data base management system) component whose task is to find an optimal execution plan for a given input query. Typically, optimization is performed using dynamic programming. However, in distributed execution environments, this approach becomes intractable, due to the increase in the search space incurred by distribution. We propose the use of the tabu search metaheuristic for distributed query optimization. A hashing-based data structure is used to keep track of the search memory, simplifying significantly the implementation of tabu search. To validate this proposal, we implemented the tabu search strategy in the scope of an existing optimizer, which runs several search strategies. We focus our attention on the more difficult problems in terms of the query execution space, in which the solution space includes bushy execution plans and Cartesian products, which are not dealt with very often in the literature. Using a real-life application, we show the effectiveness of tabu search when compared to other strategies.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Aho, A.V. and J.D. Ullman. (1992). Foundations of Computer Science. New York: W.H. Freeman and Company.

    Google Scholar 

  • Andreatta, A.A. and C.C. Ribeiro. (1994). “A Graph Partitioning Heuristic for the Parallel Pseudo-Exhaustive Logical Test of VLSI Combinational Circuits.” Annals of Operations Research 50, 1–36.

    Google Scholar 

  • Battiti, R. and G. Tecchiolli. (1994). “The Reactive Tabu Search.” ORSA Journal on Computing 6, 126–140.

    Google Scholar 

  • de Amorim, S.G., J.-P. Barthelémy, and C.C. Ribeiro. (1992). “Clustering and Clique Partitioning: Simulated Annealing and Tabu Search Approaches.” Journal of Classification 9, 17–41.

    Google Scholar 

  • EDS Database Group: “EDS-Collaborating for a High-Performance Parallel Relational Database.” ESPRIT Conference, Brussels, 1990.

  • Friden, C., A. Hertz, and D. deWerra. (1989). “STABULUS: A Technique for Finding Stable Sets in Large Graphs with Tabu Search.” Computing 42, 35–44.

    Google Scholar 

  • Gardner, M. (1976). “Mathematical Games, Catalan Numbers: An Integer Sequence that Materializes in Unexpected Places.” Scientific American 234, 120–125.

    Google Scholar 

  • Glover, F. (1989). “Tabu Search. Part I.” ORSA Journal on Computing 1, 190–206.

    Google Scholar 

  • Glover, F. (1990a). “Tabu Search. Part II.” ORSA Journal on Computing 2, 4–32.

    Google Scholar 

  • Glover, F. (1990b). “Tabu Search: A Tutorial.” Interfaces 20, 74–94.

    Google Scholar 

  • Glover, F. (1995). “Tabu Search Fundamentals and Uses.”Working paper, University of Colorado, Graduate School of Business.

  • Glover, F. and M. Laguna. (1993). “Tabu Search.” Chapter 3 in C.R. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, pp. 70–150.

  • Glover, F., E. Taillard, and D. deWerra. (1993). “A User's Guide to Tabu Search.” Annals of Operations Research 41, 3–28.

    Google Scholar 

  • Hansen, P., M.V. Poggi de Aragão, and C.C. Ribeiro. (1990). “Boolean Query Optimization and the 0-1 Hyperbolic Sum Problem.” Annals of Mathematics and Artificial Intelligence 1, 97–109.

    Google Scholar 

  • Hansen, P., E.L. Pedrosa Filho, and C.C. Ribeiro. (1992). “Location and Sizing of Off-Shore Platforms for Oil Exploration.” European Journal of Operational Research 58, 202–214.

    Google Scholar 

  • Hertz, A. and D. deWerra. (1987). “Using Tabu Search Techniques for Graph Coloring.” Computing 29, 345–351.

    Google Scholar 

  • Hertz, A. and D. de Werra. (1990). “The Tabu Search Metaheuristic: How We Used it.” Annals of Mathematics and Artificial Intelligence 1, 111–121.

    Google Scholar 

  • Ibaraki, T. and T. Kameda. (1984). “On the Optimal Nesting Order for Computing N-Relational Joins.” ACM Transactions on Data Bases 9, 482–541.

    Google Scholar 

  • Ioannidis, Y.E. and E. Wong. (1987). “Query Optimization by Simulated Annealing.” Proceedings of the ACM SIGMOD International Conference on Management of Data, San Francisco, pp. 9–22.

  • Ioannidis, Y.E. and Y. Kang. (1991). “Left-deep vs. Bushy Trees: An Analysis of Strategy Spaces and Its Implications for Query Optimization.” Proceedings of the ACM SIGMOD International Conference on Management of Data.

  • Lanzelotte, R.S.G. and P. Valduriez. (1991). “Extending the Search Strategy in a Query Optimizer.” Proceedings of the 17th International Conference on Very Large Data Bases, Barcelona, pp. 363–373.

  • Lanzelotte, R.S.G., P. Valduriez, and M. Zaï t. (1992). “Optimization of Object-oriented Recursive Queries using Cost-Controlled Strategies.” Proceedings of the ACM SIGMOD International Conference on Management of Data, San Diego, pp. 256–265.

  • Lanzelotte, R.S.G., P. Valduriez, and M. Zaï t. (1993). “On the Effectiveness of Optimization Search Strategies.” In Proc. 19th Int. Conf. on Very Large Data Bases, Dublin, pp. 493–504.

  • Morzy, T., M. Matysiak, and S. Salza. (1994). “Tabu Search Optimization of Large Join Queries.” Proceedings of the Fourth International Conference on Extending Database Technology (EDBT'94), Cambridge, pp. 309–322.

  • Porto, S.C. and C.C. Ribeiro. (1995). “A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints.” International Journal of High Speed Computing 7, 45–71.

    Google Scholar 

  • Selinger, P.G., M.M. Astrahan, D.D. Chamberlin, R.A. Lorie, and T.G. Price. (1979). “Access Path Selection in a Relational Data Base System.” Proceedings of the ACM SIGMOD International Conference on Management of Data, Boston, pp. 23–34.

  • Skorin-Kapov, J. (1990). “Tabu Search Applied to the Quadratic Assignment Problem.” ORSA Journal on Computing 2, 33–45.

    Google Scholar 

  • Swami, A. (1989). “Optimization of Large Join Queries: Combining Heuristics and Combinatorial Techniques.” Proceedings of the ACM SIGMOD International Conference on Management of Data, Portland, pp. 367–376.

  • Widmer, M. and A. Hertz. (1989). “A New Approach for Solving the Flow Shop Sequencing Problem.” European Journal of Operational Research 41, 186–193.

    Google Scholar 

  • Woodruff, D.L. and E. Zemel. (1993). “Hashing Vectors for Tabu Search.” Annals of Operations Research 41, 123–137.

    Google Scholar 

  • Zaït, M. (1994). Optimisation de Requêtes Relationnelles pour Exécution Parallèle, Doctorate dissertation, Universit é de Paris VI.

Download references

Author information

Authors and Affiliations

  1. Departamento de Informática, Pontifícia Universidade Católica do Rio de Janeiro, Rua Marquês de São Vicente 225, Rio de Janeiro, 22453, Brazil

    Celso C. Ribeiro, Cláudio D. Ribeiro & Rosana S.G. Lanzelotte

Authors
  1. Celso C. Ribeiro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cláudio D. Ribeiro
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rosana S.G. Lanzelotte
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ribeiro, C.C., Ribeiro, C.D. & Lanzelotte, R.S. Query Optimization in Distributed Relational Databases. Journal of Heuristics 3, 5–23 (1997). https://doi.org/10.1023/A:1009670031749

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009670031749

Search

Navigation