Describing differences between databases

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2006, Pages 612-621

  Müller, Heiko ^a   Freytag, Johann Christoph ^a   Leser, Ulf ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Conflict resolution; Contradicting databases; Update distance

Indexed keywords

COMPUTATIONAL METHODS; DATA STRUCTURES; HEURISTIC METHODS; KNOWLEDGE REPRESENTATION; PROBLEM SOLVING; SYSTEMATIC ERRORS;

CONCISE REPRESENTATION; CONFLICT RESOLUTION; SET ORIENTED UPDATE OPERATIONS;

RELATIONAL DATABASE SYSTEMS;

EID: 34547645412     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1183614.1183702     Document Type: Conference Paper

References (23)

1. M. Arenas, L. Bertossi, J. Chomicki. Consistent Query Answers in Inconsistent Databases.Proc. ACM Symposium on Principles of Database Systems (PODS), Philadelphia, Pennsylvania, 1999.
2. R. Agrawal and R. Srikant. Fast Algorithms for Mining Association Rules,Proc. Int. Conf. On Very Large Data Bases (VLDB), Santiago de Chile, Chile, 1994.
3. J. Bayardo, Jr. Efficiently mining long patterns from databases.Proc. ACM SIGMOD Int. Conf. on Management of Data, Seattle, Washington, United States, 1998, 85 - 89.
4. H.M.Berman, J.Westbrook, Z. Feng, G. Gilliland, T.N. Bhat, H. Weissig, I.N. Shindyalov, P.E. Bourne. The Protein Data Bank.Nucleic Acids Research, Vol. 28(1), 2000, 235-242.
5. T.N. Bhat, et al. The PDB data uniformity project,Nucleic Acid Research, Vol. 29(1), 2001, 214-218.
6. H. Boutselakis, et al. E-MSD: the European Bioinformatics Institute Macromolecular Structure Database.Nucleic Acid Research, Vol. 31(1), 2003, 458-462.
7. P. Bohannon, W. Fan, M. Flaster, and R. Rastogi. A Cost-Based Model and Effective Heuristic for Repairung Constraints by Value Modifications. Proc. ACM SIGMOD Int. Conf. on Management of Data, Baltimore, Maryland, United States, 2005.
8. S. Chawathe, H. Garcia-Molina. Meaningful change detection in structured data.Proc. ACM SIGMOD Int. Conf. on Management of Data Tucson, Arizona, May 1997.
9. G. Cong, A.K.H. Tung, X. Xu, F. Pan, and J. Yang. FARMER: finding interesting rule groups in microarray datasets.Proc. ACM SIGMOD Int. Conf. on Management of Data, Paris, France, 2004, 143 - 154.
10. P. Dadam, V.Y. Lum, H.-D. Werner. Integration of Time Versions into a Relational Database System.Proc. Int. Conf. on Very Large Data Bases, Singapore, 1984, p.p. 509-522.
11. W. Fan, H. Lu, S.E. Madnick, and D. Cheung. Discovering and reconciling value conflicts for numerical data integration.Information Systems, Vol. 26, 2001, 635-656.
12. M.A. Hernandez, S.J. Stolfo. The merge/purge problem for large databases.Proc of ACM SIGMOD Int. Conf. On Management of Data, San Jose, California, 1995.
13. W. J. Labio and H. Garcia-Molina. Efficient Snapshot Differential Algorithms for Data Warehousing.Proc. Int. Conf. On Very Large Data Bases (VLDB), Bombay, India, September 1996, pp. 63-74.
14. V.I. Levenshtein. Binary codes capable of correcting insertions and reversals.Sov. Phys. Dokl., 10:707-10, 1966.
15. A.E. Monge, C.P. Elkan. An efficient domain-independent algorithm for detecting approximately duplicate database tuples.Proc. SIGMOD Workshop on Data Mining and Knowledge Discovery, 1997.
16. H. Müller, U. Leser, and J.-C Freytag. Mining for Patterns in Contradictory Data,Proc. SIGMOD Int. Workshop on Information Quality for Information Systems (IQIS'04), Paris, France, 2004.
17. H. Müller, J.-C. Freytag, and U. Leser. On the Distance of Databases,Technical Report, HUB-IB-199, March 2006.
18. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering Frequent Closed Itemsets for Association Rules.Lecture Notes in Computer Science, Vol. 1540, 1999, 398-416.
19. K Rother, H. Müller, S. Trissl, I. Koch, T. Steinke, R. Preissner, C Frömmel, U. Leser. COLUMBA: Multidimensional Data Integration of Protein Annotations,Int. Workshop on Data Integration in Life Sciences (DILS 2004), Leipzig, Germany, 2004.
20. G. Vossen. Data Models, Database Languages and Database Management Systems.Addison-Wesley Publishers, ISBN 0-201-41604-2, 1991.
21. J. Wang, J. Han, and J. Pei. CLOSET+: searching for the best strategies for mining frequent closed itemsets.Proc. ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, Washington, D.C., 2003, 236 - 245.
22. W. Winkler. The state of record linkage and current research problems.Technical report, Statistical Research Division, U.S. Bureau of the Census, Washington, DC, 1999.
23. M.J. Zaki and C.-J. Hsiao. CHARM: An efficient algorithm for closed itemset mining.In Proc. of the Second SIAM Int. Conference on Data Mining, Arlington, VA, 2002.