{"title":"Consistent Query Answering for Atemporal Constraints over Temporal Databases","authors":"J. Chomicki, J. Wijsen","doi":"10.1109/TIME.2016.23","DOIUrl":null,"url":null,"abstract":"Consistent query answering is a principled approach to query answering on inconsistent databases: when an inconsistent database has more than one plausible repair, queries are answered by returning the intersection of the query answers over all repairs. In this paper, we study consistent query answering over temporal databases relative to atemporal integrity constraints. A temporal database is conceptually viewed as a sequence of atemporal snapshot databases indexed by time. Two approaches to repairing are presented. In the first approach, each snapshot database is repaired individually and independently of earlier or later snapshots. This independence between snapshots facilitates the computation of consistent query answers. A second approach, which is seemingly more realistic, favors the persistence of attribute values in repairs.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TIME.2016.23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13
Abstract
Consistent query answering is a principled approach to query answering on inconsistent databases: when an inconsistent database has more than one plausible repair, queries are answered by returning the intersection of the query answers over all repairs. In this paper, we study consistent query answering over temporal databases relative to atemporal integrity constraints. A temporal database is conceptually viewed as a sequence of atemporal snapshot databases indexed by time. Two approaches to repairing are presented. In the first approach, each snapshot database is repaired individually and independently of earlier or later snapshots. This independence between snapshots facilitates the computation of consistent query answers. A second approach, which is seemingly more realistic, favors the persistence of attribute values in repairs.