同步计数法

[1989] Proceedings. Fifth International Conference on Data Engineering Pub Date : 1989-02-06 DOI:10.1109/ICDE.1989.47237

H. Aly, Z. M. Özsoyoglu

{"title":"同步计数法","authors":"H. Aly, Z. M. Özsoyoglu","doi":"10.1109/ICDE.1989.47237","DOIUrl":null,"url":null,"abstract":"A direct extension to the counting method is presented which can deal efficiently with both acyclic and cyclic relations. The extension to cycle cases, called the synchronized counting method, is simulated and studied using a Petri net model. Worst-case analysis shows that n/sup 2/ semijoin operations are required, where n is the number of nodes in the graph representing the relevant part of the input relations. The algorithm is shown to be sound and complete, and a comparison with other methods in the literature is included.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"372 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Synchronized counting method\",\"authors\":\"H. Aly, Z. M. Özsoyoglu\",\"doi\":\"10.1109/ICDE.1989.47237\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A direct extension to the counting method is presented which can deal efficiently with both acyclic and cyclic relations. The extension to cycle cases, called the synchronized counting method, is simulated and studied using a Petri net model. Worst-case analysis shows that n/sup 2/ semijoin operations are required, where n is the number of nodes in the graph representing the relevant part of the input relations. The algorithm is shown to be sound and complete, and a comparison with other methods in the literature is included.<<ETX>>\",\"PeriodicalId\":329505,\"journal\":{\"name\":\"[1989] Proceedings. Fifth International Conference on Data Engineering\",\"volume\":\"372 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-02-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1989] Proceedings. Fifth International Conference on Data Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDE.1989.47237\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] Proceedings. Fifth International Conference on Data Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE.1989.47237","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 18

摘要

提出了一种直接推广的计数方法，可以有效地处理非循环和循环关系。利用Petri网模型对循环情况的扩展，即同步计数法进行了模拟和研究。最坏情况分析表明，需要n/sup 2/半连接操作，其中n为表示输入关系相关部分的图中的节点数。该算法被证明是健全和完整的，并与文献中的其他方法进行了比较。

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

查看原文本刊更多论文

Synchronized counting method

A direct extension to the counting method is presented which can deal efficiently with both acyclic and cyclic relations. The extension to cycle cases, called the synchronized counting method, is simulated and studied using a Petri net model. Worst-case analysis shows that n/sup 2/ semijoin operations are required, where n is the number of nodes in the graph representing the relevant part of the input relations. The algorithm is shown to be sound and complete, and a comparison with other methods in the literature is included.<>

求助全文

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

来源期刊

[1989] Proceedings. Fifth International Conference on Data Engineering

自引率

0.00%

发文量