非循环连接查询的复杂性

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI:10.1109/SFCS.1998.743521

G. Gottlob, N. Leone, Francesco Scarcello

{"title":"非循环连接查询的复杂性","authors":"G. Gottlob, N. Leone, Francesco Scarcello","doi":"10.1109/SFCS.1998.743521","DOIUrl":null,"url":null,"abstract":"We show that the problem of evaluating acylic Boolean database-queries is LOGCFL-complete and thus highly parallelizable. We present a parallel database algorithm solving this problem with a logarithmic number of parallel join operations. It follows from our main result that the acylic versions of the following important database and Al problems are LOGCFL-complete: The query output tuple problem for conjunctive queries, conjunctive query containment, clause subsumption, and constraint satisfaction.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"The complexity of acyclic conjunctive queries\",\"authors\":\"G. Gottlob, N. Leone, Francesco Scarcello\",\"doi\":\"10.1109/SFCS.1998.743521\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that the problem of evaluating acylic Boolean database-queries is LOGCFL-complete and thus highly parallelizable. We present a parallel database algorithm solving this problem with a logarithmic number of parallel join operations. It follows from our main result that the acylic versions of the following important database and Al problems are LOGCFL-complete: The query output tuple problem for conjunctive queries, conjunctive query containment, clause subsumption, and constraint satisfaction.\",\"PeriodicalId\":228145,\"journal\":{\"name\":\"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)\",\"volume\":\"125 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1998.743521\",\"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 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1998.743521","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

我们证明了求循环布尔数据库查询的问题是logcfl完备的，因此是高度并行化的。我们提出了一种并行数据库算法，通过对数次并行连接操作来解决这个问题。从我们的主要结果可以得出，以下重要的数据库和人工智能问题的静态版本是logcfl完整的:连接查询的查询输出元组问题、连接查询包含、子句包容和约束满足。

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

查看原文本刊更多论文

The complexity of acyclic conjunctive queries

We show that the problem of evaluating acylic Boolean database-queries is LOGCFL-complete and thus highly parallelizable. We present a parallel database algorithm solving this problem with a logarithmic number of parallel join operations. It follows from our main result that the acylic versions of the following important database and Al problems are LOGCFL-complete: The query output tuple problem for conjunctive queries, conjunctive query containment, clause subsumption, and constraint satisfaction.

求助全文

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

来源期刊

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)

自引率

0.00%

发文量