Taming primary key violations to query large inconsistent data via ASP

Consistent query answering over a database that violates primary key constraints is a classical hard problem in database research that has been traditionally dealt with logic programming. However, the applicability of existing logic-based solutions is restricted to data sets of moderate size. This p...

Celý popis

Podrobná bibliografia

Vydané v:	Theory and practice of logic programming Ročník 15; číslo 4-5; s. 696 - 710
Hlavní autori:	MANNA, MARCO, RICCA, FRANCESCO, TERRACINA, GIORGIO
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cambridge, UK Cambridge University Press 01.07.2015
Predmet:	Collection Logic programming Polynomials Programming Query processing Regular Papers Strategy Consistent Query Answering ASP Inconsistent Databases
ISSN:	1471-0684, 1475-3081
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!