AN EFFICIENT DATABASE TRANSITIVE CLOSURE ALGORITHM

1994-05-01
The integration of logic rules and relational databases has recently emerged as an important technique for developing knowledge management systems. An important class of logic rules utilized by these systems is the so-called transitive closure rules, the processing of which requires the computation of the transitive closure of database relations referenced by these rules. This article presents a new algorithm suitable for computing the transitive closure of very large database relations. This algorithm proceeds in two phases. In the first phase, a general graph is condensed into an acyclic one, and at the same time a special sparse matrix is formed from the acyclic graph. The second phase is the main one, in which all the page 1/0 operations are minimized by removing most of the redundant operations that appear in previous algorithms. Using simulation, this article also studies and examines the performance of this algorithm and compares it with the previous algorithms.
APPLIED INTELLIGENCE

Suggestions

An intelligent fuzzy object-oriented database framework for video database applications
Ozgur, Nezihe Burcu; KOYUNCU, Murat; Yazıcı, Adnan (Elsevier BV, 2009-08-01)
Video database applications call for flexible and powerful modeling and querying facilities, which require an integration or interaction between database and knowledge-based technologies. It is also necessary for many real life video database applications to incorporate uncertainty, which naturally occurs due to the complex and subjective semantic content of video data. In this study, firstly, we introduce a fuzzy conceptual data model to represent the semantic content of video data. For that purpose, UML (...
A complete axiomatization for fuzzy functional and multivalued dependencies in fuzzy database relations
Sozat, MI; Yazıcı, Adnan (Elsevier BV, 2001-01-15)
This paper first introduces the formal definitions of fuzzy functional and multivalued dependencies which are given on the basis of the conformance values presented here. Second, the inference rules are listed after both fuzzy functional and multivalued dependencies are shown to be consistent, that is, they reduce to those of the classic functional and multivalued dependencies when crisp attributes are involved. Finally, the inference rules presented here are shown to be sound and complete for the family of...
A Bayesian network framework for project cost, benefit and risk analysis with an agricultural development case study
Yet, Barbaros; Fenton, Norman; Neil, Martin; Luedeling, Eike; Shepherd, Keith (Elsevier BV, 2016-10-01)
Successful implementation of major projects requires careful management of uncertainty and risk. Yet such uncertainty is rarely effectively calculated when analysing project costs and benefits. This paper presents a Bayesian Network (BN) modelling framework to calculate the costs, benefits, and return on investment of a project over a specified time period, allowing for changing circumstances and trade-offs. The framework uses hybrid and dynamic BNs containing both discrete and continuous variables over mul...
A shared-medium communication architecture for distributed discrete event systems
Schmidt, Klaus Verner; Zaddach, J. (2007-06-29)
Recently, several efficient supervisor synthesis approaches for distributed discrete event systems (DES) have been established. In this paper, the implementation of such supervisors on interacting distributed programmable logic controllers (PLCs) on a network is considered for the hierarchical and decentralized control approach elaborated in our previous work. A communication model that captures the controller behavior relevant for communication is developed, and a network architecture together with a sched...
LinGraph: a graph-based automated planner for concurrent task planning based on linear logic
Kortik, Sitar; Saranlı, Uluç (Springer Science and Business Media LLC, 2017-10-01)
In this paper, we introduce an automated planner for deterministic, concurrent domains, formulated as a graph-based theorem prover for a propositional fragment of intuitionistic linear logic, relying on the previously established connection between intuitionistic linear logic and planning problems. The new graph-based theorem prover we introduce improves planning performance by reducing proof permutations that are irrelevant to planning problems particularly in the presence of large numbers of objects and a...
Citation Formats
İ. H. Toroslu and L. HENSCHEN, “AN EFFICIENT DATABASE TRANSITIVE CLOSURE ALGORITHM,” APPLIED INTELLIGENCE, pp. 205–218, 1994, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/41196.