Estimating the confidence of Conditional functional dependencies

SIGMOD-PODS'09 - Proceedings of the International Conference on Management of Data and 28th Symposium on Principles of Database Systems

Volumn , Issue , 2009, Pages 469-482

  Cormode, Graham ^a   McGregor, Andrew ^b   Golab, Lukasz ^a   Srivastava, Divesh ^a   Korn, Flip ^a   Zhang, Xi ^c  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF MASSACHUSETTS   (United States)

^c UNIVERSITY AT BUFFALO   (United States)

Author keywords

Conditional functional dependencies

Indexed keywords

ADDITIVE ERRORS; DATA QUALITY; DATA SEMANTICS; FUNCTIONAL DEPENDENCY; RANDOM SAMPLE; RELATIVE ERRORS; SUPPORT AND CONFIDENCE; SYNTHETIC DATA;

COMPUTER SCIENCE;

DATABASE SYSTEMS;

EID: 70849101505     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1559845.1559895     Document Type: Conference Paper

References (27)

1. M. Arlitt and T. Jin. 1998 world cup web site access logs. http://www.acm.org/sigcomm/ITA/, 1998.
2. L. Bhuvanagiri, S. Ganguly, D. Kesh, and C. Saha. Simpler algorithm for estimating frequency moments of data streams. In ACM-SIAM Symposium on Discrete Algorithms, 2006.
3. L. Bravo, W. Fan, F. Geerts, and S. Ma. Increasing the expressivity of conditional functional dependencies without extra complexity. In IEEE International Conference on Data Engineering, 2008.
4. L. Bravo, W. Fan, and S. Ma. Extending dependencies with conditions. In International Conference on Very Large Data Bases, 2007.
5. A. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher. Min-wise independent permutations. In ACM Symposium on Theory of Computing, 1998.
6. Joshua Brody and Amit Chakrabarti. A multi-round communication lower bound for gap hamming and some consequences. CoRR, abs/0902.2399, 2009.
7. P. Brown and P. Haas. BHUNT: Automatic discovery of fuzzy algebraic constraints in relational data. In International Conference on Very Large Data Bases, 2003.
8. P. Brown and P. Haas. Techniques for warehousing of sample data. In IEEE International Conference on Data Engineering, 2006.
9. B. Chen, P. Haas, and P. Scheuermann. A new two-phase sampling based algorithm for discovering association rules. In ACM SIGKDD, 2002.
10. F. Chiang and R. Miller. Discovering data quality rules. In International Conference on Very Large Data Bases, 2008.
11. G. Cong, W. Fan, F. Geerts, X. Jia, and S. Ma. Improving data quality: Consistency and accuracy. In International Conference on Very Large Data Bases, 2007.
12. G. Cormode and S. Muthukrishnan. Space efficient mining of multigraph streams. In ACM Principles of Database Systems, 2005.
13. G. Cormode and S. Muthukrishnan. Summarizing and mining skewed data streams. In SIAM Conference on Data Mining, 2005.
14. W. Fan, F. Geerts, X. Jia, and A. Kementsietsidis. Conditional functional dependencies for capturing data inconsistencies. ACM Trans. Database Syst., 33(2), 2008.
15. W. Fan, F. Geerts, L. Lakshmanan, and M. Xiong. Discovering conditional functional dependencies. In IEEE International Conference on Data Engineering, 2009.
16. W. Fan, S. Ma, Y. Hu, J. Liu, and Y. Wu. Propagating functional dependencies with conditions. In International Conference on Very Large Data Bases, 2008.
17. R. Gemulla, W. Lehner, and P. Haas. A dip in the reservoir: Maintaining sample synopses of evolving datasets. In International Conference on Very Large Data Bases, 2006.
18. Lukasz Golab, Howard Karloff, Flip Korn, Divesh Srivastava, and Bei Yu. On generating near-optimal tableaux for conditional functional dependencies. In International Conference on Very Large Data Bases, 2008.
19. Y. Huhtala, J. Karkkainen, P. Porkka, and H. Toivonen. TANE: An efficient algorithm for discovering functional and approximate dependencies. The Computer Journal, 42(2):100-111, 1999.
20. I. Ilyas, V. Markl, P. Haas, P. Brown, and A. Aboulnaga. CORDS: Automatic discovery of correlations and soft functional dependencies. In ACM SIGMOD International Conference on Management of Data, 2004.
21. T. S. Jayram, Ravi Kumar, and D. Sivakumar. The one-way communication complexity of hamming distance. Theory of Computing, 4(1):129-135, 2008.
22. J. Kivenen and H. Mannila. The power of sampling in knowledge discovery. In ACM Principles of Database Systems, 1994.
23. J. Kivinen and H. Mannila. Approximate inference of functional dependencies from relations. Theor. Comput. Sci., 149(1), 1995.
24. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
25. A. Metwally, D. Agrawal, and A. El Abbadi. Efficient computation of frequent and top-k elements in data streams. In International Conference on Database Theory, 2005.
26. H. Toivonen. Sampling large databases for association rules. In International Conference on Very Large Data Bases, 1996.
27. J. S. Vitter. Random sampling with a reservoir. ACM Transactions on Mathematical Software, 11(1):37-57, March 1985.