Scalable discovery of unique column combinations

Proceedings of the VLDB Endowment

Volumn 7, Issue 4, 2013, Pages 301-312

  Heise, Arvid ^a   Quiané Ruiz, JorgeArnulfo ^b   Abedjan, Ziawasch ^a   Jentzsch, Anja ^a   Naumann, Felix ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

^b QATAR COMPUTING RESEARCH INSTITUTE   (Qatar)

Author keywords

[No Author keywords available]

Indexed keywords

ANOMALY DETECTION; INFORMATION MANAGEMENT; NP-HARD; SCALABILITY;

COLUMN COMBINATIONS; DUPLICATE DETECTION; EXPONENTIAL NUMBERS; GRAPH COLORING PROBLEM; HYBRID COLUMNS; ORDERS OF MAGNITUDE; PRUNING TECHNIQUES; QUERY OPTIMIZATION;

DATA INTEGRATION;

EID: 84896995312     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2732240.2732248     Document Type: Conference Paper

References (27)

1. Z. Abedjan and F. Naumann. Advancing the discovery of unique column combinations. In Proceedings of the International Conference on Information and Knowledge Management (CIKM), pages 1565-1570, 2011.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proceedings of the International Conference on Very Large Databases (VLDB), pages 487-499, 1994.
3. J. Bauckmann, Z. Abedjan, U. Leser, H. Müller, and F. Naumann. Discovering conditional inclusion dependencies. In Proceedings of the International Conference on Information and Knowledge Management (CIKM), pages 2094-2098, 2012.
4. J. Bauckmann, U. Leser, F. Naumann, and V. Tietz. Effciently detecting inclusion dependencies. In Proceedings of the International Conference on Data Engineering (ICDE), pages 1448-1450, 2007.
5. L. Bravo, W. Fan, and S. Ma. Extending dependencies with conditions. In Proceedings of the International Conference on Very Large Databases (VLDB), pages 243-254, 2007.
6. P. G. Brown and P. J. Haas. BHUNT: Automatic discovery of fuzzy algebraic constraints in relational data. In Proceedings of the International Conference on Very Large Databases (VLDB), pages 668-679, 2003.
7. G. Cormode, L. Golab, K. Flip, A. McGregor, D. Srivastava, and X. Zhang. Estimating the confidence of conditional functional dependencies. In Proceedings of the International Conference on Management of Data (SIGMOD), pages 469-482, 2009.
8. W. Fan. Dependencies revisited for improving data quality. In Proceedings of the Symposium on Principles of Database Systems (PODS), pages 159-170, 2008.
9. W. Fan, F. Geerts, J. Li, and M. Xiong. Discovering conditional functional dependencies. IEEE Transactions on Knowledge and Data Engineering (TKDE), 23(5):683-698, 2011.
10. C. Giannella and C. Wyss. Finding minimal keys in a relation instance. http://citeseerx.ist.psu.edu/viewdoc/ summary?doi=10.1.1.41.7086, 1999. Technical report. Last accessed on 2013-02-21.
11. C. Goble and R. Stevens. State of the nation in data integration for bioinformatics. J. of Biomedical Informatics, 41(5):687-693, 2008.
12. L. Golab, H. Karloff, F. Korn, D. Srivastava, and B. Yu. On generating near-optimal tableaux for conditional functional dependencies. Proceedings of the VLDB Endowment (PVLDB), 1(1):376-390, 2008.
13. G. Grahne and J. Zhu. Discovering approximate keys in XML data. In Proceedings of the International Conference on Information and Knowledge Management (CIKM), pages 453-460, 2002.
14. D. Gunopulos, R. Khardon, H. Mannila, and R. S. Sharma. Discovering all most specific sentences. ACM Transactions on Database Systems (TODS), 28:140-174, 2003.
15. Y. Huhtala, J. Kaerkkaeinen, P. Porkka, and H. Toivonen. Effcient discovery of functional and approximate dependencies using partitions. In Proceedings of the International Conference on Database Theory (ICDT), pages 392-401, 1998.
16. Y. Huhtala, J. Kaerkkaeinen, P. Porkka, and H. Toivonen. TANE: an effcient algorithm for discovering functional and approximate dependencies. The Computer Journal, 42(2):100-111, 1999.
17. IBM InfoSphere Information Analyzer. http://www-01.ibm.com/software/data/ infosphere/information-analyzer.
18. I. F. Ilyas, V. Markl, P. Haas, P. Brown, and A. Aboulnaga. CORDS: automatic discovery of correlations and soft functional dependencies. In Proceedings of the International Conference on Management of Data (SIGMOD), pages 647-658, 2004.
19. M. Kantola, H. Mannila, K.J. Rih, and H. Siirtola. Discovering functional and inclusion dependencies in relational databases. International Journal of Intelligent Systems, 12:591-607, 1992.
20. Z. Lacroix and T. Critchlow. Bioinformatics: managing scientific data. Morgan Kaufmann, Burlington, MA, 2003.
21. F. D. Marchi, S. Lopes, and J.M. Petit. Unary and n-ary inclusion dependency discovery in relational databases. Journal of Intelligent Information Systems, 32(1):53-73, 2009.
22. Microsoft Data Profiling Task, 03/2013. http://msdn. microsoft.com/en-us/library/bb895263.aspx.
23. Oracle 11g Data Profiling. http://www.oracle.com/technetwork/middleware/ data-integration/index-082810.html.
24. H. Saiedian and T. Spencer. An effcient algorithm to compute the candidate keys of a relational database schema. The Computer Journal, 39(2):124-132, 1996.
25. Y. Sismanis, P. Brown, P. J. Haas, and B. Reinwald. Gordian: effcient and scalable discovery of composite keys. In Proceedings of the International Conference on Very Large Databases (VLDB), pages 691-702, 2006.
26. M. Stonebraker, S. Madden, D. J. Abadi, S. Harizopoulos, N. Hachem, and P. Helland. The end of an architectural era (it's time for a complete rewrite). In Proceedings of the International Conference on Very Large Databases (VLDB), pages 1150-1160, 2007.
27. M. Zhang, M. Hadjieleftheriou, B. C. Ooi, C. M. Procopiuc, and D. Srivastava. On multi-column foreign key discovery. Proceedings of the VLDB Endowment (PVLDB), 3(1-2):805-814, 2010.