不完整数据库历史的一阶查询改写

V. Bruyère, Alexandre Decan, J. Wijsen
{"title":"不完整数据库历史的一阶查询改写","authors":"V. Bruyère, Alexandre Decan, J. Wijsen","doi":"10.1109/TIME.2009.17","DOIUrl":null,"url":null,"abstract":"Multiwords are defined as words in which single symbols can be replaced by nonempty sets of symbols. Such a set of symbols captures uncertainty about the exact symbol. Words are obtained from multiwords by selecting a single symbol from every set. A pattern is certain in a multiword W if it occurs in every word that can be obtained from W. For a given pattern, we are interested in finding a logic formula that recognizes the multiwords in which that pattern is certain. This problem can be seen as a special case of consistent query answering (CQA).We show how our results can be applied in CQA on database histories under primary key constraints.","PeriodicalId":163298,"journal":{"name":"2009 16th International Symposium on Temporal Representation and Reasoning","volume":"216 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"On First-Order Query Rewriting for Incomplete Database Histories\",\"authors\":\"V. Bruyère, Alexandre Decan, J. Wijsen\",\"doi\":\"10.1109/TIME.2009.17\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multiwords are defined as words in which single symbols can be replaced by nonempty sets of symbols. Such a set of symbols captures uncertainty about the exact symbol. Words are obtained from multiwords by selecting a single symbol from every set. A pattern is certain in a multiword W if it occurs in every word that can be obtained from W. For a given pattern, we are interested in finding a logic formula that recognizes the multiwords in which that pattern is certain. This problem can be seen as a special case of consistent query answering (CQA).We show how our results can be applied in CQA on database histories under primary key constraints.\",\"PeriodicalId\":163298,\"journal\":{\"name\":\"2009 16th International Symposium on Temporal Representation and Reasoning\",\"volume\":\"216 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 16th International Symposium on Temporal Representation and Reasoning\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TIME.2009.17\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 16th International Symposium on Temporal Representation and Reasoning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TIME.2009.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

多词被定义为单个符号可以被非空符号集代替的词。这样一组符号捕捉到了关于确切符号的不确定性。单词是通过从每组中选择一个符号从多单词中获得的。如果一个模式出现在可以从W中获得的每个单词中,那么它在多词W中是确定的。对于给定的模式,我们感兴趣的是找到一个逻辑公式来识别该模式确定的多词。这个问题可以看作是一致查询应答(CQA)的一个特例。我们展示了如何将我们的结果应用于基于主键约束的数据库历史的CQA。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On First-Order Query Rewriting for Incomplete Database Histories
Multiwords are defined as words in which single symbols can be replaced by nonempty sets of symbols. Such a set of symbols captures uncertainty about the exact symbol. Words are obtained from multiwords by selecting a single symbol from every set. A pattern is certain in a multiword W if it occurs in every word that can be obtained from W. For a given pattern, we are interested in finding a logic formula that recognizes the multiwords in which that pattern is certain. This problem can be seen as a special case of consistent query answering (CQA).We show how our results can be applied in CQA on database histories under primary key constraints.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信