带有否定的连接形式查询的强包容问题

2009 First International Confernce on Advances in Databases, Knowledge, and Data Applications Pub Date : 2009-03-01 DOI:10.1109/DBKDA.2009.23

V. Felea

{"title":"带有否定的连接形式查询的强包容问题","authors":"V. Felea","doi":"10.1109/DBKDA.2009.23","DOIUrl":null,"url":null,"abstract":"In this paper we define a new notion of containment for two queries, called strong containment. The strong containment implies the classical containment. A necessary and sufficient condition for the strong containment relation between two queries is given. The time complexity of the decision problem for two queries to be in strong containment relation is a linear function of the containment mappings number corresponding to the queries","PeriodicalId":231150,"journal":{"name":"2009 First International Confernce on Advances in Databases, Knowledge, and Data Applications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Strong Containment Problem for Queries in Conjunctive Form with Negation\",\"authors\":\"V. Felea\",\"doi\":\"10.1109/DBKDA.2009.23\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we define a new notion of containment for two queries, called strong containment. The strong containment implies the classical containment. A necessary and sufficient condition for the strong containment relation between two queries is given. The time complexity of the decision problem for two queries to be in strong containment relation is a linear function of the containment mappings number corresponding to the queries\",\"PeriodicalId\":231150,\"journal\":{\"name\":\"2009 First International Confernce on Advances in Databases, Knowledge, and Data Applications\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 First International Confernce on Advances in Databases, Knowledge, and Data Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DBKDA.2009.23\",\"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 First International Confernce on Advances in Databases, Knowledge, and Data Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DBKDA.2009.23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

在本文中，我们为两个查询定义了一个新的包含概念，称为强包含。强遏制意味着古典遏制。给出了两个查询之间存在强包含关系的充分必要条件。具有强包含关系的两个查询的决策问题的时间复杂度是查询对应的包含映射数的线性函数

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

查看原文本刊更多论文

A Strong Containment Problem for Queries in Conjunctive Form with Negation

In this paper we define a new notion of containment for two queries, called strong containment. The strong containment implies the classical containment. A necessary and sufficient condition for the strong containment relation between two queries is given. The time complexity of the decision problem for two queries to be in strong containment relation is a linear function of the containment mappings number corresponding to the queries

求助全文

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

来源期刊

2009 First International Confernce on Advances in Databases, Knowledge, and Data Applications

自引率

0.00%

发文量