安全否定并置查询包含问题的一种新算法

2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications Pub Date : 2010-04-11 DOI:10.1109/DBKDA.2010.42

V. Felea

{"title":"安全否定并置查询包含问题的一种新算法","authors":"V. Felea","doi":"10.1109/DBKDA.2010.42","DOIUrl":null,"url":null,"abstract":"Many queries about real databases havea particular form, e.g., the negated part consists ofone single literal or they contain just a single binaryrelation, etc. For a particular class of queries, it isuseful to construct algorithms for the containmentproblem, that are better than those for the whole classof queries. The paper is about the problem of querycontainment for conjunctive queries with safe negationproperty. A new algorithm to test the containmentproblem of two queries is given. Several aspects ofthe time complexity for the proposed algorithm arespecified. From this point of view, the new algorithmproves to be better than the previous for some classesof queries.","PeriodicalId":273177,"journal":{"name":"2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications","volume":"176 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A New Algorithm for the Containment Problem of Conjunctive Queries with Safe Negation\",\"authors\":\"V. Felea\",\"doi\":\"10.1109/DBKDA.2010.42\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many queries about real databases havea particular form, e.g., the negated part consists ofone single literal or they contain just a single binaryrelation, etc. For a particular class of queries, it isuseful to construct algorithms for the containmentproblem, that are better than those for the whole classof queries. The paper is about the problem of querycontainment for conjunctive queries with safe negationproperty. A new algorithm to test the containmentproblem of two queries is given. Several aspects ofthe time complexity for the proposed algorithm arespecified. From this point of view, the new algorithmproves to be better than the previous for some classesof queries.\",\"PeriodicalId\":273177,\"journal\":{\"name\":\"2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications\",\"volume\":\"176 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DBKDA.2010.42\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DBKDA.2010.42","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

许多关于真实数据库的查询都有特定的形式，例如，被否定的部分由一个字面值组成，或者它们只包含一个二进制关系，等等。对于一个特定的查询类，为包含问题构建算法是有用的，它比为整个查询类构建的算法更好。研究具有安全否定性质的合取查询的查询包容问题。给出了一种测试两个查询的包含问题的新算法。给出了该算法时间复杂度的几个方面。从这个角度来看，对于某些类型的查询，新算法比以前的算法更好。

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

查看原文本刊更多论文

A New Algorithm for the Containment Problem of Conjunctive Queries with Safe Negation

Many queries about real databases havea particular form, e.g., the negated part consists ofone single literal or they contain just a single binaryrelation, etc. For a particular class of queries, it isuseful to construct algorithms for the containmentproblem, that are better than those for the whole classof queries. The paper is about the problem of querycontainment for conjunctive queries with safe negationproperty. A new algorithm to test the containmentproblem of two queries is given. Several aspects ofthe time complexity for the proposed algorithm arespecified. From this point of view, the new algorithmproves to be better than the previous for some classesof queries.

求助全文

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

来源期刊

2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications

自引率

0.00%

发文量