An efficient transitive closure algorithm for distributed databases

Date

1993-01-01

Author

Toroslu, İsmail Hakkı

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

201
views

0
downloads

© 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 shared-nothing architectures. We present a new efficient algorithm for full TC problem for shared-nothing architecture. Using simulation, we also study and examine the performance of the algorithm.

Subject Keywords

Distributed Databases , Deductive Databases , Distributed Computing , Operating Systems , Logic , Tree Graphs

URI

https://hdl.handle.net/11511/56522

DOI

https://doi.org/10.1109/icci.1993.315381

Conference Name

5th International Conference on Computing and Information,

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

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...
Efficient computation of strong partial transitive-closures Toroslu, İsmail Hakkı (null; 1993-01-01) 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 q...
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...
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, “An efficient transitive closure algorithm for distributed databases,” presented at the 5th International Conference on Computing and Information, Sudbury, Ontario, Canada, 1993, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/56522.