Skip to main content
SpringerLink
Log in

Tractable Cases of Clean Query Answering under Entity Resolution via Matching Dependencies

  • Conference paper
Scalable Uncertainty Management (SUM 2012)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7520))

Included in the following conference series:

Abstract

Matching Dependencies (MDs) are a recent proposal for declarative entity resolution. They are rules that specify, given the similarities satisfied by values in a database, what values should be considered duplicates, and have to be matched. On the basis of a chase-like procedure for MD enforcement, we can obtain clean (duplicate-free) instances; possibly several of them. The clean answers to queries (which we call the resolved answers) are invariant under the resulting class of instances. Identifying the clean versions of a given instance is generally an intractable problem. In this paper, we show that for a certain class of MDs, the characterization of the clean instances is straightforward. This is an important result, because it leads to tractable cases of resolved query answering. Further tractable cases are derived by making connections with tractable cases of CQA.

Research supported by the NSERC Strategic Network on Business Intelligence (BIN ADC05) and NSERC/IBM CRDPJ/371084-2008.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)

    Google Scholar 

  2. Afrati, F., Kolaitis, P.: Repair checking in inconsistent databases: Algorithms and complexity. In: Proc. ICDT, pp. 31–41. ACM Press (2009)

    Google Scholar 

  3. Arenas, M., Bertossi, L., Chomicki, J.: Consistent query answers in inconsistent databases. In: Proc. PODS, pp. 68–79. ACM Press (1999)

    Google Scholar 

  4. Bahmani, Z., Bertossi, L., Kolahi, S., Lakshmanan, L.: Declarative entity resolution via matching dependencies and answer set programs. In: Proc. KR, pp. 380–390. AAAI Press (2012)

    Google Scholar 

  5. Barcelo, P.: Logical foundations of relational data exchange. SIGMOD Record 38(1), 49–58 (2009)

    Article  Google Scholar 

  6. Benjelloun, O., Garcia-Molina, H., Menestrina, D., Su, Q., Euijong Whang, S., Widom, J.: Swoosh: A generic approach to entity resolution. VLDB Journal 18(1), 255–276 (2009)

    Article  Google Scholar 

  7. Bertossi, L.: Consistent query answering in databases. ACM Sigmod Record 35(2), 68–76 (2006)

    Article  Google Scholar 

  8. Bertossi, L.: Database Repairing and Consistent Query Answering. Synthesis Lectures on Data Management. Morgan & Claypool (2011)

    Google Scholar 

  9. Bertossi, L., Bravo, L.: Consistent Query Answers in Virtual Data Integration Systems. In: Bertossi, L., Hunter, A., Schaub, T. (eds.) Inconsistency Tolerance. LNCS, vol. 3300, pp. 42–83. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Bertossi, L., Bravo, L., Franconi, E., Lopatenko, A.: The complexity and approximation of fixing numerical attributes in databases under integrity constraints. Information Systems 33(4), 407–434 (2008)

    Article  Google Scholar 

  11. Bertossi, L., Kolahi, S., Lakshmanan, L.: Data cleaning and query answering with matching dependencies and matching functions. In: Proc. ICDT. ACM Press (2011)

    Google Scholar 

  12. Bertossi, L., Kolahi, S., Lakshmanan, L.: Data cleaning and query answering with matching dependencies and matching functions. Theory of Computing Systems (2012), doi: 10.1007/s00224-012-9402-7

    Google Scholar 

  13. Bleiholder, J., Naumann, F.: Data fusion. ACM Computing Surveys 41(1), 1–41 (2008)

    Article  Google Scholar 

  14. Chomicki, J.: Consistent Query Answering: Five Easy Pieces. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 1–17. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Chomicki, J., Marcinkowski, J.: Minimal-change integrity maintenance using tuple deletions. Information and Computation 197(1/2), 90–121 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  16. Elmagarmid, A., Ipeirotis, P., Verykios, V.: Duplicate record detection: A survey. IEEE Trans. Knowledge and Data Eng. 19(1), 1–16 (2007)

    Article  Google Scholar 

  17. Fan, W.: Dependencies revisited for improving data quality. In: Proc. PODS, pp. 159–170. ACM Press (2008)

    Google Scholar 

  18. Fan, W., Jia, X., Li, J., Ma, S.: Reasoning about record matching rules. In: Proc. VLDB, pp. 407–418 (2009)

    Google Scholar 

  19. Flesca, S., Furfaro, F., Parisi, F.: Querying and repairing inconsistent numerical databases. ACM Trans. Database Syst. 35(2) (2010)

    Google Scholar 

  20. Franconi, E., Palma, A.L., Leone, N., Perri, S., Scarcello, F.: Census Data Repair: A Challenging Application of Disjunctive Logic Programming. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 561–578. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  21. Fuxman, A., Miller, R.: First-order query rewriting for inconsistent databases. J. Computer and System Sciences 73(4), 610–635 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  22. Gardezi, J., Bertossi, L.: Query answering under matching dependencies for data cleaning: Complexity and algorithms. arXiv:1112.5908v1

    Google Scholar 

  23. Gardezi, J., Bertossi, L., Kiringa, I.: Matching dependencies with arbitrary attribute values: semantics, query answering and integrity constraints. In: Proc. Int. WS on Logic in Databases (LID 2011), pp. 23–30. ACM Press (2011)

    Google Scholar 

  24. Gardezi, J., Bertossi, L., Kiringa, I.: Matching dependencies: semantics, query answering and integrity constraints. Frontiers of Computer Science 6(3), 278–292 (2012)

    MathSciNet  Google Scholar 

  25. Lenzerini, M.: Data integration: a theoretical perspective. In: Proc. PODS 2002, pp. 233–246 (2002)

    Google Scholar 

  26. Libkin, L.: Elements of Finite Model Theory. Springer (2004)

    Google Scholar 

  27. Lopatenko, A., Bertossi, L.: Complexity of Consistent Query Answering in Databases Under Cardinality-Based and Incremental Repair Semantics. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 179–193. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  28. Vianu, V.: Dynamic functional dependencies and database aging. J. ACM 34(1), 28–59 (1987)

    Article  MathSciNet  Google Scholar 

  29. Wijsen, J.: Database repairing using updates. ACM Trans. Database Systems 30(3), 722–768 (2005)

    Article  Google Scholar 

  30. Wijsen, J.: On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases. In: Proc. PODS, pp. 179–190. ACM Press (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SITE, University of Ottawa, Ottawa, Canada

    Jaffer Gardezi

  2. SCS, Carleton University, Ottawa, Canada

    Leopoldo Bertossi

Authors
  1. Jaffer Gardezi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leopoldo Bertossi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, Marburg University, Hans-Meerwein-Strasse 6, 35032, Marburg, Germany

    Eyke Hüllermeier , Thomas Fober  & Bernhard Seeger ,  & 

  2. Department of Computer Science, Auckland University, 38 Princes St., 1010, Auckland, New Zealand

    Sebastian Link

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gardezi, J., Bertossi, L. (2012). Tractable Cases of Clean Query Answering under Entity Resolution via Matching Dependencies. In: Hüllermeier, E., Link, S., Fober, T., Seeger, B. (eds) Scalable Uncertainty Management. SUM 2012. Lecture Notes in Computer Science(), vol 7520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33362-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33362-0_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33361-3

  • Online ISBN: 978-3-642-33362-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation