skip to main content
article
Free access

Efficient management of transitive relationships in large data and knowledge bases

Published: 01 June 1989 Publication History

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.

References

[1]
R. Agrawal and H. V. Jagadish, "Direct Algorithms for Computing the Transitive Closure of Database Relations", Proc. 13th Int'l Conf. Very Large Data Bases, Brighton, England, Sept. 1987, 255-266.
[2]
R. Agrawal, "Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries", Proc. IEEE 3rd lnt'l Conf. Data Engineering, Los Angeles, California, Feb. 1987, 580-590. Also in IEEE Trans. Software Eng. 14, 7 (July 1988), 879-885.
[3]
R. Agrawal and H. V. Jagadish, "Multiprocessor Transitive Closure Algorithms", Proc. lnt'l Syrup. Databases in Parallel and Distributed Systems, Austin, Texas, Dec. 1988, 56-66.
[4]
R. Agrawal, A. Borgida and H. V. Jagadish, "Efficient Management of Transitive Relationships in Large Data and Knowledge Bases", AT&T Bell Laboratories Technical Memorandum, Murray Hill, New Jersey, 1989.
[5]
H. Ait-Kaci, R. Boyer, P. Lincoln and R. Nasr, "Efficient Implementation of Lattice Operations", ACM Transactions on Programmng Languages and Systems 11, 1 (Jan. 1989), 115-146.
[6]
F. Bancilhon, "Naive Evaluation of Recursively Defined Relations", Tech. Rept. DB-004-85, MCC, Austin, Texas, 1985.
[7]
J. A. Blakeley, P. A. Larson and F. W. Tompa, "Efficiently Updating Materialized Views", Proc. ACM-SIGMOD 1986 lnt'l Conf. on Management of Data, Washington D.C., May 1986, 61-71.
[8]
A. Borgida, R. J. Brachman, D. L. McGuinness and L. A. Resnick, "CLASSIC: A Structural Data Model for Objects", Proc. ACM-SIGMOD 1989 lnt'l Conf. on Management of Data, Portland, OR, May-June 1989.
[9]
R.J. Brachman and H. J. Levesque, (ed.), Readings in Knowledge Representation, Morgan Kaufmann, 1985.
[10]
R. J. Brachman and J. G. Schmolze, "An Overview of the K~ONE Knowledge Representation System", Cognitive Science 9, 2 (April-June 1985),.
[11]
I. F. Cruz, A. O. Mendelzon and P. T. Wood, "A Graphical Query Language Suplx~rting Recursion", Proc. ACM SIGMOD Conf. on Management of Data, 1986, 16-52.
[12]
P.T. Devanbu, P. G. Selfridge, B. W. Ballard and R. J. Brachman, "Steps Toward a Knowledge-Based Software Information System", AT&T Bell Laboratories Technical Memorandum, Murray Hill, New Jersey, 1989.
[13]
S. E. Fahlman, NETL: A System for Representing and Using Real-World Knowledge, M1T Press, Cambridge, MA, 1979.
[14]
E. Hanson, "A Performance Analysis of View Materialization Strategies", Proc. ACM-SIGMOD 1987 lnt'l Conf. on Management of Data, San Fransisco, California, May 1987, 440-453.
[15]
Y.E. Ioannidis, "On the Computation of the Transitive Closure of Relational Operators", Proc. 12th lnt'l Conf. Very Large Data Bases, Kyoto, Japan, Aug. 1986, 403- 411.
[16]
Y. E. Ioannidis and R. Ramakrishnan, "An Efficient Transitive Closure Algorithm", Proc. 14th Int'l Conf. Very Large Data Bases, Los Angeles, California, Aug.- Sept. 1988.
[17]
G. F. Italiano, "Amortized Efficiency of a Path Retrieval Data Structure", Theoretical Computer Science 48, (1986), 273-281.
[18]
H. V. Jagadish, "A Compressed Transitive Closure Technique for Efficient Fixed-Point Query Processing", Proc. 2nd Int'l Conf. Expert Database Systems, Tysons Comer, Virginia, April 1988.
[19]
H.V. Jagadish, "Incorporating Hierarchy in a Relational Model of Data", Proc. ACM-SIGMOD 1989 Int'l Conf. Management of Data, Portland, Oregon, May-June 1989.
[20]
T. S. Kaczmarek, R. Bates and G. Robins, "Recent Developments in IKL", Proc. AAAI-86, Philadelphia, PA, 1986, 978-985.
[21]
R. Kung, E. Hanson, Y. Ioannidis, T. Sellis, L. Shapiro and M. Stonebraker, "Heuristic Search in Data Base Systems", Proc. 1st lnt'l Workshop Expert Database Systems, Kiawah Island, South Carolina, Oct. 1984, 96- 107.
[22]
H. Lu, "New Strategies for Computing the Transitive Closure of a Database Relation", Proc. 13th Int'l Conf. Very Large Data Bases, Brighton, England, Sept. 1987.
[23]
K. yon Luck, B. Nebel, C. Peltason and A. Schmiedel, "The Anatomy of the BACK System", Kunstliche intelligenz und Textverstehen - Report 41, Technical University of Berlin, Jan. 1987.
[24]
E. Neuhold and M. Stonebraker, "Future Directions in DBMS Research", Tech. Rep.-88-001, Int'l Computer Science Inst., Berkeley, California, May 1988.
[25]
R. A. O'Keefe, "A New Data Structure for Type Trees", in ECAI-84" Advances in Artificial Intelligence, T O'Shea (ed.), Elsevier Science Publishers, 1984.
[26]
P. F. Patel-Sclmeider, "Small can be Beautiful in Knowledge Representation", Proc. IEEE Workshop on Principles of Knowledge-Based Systems, Denver, Colorado, Dec. 1984.
[27]
A. Rosenthal, S. Heiler, U. Dayal and F. Manola, "Traversal Recursion: A Practical Approach to Supporting Recursive Applications", Proc. ACM- SIGMOD 1986 Int'l Conf. on Management of Data, Washington D.C., May 1986, 166-176.
[28]
L. K. Schubert, M. A. Papalaskaris and J. Taugher, "Determining Type, Part, Color, and Time Relationships", IEEE Computer 16, 10 (Oct. 1983), 53- 60.
[29]
P. Valduriez and H. Boral, "Evaluation of Recursive Queries Using Join Indices", Proc. 1st Int'l Conf. Expert Database Systems, Charleston, South Carolina, April 1986, 197-208.
[30]
1. M. Walter, P. C. Lockemann and H. Nagel, "Database Support for Knowledge-Based Image Evaluation", Proc. 13th Int'l Conf. Very Large Data Bases, Brighton, England, Sept. 1987, 3-11.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMOD Record
ACM SIGMOD Record  Volume 18, Issue 2
June 1989
442 pages
  • cover image ACM Conferences
    SIGMOD '89: Proceedings of the 1989 ACM SIGMOD international conference on Management of data
    June 1989
    451 pages
    ISBN:0897913175
    DOI:10.1145/67544
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1989
Published in SIGMOD Volume 18, Issue 2

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)264
  • Downloads (Last 6 weeks)28
Reflects downloads up to 07 Nov 2024

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media