Automata Theory based Approach to the Join Ordering Problem in Relational Database Systems

Miguel Rodríguez, Daladier Jabba, Elias Niño, Carlos Ardila, Yi-Cheng Tu

Abstract

.

References

  1. Bennett, K., Ferris, M. C. and Ioannidis, Y. E., 1991. A genetic algorithm for database query optimization. Computer Sciences Department, University of Wisconsin, Center for Parallel Optimization.
  2. Chaudhuri, S., 1998. An overview of query optimization in relational systems, Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems 1998, ACM, pp. 34-43.
  3. Holland, J. H., 1992. Genetic algorithms. Scientific American, 267(1), pp. 66-72.
  4. Ioannidis, Y. E. and Wong, E., 1987. Query optimization by simulated annealing. ACM.
  5. Ioannidis, Y. E. and Kang, Y. C., 1991. Left-deep vs. bushy trees: an analysis of strategy spaces and its implications for query optimization, Proceedings of the 1991 ACM SIGMOD international conference on Management of data 1991, ACM, pp. 168-177.
  6. Kadkhodaei, H. and Mahmoudi, F., 2011. A combination method for join ordering problem in relational databases using genetic algorithm and ant colony, Granular Computing (GrC), 2011 IEEE International Conference on 2011, IEEE, pp. 312-317.
  7. Li, N., Liu, Y., Dong, Y. and Gu, J., 2008. Application of Ant Colony Optimization Algorithm to Multi-Join Query Optimization. Advances in Computation and Intelligence, pp. 189-197.
  8. Muntes-Mulero, V., Zuzarte, C. and Markl, V., 2006. An inside analysis of a genetic-programming based optimizer, Database Engineering and Applications Symposium, 2006. IDEAS'06. 10th International 2006, IEEE, pp. 249-255.
  9. Niño, E. D. and Ardila, C. J., 2009. Algorithm based on finite automata for obtaining global optimum combinatorial problems. Ingeniería y Desarrollo, (25), pp. 99-114.
  10. Niño, E. D., Ardila, C. J., Jabba, D. and Donoso, Y., 2010. A novel Algorithm based on Deterministic Finite Automaton for solving the mono-objective Symmetric Traveling Salesman Problem. International Journal of Artificial Intelligence, 5(A10), pp. 101-108.
  11. Poess, M., Nambiar, R. O. and Walrath, D., 2007. Why you should run TPC-DS: a workload analysis, Proceedings of the 33rd international conference on Very large data bases 2007, VLDB Endowment, pp. 1138-1149.
  12. Steinbrunn, M., Moerkotte, G. and Kemper, A., 1997. Heuristic and randomized optimization for the join ordering problem. the VLDB Journal, 6(3), pp. 191- 208.
  13. Swami, A. and Gupta, A., 1988. Optimization of large join queries. ACM.
  14. Zhou, Y., Wan, W. and Liu, J., 2009. Multi-joint query optimization of database based on the integration of best-worst Ant Algorithm and Genetic Algorithm, Wireless Mobile and Computing (CCWMC 2009), IET International Communication Conference on 2009, IET, pp. 543-546.
Download


Paper Citation


in Harvard Style

Rodríguez M., Jabba D., Niño E., Ardila C. and Tu Y. (2013). Automata Theory based Approach to the Join Ordering Problem in Relational Database Systems . In Proceedings of the 2nd International Conference on Data Technologies and Applications - Volume 1: DATA, ISBN 978-989-8565-67-9, pages 257-265. DOI: 10.5220/0004433802570265


in Bibtex Style

@conference{data13,
author={Miguel Rodríguez and Daladier Jabba and Elias Niño and Carlos Ardila and Yi-Cheng Tu},
title={Automata Theory based Approach to the Join Ordering Problem in Relational Database Systems},
booktitle={Proceedings of the 2nd International Conference on Data Technologies and Applications - Volume 1: DATA,},
year={2013},
pages={257-265},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004433802570265},
isbn={978-989-8565-67-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 2nd International Conference on Data Technologies and Applications - Volume 1: DATA,
TI - Automata Theory based Approach to the Join Ordering Problem in Relational Database Systems
SN - 978-989-8565-67-9
AU - Rodríguez M.
AU - Jabba D.
AU - Niño E.
AU - Ardila C.
AU - Tu Y.
PY - 2013
SP - 257
EP - 265
DO - 10.5220/0004433802570265