概率数据库中带有否定的非重复查询的二分法

Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems Pub Date : 2014-06-18 DOI:10.1145/2594538.2594549

Robert Fink, Dan Olteanu

{"title":"概率数据库中带有否定的非重复查询的二分法","authors":"Robert Fink, Dan Olteanu","doi":"10.1145/2594538.2594549","DOIUrl":null,"url":null,"abstract":"This paper shows that any non-repeating conjunctive relational query with negation has either polynomial time or #P-hard data complexity on tuple-independent probabilistic databases. This result extends a dichotomy by Dalvi and Suciu for non-repeating conjunctive queries to queries with negation. The tractable queries with negation are precisely the hierarchical ones and can be recognized efficiently.","PeriodicalId":302451,"journal":{"name":"Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"A dichotomy for non-repeating queries with negation in probabilistic databases\",\"authors\":\"Robert Fink, Dan Olteanu\",\"doi\":\"10.1145/2594538.2594549\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper shows that any non-repeating conjunctive relational query with negation has either polynomial time or #P-hard data complexity on tuple-independent probabilistic databases. This result extends a dichotomy by Dalvi and Suciu for non-repeating conjunctive queries to queries with negation. The tractable queries with negation are precisely the hierarchical ones and can be recognized efficiently.\",\"PeriodicalId\":302451,\"journal\":{\"name\":\"Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2594538.2594549\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2594538.2594549","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

本文证明了在元独立概率数据库中，任何具有否定的非重复连接关系查询要么具有多项式时间，要么具有#P-hard数据复杂度。这个结果将Dalvi和Suciu对非重复联合查询的二分法扩展到具有否定的查询。可处理的带有否定的查询正是层次查询，可以有效地识别。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A dichotomy for non-repeating queries with negation in probabilistic databases

This paper shows that any non-repeating conjunctive relational query with negation has either polynomial time or #P-hard data complexity on tuple-independent probabilistic databases. This result extends a dichotomy by Dalvi and Suciu for non-repeating conjunctive queries to queries with negation. The tractable queries with negation are precisely the hierarchical ones and can be recognized efficiently.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

自引率

0.00%

发文量