NDLI: Data cleaning and query answering with matching dependencies and matching functions

Please wait, while we are loading the content...

Tractability in probabilistic databases

The PADS project: an overview

Efficient reasoning about data trees via integer linear programming

Querying probabilistic business processes for sub-flows

Relaxed notions of schema mapping equivalence revisited

On the equivalence of distributed systems with queries and communication

Knowledge compilation meets database theory: compiling queries to decision diagrams

Relative expressive power of navigational querying on graphs

Faster query answering in probabilistic databases using read-once functions

On provenance and privacy

Generating, sampling and counting subclasses of regular tree languages

Artifact systems with data dependencies and arithmetic

Solutions in XML data exchange

Two-variable logic and key constraints on data words

On the optimal approximation of queries using tractable propositional languages

Complexity of higher-order queries

The complexity of evaluating tuple generating dependencies

View update translation for XML

Comparing workflow specification languages: a matter of views

Simplifying schema mappings

Satisfiability algorithms for conjunctive queries over trees

(Approximate) uncertain skylines

Conjunctive queries determinacy and rewriting

Detecting and exploiting near-sortedness for efficient relational query evaluation

Data cleaning and query answering with matching dependencies and matching functions

Data cleaning and query answering with matching dependencies and matching functions

Content Provider	ACM Digital Library
Author	Lakshmanan, Laks V. S. Kolahi, Solmaz Bertossi, Leopoldo
Abstract	Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the values of some attributes for two tuples, provided that the values of some other attributes are sufficiently similar. Assuming the existence of matching functions for making two attributes values equal, we formally introduce the process of cleaning an instance using matching dependencies, as a chase-like procedure. We show that matching functions naturally introduce a lattice structure on attribute domains, and a partial order of semantic domination between instances. Using the latter, we define the semantics of clean query answering in terms of certain/possible answers as the greatest lower bound/least upper bound of all possible answers obtained from the clean instances. We show that clean query answering is intractable in some cases. Then we study queries that behave monotonically w.r.t. semantic domination order, and show that we can provide an under/over approximation for clean answers to monotone queries. Moreover, non-monotone positive queries can be relaxed into monotone queries.
Starting Page	268
Ending Page	279
Page Count	12
File Format	PDF
ISBN	9781450305297
DOI	10.1145/1938551.1938585
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2011-03-21
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Matching dependency Semantic domination Possible answer Certain answer Lattice Matching function
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in