Materialization and Incremental Update of Path Information.

@inproceedings{DBLP:conf/icde/AgrawalJ89,
  author    = {Rakesh Agrawal and
               H. V. Jagadish},
  title     = {Materialization and Incremental Update of Path Information},
  booktitle = {Proceedings of the Fifth International Conference on Data Engineering,
               February 6-10, 1989, Los Angeles, California, USA},
  publisher = {IEEE Computer Society},
  year      = {1989},
  isbn      = {0-8186-1915-5},
  pages     = {374-383},
  ee        = {db/conf/icde/AgrawalJ89.html},
  crossref  = {DBLP:conf/icde/89},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1989 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An2-6 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Printed Edition

References

[1]

Rakesh Agrawal, David J. DeWitt: Updating Hypothetical Data Bases. Inf. Process. Lett. 16(3): 145-146(1983)

[2]

...

[3]

Rakesh Agrawal: Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries. IEEE Trans. Software Eng. 14(7): 879-885(1988)

[4]

Rakesh Agrawal, H. V. Jagadish: Direct Algorithms for Computing the Transitive Closure of Database Relations. VLDB 1987: 255-266

[5]

...

[6]

Rakesh Agrawal, H. V. Jagadish: Multiprocessor Transitive Closure Algorithms. DPDS 1988: 56-66

[7]

Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, ISBN 0-201-00029-6

[8]

...

[9]

José A. Blakeley, Per-Åke Larson, Frank Wm. Tompa: Efficiently Updating Materialized Views. SIGMOD Conference 1986: 61-71

[10]

...

[11]

Eric N. Hanson: A Performance Analysis of View Materialization Strategies. SIGMOD Conference 1987: 440-453

[12]

Yannis E. Ioannidis: On the Computation of the Transitive Closure of Relational Operators. VLDB 1986: 403-411

[13]

H. V. Jagadish: A Compressed Transitive Closure Technique for Efficient Fixed-Point Query Processing. Expert Database Conf. 1988: 423-446

[14]

Hongjun Lu: New Strategies for Computing the Transitive Closure of a Database Relation. VLDB 1987: 267-274

[15]

...

[16]

Arnon Rosenthal, Sandra Heiler, Umeshwar Dayal, Frank Manola: Traversal Recursion: A Practical Approach to Supporting Recursive Applications. SIGMOD Conference 1986: 166-176

[17]

Michael Stonebraker: Hypothetical Data Bases as Views. SIGMOD Conference 1981: 224-229

[18]

David S. Touretzky: The Mathematics of Inheritance Systems. Morgan Kaufmann 1986, ISBN 0-934613-06-0

[19]

Patrick Valduriez, Haran Boral: Evaluation of Recursive Queries Using Join Indices. Expert Database Conf. 1986: 271-293

[20]

Patrick Valduriez: Join Indices. ACM Trans. Database Syst. 12(2): 218-246(1987)

[21]

Stephen Warshall: A Theorem on Boolean Matrices. J. ACM 9(1): 11-12(1962)