Anzeige
Erschienen in:
1992 | OriginalPaper | Buchkapitel
Efficient Management of K-Level Transitive Closure
verfasst von : Keh-Chang Guh, Pintsang Chang
Erschienen in: Database and Expert Systems Applications
Verlag: Springer Vienna
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
A k-level transitive closure of a directed graph is all pairs of vertices (x, y) such that there exists at least a path from x to y of length d, d≤k. Multiple edges between a pair of vertices are allowed in a graph. This paper presents a data structure to store materialized k-level transitive closure such that retrievals and updates of a k-level transitive closure with path information being kept may be performed efficiently.