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

The development of efficient algorithms to process the different forms of 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 two new algorithms suitable for processing one of these forms, t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on knowledge and data engineering Ročník 8; číslo 4; s. 617 - 629
Hlavní autoři: Toroslu, I.H., Qadah, G.Z.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.08.1996
IEEE Computer Society
Témata:
Applied sciences
Computational modeling
Computer science; control theory; systems
Context modeling
Costs
Database systems
Deductive databases
Exact sciences and technology
Information systems. Data bases
Logic
Memory organisation. Data processing
Software
Tree graphs
Performance evaluation
Transitive closure
Tree(graph)
Deductive database
Database query
Database
Recursive method
Data processing
Fast algorithm
Search algorithm
ISSN:1041-4347
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The development of efficient algorithms to process the different forms of 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 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.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1041-4347
DOI:10.1109/69.536254