@inproceedings{cf3cc627755a4207aac988a52177276e,
title = "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.",
author = "Rakesh Agrawal and Alexander Borgida and Jagadish, {H. V.}",
note = "Publisher Copyright: {\textcopyright} 1989 ACM.; 1989 ACM SIGMOD International Conference on Management of Data, SIGMOD 1989 ; Conference date: 31-05-1989 Through 02-06-1989",
year = "1989",
month = jun,
day = "1",
doi = "10.1145/67544.66950",
language = "English (US)",
series = "Proceedings of the ACM SIGMOD International Conference on Management of Data",
publisher = "Association for Computing Machinery",
pages = "253--262",
booktitle = "Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, SIGMOD 1989",
}