Efficient computation of strong partial transitive-closures

Date

1993-01-01

Author

Toroslu, İsmail Hakkı

Metadata

Show full item record

Item Usage Stats

218
views

0
downloads

The development of efficient algorithms to process the different forms of the transitive-closure (TC) queries within the context of large database systems has recently attracted a large volume of research efforts. In this paper, we present a new algorithm suitable for processing one of these forms, the so called strong partially-instantiated, in which one of the query's argument is instantiated to a set of constants and the processing of which yields a set of tuples that draw their values form both of the query's instantiated and uninstantiated arguments. This algorithm avoids the redundant computations and the high storage cost found in a number of similar algorithms. Using simulation, this paper compares the performance of the new algorithm with those found in literature and shows clearly the superiority of the new algorithm.

Subject Keywords

Costs, Database systems, Logic , Deductive databases, Tree graphs

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=0027277758&origin=inward
https://hdl.handle.net/11511/83110
https://ieeexplore.ieee.org/document/344027/keywords#keywords

DOI

https://doi.org/10.1109/ICDE.1993.344027

Conference Name

Proceedings of IEEE 9th International Conference on Data Engineering (19-23 April 1993 )

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

The strong partial transitive-closure problem: Algorithms and performance evaluation Toroslu, İsmail Hakkı (1996-08-01) 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...
An efficient transitive closure algorithm for distributed databases Toroslu, İsmail Hakkı (1993-01-01) © 1993 IEEE.Because most of the recognizable queries in deductive databases can be transformed into transitive-closure (TC) problem, the development of efficient algorithms to process the different forms of TC problems within the context of large database systems has recently attracted a large amount of research efforts. However, the parallelization of the computation of TC is still a new issue and there are only a few and recent parallel TC algorithms. Most of these parallel algorithms mere developed for s...
New transitive closure algorithm for recursive query processing in deductive databases Toroslu, İsmail Hakkı (1992-01-01) © 1992 IEEE.The development of effic1.e11t algorithms to process the different forms of the transitive-closure (TC) queries within the context of large database systems has recently attracted a large amom1t of research efforts. In this paper, we present a neic algorithm suitable for full transitive closure problem, which zs used to solve uninstentiated recursive qi1enes in deductive databases. In this new algorithm there are two phases. In the first phase a general graph is condensed into an acyclic graph a...
Using fuzzy Petri nets for static analysis of rule-bases Bostan-Korpeoglu, B; Yazıcı, Adnan (2004-01-01) We use a Fuzzy Petri Net (FPN) structure to represent knowledge and model the behavior in our intelligent object-oriented database environment, which integrates fuzzy, active and deductive rules with database objects. However, the behavior of a system can be unpredictable due to the rules triggering or untriggering each other (non-termination). Intermediate and final database states may also differ according to the order of rule executions (non-confluence). In order to foresee and solve problematic behavior...
A new hybrid multi-relational data mining technique Toprak, Seda Dağlar; Toroslu, İ. Hakkı; Department of Computer Engineering (2005) Multi-relational learning has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational databases. As patterns involve multiple relations, the search space of possible hypotheses becomes intractably complex. Many relational knowledge discovery systems have been developed employing various search strategies, search heuristics and pattern language limitations in order to cope with the complexity of hypothesis space. In this w...

Citation Formats

İ. H. Toroslu, “Efficient computation of strong partial transitive-closures,” Vienna, Austria, 1993, Accessed: 00, 2021. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=0027277758&origin=inward.