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žené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on knowledge and data engineering Ročník 8; číslo 4; s. 617 - 629
Hlavní autori:	Toroslu, I.H., Qadah, G.Z.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY IEEE 01.08.1996 IEEE Computer Society
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!