Efficient Management of Transitive Relationships in Large Data and Knowledge Bases

Abstract

We argue that accessing the transitive closure of relationships is an important component of both databases and knowledge representation systems in Artificial Intelligence. The demands for efficient access and management of large relationships motivate the need for explicitly storing the transitive closure in a compressed and local way, while allowing updates to the base relation to be propagated incrementally. We present a transitive closure compression technique, based on labeling spanning trees with numeric intervals, and provide both analytical and empirical evidence of its efficacy, including a proof of optimality.

DOI: 10.1145/67544.66950

Extracted Key Phrases

13 Figures and Tables

02040'92'95'98'01'04'07'10'13'16
Citations per Year

410 Citations

Semantic Scholar estimates that this publication has 410 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Agrawal1989EfficientMO, title={Efficient Management of Transitive Relationships in Large Data and Knowledge Bases}, author={Rakesh Agrawal and Alexander Borgida and H. V. Jagadish}, booktitle={SIGMOD Conference}, year={1989} }