Increasing the Efficiency of Minimal Key Enumeration Methods by Means of Parallelism

Fernando Benito Picazo, Pablo Cordero, Manuel Enciso, Ángel Mora

2014

Abstract

Finding all minimal keys in a table is a hard problem but also provides a lot of benefits in database design and optimization. Some of the methods proposed in the literature are based on logic and, more specifically on tableaux paradigm. The size of the problems such methods deal with is strongly limited, which implies that they cannot be applied to big database schemas. We have carried out an experimental analysis to compare the results obtained by these methods in order to estimate their limits. Although tableaux paradigm may be viewed as a search space guiding the key finding task, none of the previous algorithms have incorporated parallelism. In this work, we have developed two different versions of the algorithms, a sequential and a parallel one, stating clearly how parallelism could naturally be integrated and the benefits we get over efficiency. This work has also guided future work guidelines to improve future designs of these methods.

References

  1. Appice, A., Ceci, M., Turi, A., and Malerba, D. (2011). A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets. Intell. Data Anal., 15(1):69-88.
  2. Armstrong, W. W. (1974). Dependency structures of data base relationships. In IFIP Congress, pages 580-583.
  3. Cordero, P., Enciso, M., and Mora, A. (2013). Automated reasoning to infer all minimal keys. In Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI'13, pages 817-823. AAAI Press.
  4. Elmasri, R. and Navathe, S. (2010). Fundamentals of Database Systems. Prentice Hall International, 6 edition.
  5. Fayyad, U., Piatetsky-Shapiro, G., and Smyth, P. (1996). From data mining to knowledge discovery in databases. AI Magazine, pages 37-54.
  6. Huhtala, Y., Krkkinen, J., Porkka, P., and Toivonen, H. (1999). Tane: An efficient algorithm for discovering functional and approximate dependencies. Comput. J., 42(2):100-111.
  7. Kemper, A. and Moerkotte, G. (1991). Query optimization in object bases: Exploiting relational techniques. In Query Processing for Advanced Database Systems, Dagstuhl, pages 63-98. Morgan Kaufmann.
  8. Lucchesi, C. L. and Osborn, S. L. (1978). Candidate keys for relations. J. Comput. Syst. Sci., 17(2):270-279.
  9. Manolopoulos, Y., Theodoridis, Y., and Tsotras, V. J. (1999). Advanced Database Indexing, volume 17 of Advances in Database Systems. Kluwer.
  10. Morgan, C. G. (1992). An automated theorem prover for relational logic (abstract). In Fronhfer, B., Hhnle, R., and Kufl, T., editors, TABLEAUX, pages 56-58.
  11. Saiedian, H. and Spencer, T. (1996). An efficient algorithm to compute the candidate keys of a relational database schema. Comput. J., 39(2):124-132.
  12. Simsion, G. C. and Witt, G. C. (2005). Data modeling essentials. Amsterdam; Boston, 3rd edition.
  13. Wastl, R. (1998a). Linear derivations for keys of a database relation schema. J. UCS, 4(11):883-897.
  14. Wastl, R. (1998b). On the number of keys of a relational database schema. Journal of Universal Computer Science, 4.
  15. Yu, C. T. and Johnson, D. T. (1976). On the complexity of finding the set of candidate keys for a given set of functional dependencies. Inf. Process. Lett., 5(4):100- 101.
  16. Zhang, Y. (2009). Determining all candidate keys based on karnaugh map. IEEE International Conference on Information Management, Innovation Management and Industrial Engineering, 04:226-229.
Download


Paper Citation


in Harvard Style

Benito Picazo F., Cordero P., Enciso M. and Mora Á. (2014). Increasing the Efficiency of Minimal Key Enumeration Methods by Means of Parallelism . In Proceedings of the 9th International Conference on Software Engineering and Applications - Volume 1: ICSOFT-EA, (ICSOFT 2014) ISBN 978-989-758-036-9, pages 512-517. DOI: 10.5220/0005108205120517


in Bibtex Style

@conference{icsoft-ea14,
author={Fernando Benito Picazo and Pablo Cordero and Manuel Enciso and Ángel Mora},
title={Increasing the Efficiency of Minimal Key Enumeration Methods by Means of Parallelism},
booktitle={Proceedings of the 9th International Conference on Software Engineering and Applications - Volume 1: ICSOFT-EA, (ICSOFT 2014)},
year={2014},
pages={512-517},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005108205120517},
isbn={978-989-758-036-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 9th International Conference on Software Engineering and Applications - Volume 1: ICSOFT-EA, (ICSOFT 2014)
TI - Increasing the Efficiency of Minimal Key Enumeration Methods by Means of Parallelism
SN - 978-989-758-036-9
AU - Benito Picazo F.
AU - Cordero P.
AU - Enciso M.
AU - Mora Á.
PY - 2014
SP - 512
EP - 517
DO - 10.5220/0005108205120517