The strong partial transitive-closure problem: Algorithms and performance evaluation

Date

1996-08-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

263
views

0
downloads

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.

Subject Keywords

Database algorithms, Deductive databases, Performance evaluation, Recursive rules

URI

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

Journal

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING

DOI

https://doi.org/10.1109/69.536254

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

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...
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...
An attempt to classify Turkish district data : K-Means and Self-Organizing Map (SOM) algorithms Aksoy, Ece; Işık, Oğuz; Department of Geodetic and Geographical Information Technologies (2004) There is no universally applicable clustering technique in discovering the variety of structures display in data sets. Also, a single algorithm or approach is not adequate to solve every clustering problem. There are many methods available, the criteria used differ and hence different classifications may be obtained for the same data. While larger and larger amounts of data are collected and stored in databases, there is increasing the need for efficient and effective analysis methods. Grouping or classific...
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...

Citation Formats

İ. H. Toroslu, “The strong partial transitive-closure problem: Algorithms and performance evaluation,” IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, pp. 617–629, 1996, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/38847.