.png){kind=icon}
返回
The strong partial transitive-closure problem: Algorithms and performance evaluation
.png){kind=icon}
PRE
AI
DOI：10.1109/69.536254.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The development of efficient algorithms to process the different forms of transitive-closure (To) queries within the context of large database systems has recently attracted a large volume of research efforts. In this paper, we present two new algorithms suitable for processing one of these forms, the so called strong partially instantiated transitive closure, in which one of the query's arguments is instantiated to a set of constants and the processing of which yields a set of tuples that draw their values from both of the query's instantiated and uninstantiated arguments. These algorithms avoids the redundant computations and high storage cost found in a number of similar algorithms. Using simulation, this paper compares the performance of the new algorithms with those found in literature and shows clearly the superiority of the new algorithms.
Keyword:
database algorithms
deductive databases
performance evaluation
recursive rules
and transitive closure queries
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
暂无机构信息
引用论文
The solar absolute spectral irradiance 1150–3173 Å: May 17, 1982太阳绝对光谱辐照度1150-3173 Å: 1982年5月17日
PREAI
分享收藏Optimised Anaesthesia to Reduce Post Operative Cognitive Decline (POCD) in Older Patients Undergoing Elective Surgery, a Randomised Controlled Trial.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏
查看更多内容