Data cleaning and query answering with matching dependencies and matching functions

ACM International Conference Proceeding Series

Volumn , Issue , 2011, Pages 268-279

  Bertossi, Leopoldo ^a   Kolahi, Solmaz ^b   Lakshmanan, Laks V S ^b  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Certain answer; Lattice; Matching dependency; Matching function; Possible answer; Semantic domination

Indexed keywords

CLEANING; DATABASE SYSTEMS; QUERY PROCESSING;

CERTAIN ANSWERS; DATA CLEANING; DATA ENTITIES; DATA QUERY; LATTICE; MATCHING DEPENDENCIES; MATCHING FUNCTIONS; POSSIBLE ANSWER; QUERY ANSWERING; SEMANTIC DOMINATION;

SEMANTICS;

EID: 79952344949     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1938551.1938585     Document Type: Conference Paper

References (31)

1. Abiteboul, S., Kanellakis, P.C., Grahne, G. On the Representation and Querying of Sets of Possible Worlds. Theoretical Computer Science, 1991, 78(1):158-187.
2. Afrati, F. and Kolaities, Ph. Answering Aggregate Queries in Data Exchange. In Proc. ACM PODS'08, 2008, pp. 129-138.
3. Arenas, M., Bertossi, L. and Chomicki, J. Consistent Query Answers in Inconsistent Databases. In Proc. ACM PODS'99, 1999, pp. 68-79.
4. Arenas, M., Bertossi, L. and Chomicki, J. Answer Sets for Consistent Query Answering in Inconsistent Databases. Theory and Practice of Logic Programming, 2003, 3(4-5):393-424.
5. Arenas, M., Bertossi, L., Chomicki, J., He, X., Raghavan, V. and Spinrad, J. Scalar Aggregation in Inconsistent Databases. Theoretical Computer Science, 2003, 296(3):405-434.
6. Bancilhon, F. and Khoshafian, S. A Calculus for Complex Objects. Journal of Computer ans Systems Sciences, 1989, 38(2):326-340.
7. Barcelo, P., Bertossi, L. and Bravo, L. Characterizing and Computing Semantically Correct Answers from Databases with Annotated Logic and Answer Sets. In Semantics in Databases, Springer LNCS 2582, 2003, pp. 7-33.
8. Benjelloun, O., Garcia-Molina, H., Menestrina, D., Su, Q., Euijong Whang, S. and Widom, J. Swoosh: A Generic Approach to Entity Resolution. VLDB Journal, 2009, 18(1):255-276.
9. Bertossi, L. Consistent Query Answering in Databases. ACM Sigmod Record, 2006, 35(2):68-76.
10. Bertossi, L., Kolahi, S. and Lakshmanan, L. Data Cleaning and Query Answering with Matching Dependencies and Matching Functions (full version). http://people.scs.carleton.ca/~bertossi/papers/matchingDC-full.pdf, 2010.
11. Bleiholder, J. and Naumann, F. Data Fusion. ACM Computing Surveys, 2008, 41(1).
12. Buneman, P., Jung, A. and Ohori, A. Using Powerdomains to Generalize Relational Databases. Theoretical Computer Science, 1991, 91(1):23-55.
13. Caniupan, M. and Bertossi, L. The Consistency Extractor System: Answer Set Programs for Consistent Query Answering in Databases. Data & Knowledge Engineering, 2010, 69(6):545-572.
14. Chomicki, J. Consistent Query Answering: Five Easy Pieces. Proc. ICDT 2007, Springer LNCS 4353, pp. 1-17.
15. Eiter, T., Fink, M., Greco, G. and Lembo, D. Repair Localization for Query Answering from Inconsistent Databases. ACM Transactions on Database Systems, 2008, 33(2).
16. Elmagarmid, A., Ipeirotis, P. and Verykios, V. Duplicate Record Detection: A Survey. IEEE Transactions in Knowledge and Data Engineering, 2007, 19(1):1-16. (Pubitemid 44955773)
17. Fan, W. Dependencies Revisited for Improving Data Quality. In Proc. ACM PODS'08, 2008, 159-170.
18. Fan, W., Jia, X., Li, J. and Ma, S. Reasoning about Record Matching Rules. PVLDB, 2009, 2(1):407-418.
19. Fuxman, A. and Miller, R. First-Order Query Rewriting for Inconsistent Databases. J. Computer and System Sciences., 2007, 73(4):610-635. (Pubitemid 46440977)
20. Gaasterland, T., Godfrey, P. and Minker, J. Relaxation as a Platform for Cooperative Answering. J. Intelligent Information Systems, 1992, 1(3/4):293-321.
21. Greco, G., Greco, S. and Zumpano, E. A Logical Framework for Querying and Repairing Inconsistent Databases. IEEE Transactions on Knowledge and Data Engineering, 2003, 15(6):1389-1408.
22. Gunter, C.A. and Scott, D.S. Semantic Domains. Chapter 12 in Handbook of Theoretical Computer Science, Vol. B. Elsevier, 1990.
23. Imielinski, T. and Lipski Jr., W. Incomplete Information in Relational Databases. Journal of the ACM, 1984, 31(4):761-791.
24. Jagadish, H., Mendelzon, A., and Milo, T. Similarity-Based Queries. Proc. ACM PODS'95, 2005, pp. 36-45.
25. Kifer, M. and Lausen, G. F-Logic: A Higher-Order language for Reasoning about Objects, Inheritance, and Scheme. In Proc. SIGMOD'89, 1989, pp. 134-146.
26. Koudas, N., Li, Ch., Tung, A. and Vernica. R. Relaxing Join and Selection Queries. In Proc. VLDB'06, 2006, pp. 199-210.
27. Levene, M. and Loizou, G. Database Design of Incomplete Relations. ACM Transactions on Database Systems, 1999, 24:35-68.
28. Libkin, L. A Semantics-Based Approach to Design of Query Languages for Partial Information. In Semantics in Databases, 1998, Springer LNCS 1358, pp. 170-208.
29. Libkin, L. Data Exchange and Incomplete Information. In Proc. ACM PODS'06, 2006, pp. 60-69. (Pubitemid 46946467)
30. Lipski Jr., W. On Semantic Issues Connected with Incomplete Information Databases. ACM Transactions on Database Systems, 1979, 4(3):262-296. (Pubitemid 10410577)
31. Ng, W., Levene, M. and Fenner, T. On the Expressive Power of the Relational Algebra with Partially Ordered Domains. International Journal of Computer Mathematics, 2000, 71:53-62.