Efficient Management of Transitive Relationships in Large Data and Knowledge Bases.
Rakesh Agrawal, Alexander Borgida, H. V. Jagadish:
Efficient Management of Transitive Relationships in Large Data and Knowledge Bases.
SIGMOD Conference 1989: 253-262@inproceedings{DBLP:conf/sigmod/AgrawalBJ89,
author = {Rakesh Agrawal and
Alexander Borgida and
H. V. Jagadish},
editor = {James Clifford and
Bruce G. Lindsay and
David Maier},
title = {Efficient Management of Transitive Relationships in Large Data
and Knowledge Bases},
booktitle = {Proceedings of the 1989 ACM SIGMOD International Conference on
Management of Data, Portland, Oregon, May 31 - June 2, 1989},
publisher = {ACM Press},
year = {1989},
pages = {253-262},
ee = {http://doi.acm.org/10.1145/67544.66950, db/conf/sigmod/AgrawalBJ89.html},
crossref = {DBLP:conf/sigmod/89},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
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.
Copyright © 1989 by the ACM,
Inc., used by permission. Permission to make
digital or hard copies is granted provided that
copies are not made or distributed for profit or
direct commercial advantage, and that copies show
this notice on the first page or initial screen of
a display along with the full citation.
Online Version (ACM WWW Account required): Full Text in PDF Format
CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
James Clifford, Bruce G. Lindsay, David Maier (Eds.):
Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, Portland, Oregon, May 31 - June 2, 1989.
ACM Press 1989 ,
SIGMOD Record 18(2), June 1989
Contents
References
- [1]
- Rakesh Agrawal, H. V. Jagadish:
Direct Algorithms for Computing the Transitive Closure of Database Relations.
VLDB 1987: 255-266
- [2]
- Rakesh Agrawal:
Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries.
ICDE 1987: 580-590
- [3]
- Rakesh Agrawal, H. V. Jagadish:
Multiprocessor Transitive Closure Algorithms.
DPDS 1988: 56-66
- [4]
- ...
- [5]
- Hassan Aït-Kaci, Robert S. Boyer, Patrick Lincoln, Roger Nasr:
Efficient Implementation of Lattice Operations.
ACM Trans. Program. Lang. Syst. 11(1): 115-146(1989)
- [6]
- ...
- [7]
- José A. Blakeley, Per-Åke Larson, Frank Wm. Tompa:
Efficiently Updating Materialized Views.
SIGMOD Conference 1986: 61-71
- [8]
- Alexander Borgida, Ronald J. Brachman, Deborah L. McGuinness, Lori Alperin Resnick:
CLASSIC: A Structural Data Model for Objects.
SIGMOD Conference 1989: 58-67
- [9]
- ...
- [10]
- ...
- [11]
- Isabel F. Cruz, Alberto O. Mendelzon, Peter T. Wood:
A Graphical Query Language Supporting Recursion.
SIGMOD Conference 1987: 323-330
- [12]
- ...
- [13]
- ...
- [14]
- Eric N. Hanson:
A Performance Analysis of View Materialization Strategies.
SIGMOD Conference 1987: 440-453
- [15]
- Yannis E. Ioannidis:
On the Computation of the Transitive Closure of Relational Operators.
VLDB 1986: 403-411
- [16]
- Yannis E. Ioannidis, Raghu Ramakrishnan:
Efficient Transitive Closure Algorithms.
VLDB 1988: 382-394
- [17]
- Giuseppe F. Italiano:
Amortized Efficiency of a Path Retrieval Data Structure.
Theor. Comput. Sci. 48(3): 273-281(1986)
- [18]
- H. V. Jagadish:
A Compressed Transitive Closure Technique for Efficient Fixed-Point Query Processing.
Expert Database Conf. 1988: 423-446
- [19]
- H. V. Jagadish:
Incorporating Hierarchy in a Relational Model of Data.
SIGMOD Conference 1989: 78-87
- [20]
- Thomas Kaczmarek, Raymond Bates, Gabriel Robins:
Recent Developments in NIKL.
AAAI 1986: 978-985
- [21]
- Ru-Mei Kung, Eric N. Hanson, Yannis E. Ioannidis, Timos K. Sellis, Leonard D. Shapiro, Michael Stonebraker:
Heuristic Search in Data Base Systems.
Expert Database Workshop 1984: 537-548
- [22]
- Hongjun Lu:
New Strategies for Computing the Transitive Closure of a Database Relation.
VLDB 1987: 267-274
- [23]
- ...
- [24]
- Philip A. Bernstein, Umeshwar Dayal, David J. DeWitt, Dieter Gawlick, Jim Gray, Matthias Jarke, Bruce G. Lindsay, Peter C. Lockemann, David Maier, Erich J. Neuhold, Andreas Reuter, Lawrence A. Rowe, Hans-Jörg Schek, Joachim W. Schmidt, Michael Schrefl, Michael Stonebraker:
Future Directions in DBMS Research - The Laguna Beach Participants.
SIGMOD Record 18(1): 17-26(1989)
- [25]
- ...
- [26]
- ...
- [27]
- Arnon Rosenthal, Sandra Heiler, Umeshwar Dayal, Frank Manola:
Traversal Recursion: A Practical Approach to Supporting Recursive Applications.
SIGMOD Conference 1986: 166-176
- [28]
- ...
- [29]
- Patrick Valduriez, Haran Boral:
Evaluation of Recursive Queries Using Join Indices.
Expert Database Conf. 1986: 271-293
- [30]
- Ingrid M. Walter, Peter C. Lockemann, Hans-Hellmut Nagel:
Database Support for Knowledge-Based Image Evaluation.
VLDB 1987: 3-11
Copyright © Fri Mar 12 17:21:28 2010
by Michael Ley (ley@uni-trier.de)