Subsumption and complementation as data fusion operators

Advances in Database Technology - EDBT 2010 - 13th International Conference on Extending Database Technology, Proceedings

Volumn , Issue , 2010, Pages 513-524

  Bleiholder, Jens ^a   Szott, Sascha ^b   Herschel, Melanie ^c   Kaufer, Frank ^a   Naumann, Felix ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

^b ZUSE INSTITUTE BERLIN   (Germany)

^c UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

Complement union; Data integration; Data quality; Minimum union

Indexed keywords

BUILDING BLOCKES; COMPLEMENTATION; DATA INTEGRATION; DATA QUALITY; DATABASE QUERIES; EFFICIENT IMPLEMENTATION; OTHER APPLICATIONS; REAL WORLD DATA; REAL-WORLD OBJECTS; RELATIONAL DATABASE; RULE BASED; RUNTIMES;

DATA FUSION; DATABASE SYSTEMS; INFORMATION FUSION; OPTIMIZATION; SEMANTIC WEB; TECHNOLOGY;

DATA HANDLING;

EID: 77952255149     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1739041.1739103     Document Type: Conference Paper

References (30)

1. A. V. Aho, Y. Sagiv, and J. D. Ullman. Equivalences among relational expressions. SIAM Journal on Computing, 8(2):218-246, 1979.
2. J. Bleiholder and F. Naumann. Declarative data fusion - syntax, semantics, and implementation. In Proc. of ADBIS, pages 58-73, 2005.
3. J. Bleiholder and F. Naumann. Data fusion. ACM CSUR, 41(1):1-41, 2008.
4. J. Bleiholder, S. Szott, M. Herschel, and F. Naumann. Complement union for data integration. In Proc. of NTII, 2010.
5. C. Bron and J. Kerbosch. Algorithm 457: finding all cliques of an undirected graph. Commun. ACM, 16(9):575-577, 1973.
6. S. Cohen, I. Fadida, Y. Kanza, B. Kimelfeld, and Y. Sagiv. Full disjunctions: Polynomial-delay iterators in action. In Proc. of VLDB, pages 739-750, 2006.
7. S. Cohen and Y. Sagiv. An incremental algorithm for computing ranked full disjunctions. In Proc. of PODS, pages 98-107, New York, NY, USA, 2005. ACM Press.
8. A. K. Elmagarmid, P. G. Ipeirotis, and V. S. Verykios. Duplicate record detection: A survey. IEEE Trans. Knowl. Data Eng., 19(1):1-16, 2007.
9. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: Semantics and query answering. In Proc. of ICDT, pages 207-224, 2003.
10. A. Fuxman, E. Fazli, and R. J. Miller. ConQuer: efficient management of inconsistent databases. In Proc. of SIGMOD, pages 155-166, New York, NY, USA, 2005. ACM Press.
11. C. Galindo-Legaria and A. Rosenthal. Outerjoin simplification and reordering for query optimization. Trans. on Dat. Syst., 22(1):43-74, 1997.
12. C. A. Galindo-Legaria. Outerjoins as disjunctions. In Proc. of SIGMOD, pages 348-358. ACM Press, 1994.
13. S. Greco, L. Pontieri, and E. Zumpano. Integrating and managing conflicting data. In Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics, pages 349-362. Springer-Verlag, 2001.
14. M. A. Hernández, L. Popa, Y. Velegrakis, R. J. Miller, F. Naumann, and C.-T. Ho. Mapping XML and relational schemas with Clio. In Proc. of ICDE, pages 498-499, 2002.
15. P.-Å. Larson and J. Zhou. View matching for outer-join views. In Proc. of VLDB, pages 445-456, 2005.
16. K. Makino and T. Uno. New algorithms for enumerating all maximal cliques. In Proc. of SWAT, pages 260-272, 2004.
17. S. Melnik and H. Garcia-Molina. Adaptive algorithms for set containment joins. Trans. on Dat. Syst., 28(1):56-99, 2003.
18. N. Modani and K. Dey. Large maximal cliques enumeration in sparse graphs. In CIKM, pages 1377-1378, 2008.
19. A. Motro, P. Anokhin, and A. C. Acar. Utility-based resolution of data inconsistencies. In Proc. of IQIS Workshop, pages 35-43. ACM Press, 2004.
20. Y. Papakonstantinou, S. Abiteboul, and H. Garcia-Molina. Object fusion in mediator systems. In Proc. of VLDB, pages 413-424. Morgan Kaufmann Publishers Inc., 1996.
21. L. Popa, Y. Velegrakis, R. J. Miller, M. A. Hernández, and R. Fagin. Translating web data. In Proc. of VLDB, Hong Kong, 2002.
22. E. Rahm and P. A. Bernstein. A survey of approaches to automatic schema matching. VLDB J., 10(4):334-350, 2001.
23. A. Rajaraman and J. D. Ullman. Integrating information by outerjoins and full disjunctions (extended abstract). In Proc. of PODS, pages 238-248. ACM Press, 1996.
24. J. Rao, H. Pirahesh, and C. Zuzarte. Canonical abstraction for outerjoin optimization. In Proc. of SIGMOD, pages 671-682. ACM Press, 2004.
25. Y. Sagiv. Quadratic algorithms for minimizing joins in restricted relational expressions. SIAM J. Comput., 12(2):316-328, 1983.
26. E. Schallehn, K.-U. Sattler, and G. Saake. Efficient similarity-based operations for data integration. Data Knowl. Eng., 48(3):361-387, 2004.
27. V. Stix. Finding all maximal cliques in dynamic graphs. Comput. Optim. Appl., 27(2):173-186, 2004.
28. V. S. Subrahmanian, S. Adali, A. Brink, R. Emery, J. Lu, A. Rajput, T. Rogers, R. Ross, and C. Ward. Hermes: A heterogeneous reasoning and mediator system. Technical report, University of Maryland, 1995.
29. J. D. Ullman, H. Garcia-Molina, and J. Widom. Database Systems: The Complete Book. Prentice Hall PTR, 2001.
30. L. L. Yan and M. T. Özsu. Conflict tolerant queries in AURORA. In Proc. of CoopIS, page 279. IEEE Computer Society, 1999.