Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

114

Voted

PODS
2003
ACM

148views Database» more PODS 2003»

On the decidability and complexity of query answering over inconsistent and incomplete databases

16 years 2 months ago

On the decidability and complexity of query answering over inconsistent and incomplete databases

Download www.dis.uniroma1.it

Andrea Calì, Domenico Lembo, Riccardo Rosat

Real-time Traffic

Database | PODS 2003 | Query Answering |

claim paper

Related Content

» On the complexity of query answering over incomplete XML documents

» PreferenceDriven Querying of Inconsistent Relational Databases

» Query Answering in Inconsistent Databases

» Queries with Incomplete Answers over Semistructured Data

» Tractable query answering and rewriting under description logic constraints

» Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns

» Repair checking in inconsistent databases algorithms and complexity

» Normalizing Incomplete Databases

» Inconsistency Tolerance in P2P Data Integration An Epistemic Logic Approach

Post Info
More Details (n/a)

Added	08 Dec 2009
Updated	08 Dec 2009
Type	Conference
Year	2003
Where	PODS
Authors	Andrea Calì, Domenico Lembo, Riccardo Rosati

Comments (0)