Skip to main navigation Skip to search Skip to main content

Scalar aggregation in fd-inconsistent databases

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

31 Scopus citations

Abstract

We consider here scalar aggregation queries in databases that may violate a given set of functional dependencies. We show how to compute consistent answers (answers true in every minimal repair of the database) to such queries. We provide a complete characterization of the computational complexity of this problem. We also show how tractability can be obtained in several special cases (one involves a novel application of the perfect graph theory) and present a practical hybrid query evaluation method.

Original languageEnglish
Title of host publicationDatabase Theory - ICDT 2001 - 8th International Conference, Proceedings
EditorsJan Van den Bussche, Victor Vianu
PublisherSpringer Verlag
Pages39-53
Number of pages15
ISBN (Print)9783540414568
DOIs
StatePublished - 2001
Event8th International Conference on Database Theory, ICDT 2001 - London, United Kingdom
Duration: Jan 4 2001Jan 6 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1973

Conference

Conference8th International Conference on Database Theory, ICDT 2001
Country/TerritoryUnited Kingdom
CityLondon
Period01/4/0101/6/01

Fingerprint

Dive into the research topics of 'Scalar aggregation in fd-inconsistent databases'. Together they form a unique fingerprint.

Cite this