Aggregative Closure: An Extension of Transitive Closure.
Isabel F. Cruz, Theodore S. Norvell:
Aggregative Closure: An Extension of Transitive Closure.
ICDE 1989: 384-391@inproceedings{DBLP:conf/icde/CruzN89,
author = {Isabel F. Cruz and
Theodore S. Norvell},
title = {Aggregative Closure: An Extension of Transitive Closure},
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 = {384-391},
ee = {db/conf/icde/CruzN89.html},
crossref = {DBLP:conf/icde/89},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Abstract
Copyright © 1989 by The Institute of
Electrical and Electronic Engineers, Inc. (IEEE).
Abstract used with permission.
CDROM Version: Load the CDROM "Volume 2 Issue 6, ICDE 1984-1995" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
BibTeX
Printed Edition
Proceedings of the Fifth International Conference on Data Engineering, February 6-10, 1989, Los Angeles, California, USA.
IEEE Computer Society 1989, ISBN 0-8186-1915-5
Contents BibTeX
References
- [AHU74]
- Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
The Design and Analysis of Computer Algorithms.
Addison-Wesley 1974, ISBN 0-201-00029-6
BibTeX
- [AhUl79]
- Alfred V. Aho, Jeffrey D. Ullman:
The Universality of Data Retrieval Languages.
POPL 1979: 110-120 BibTeX
- [Agra87]
- Rakesh Agrawal:
Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries.
ICDE 1987: 580-590 BibTeX
- [AgJa87]
- Rakesh Agrawal, H. V. Jagadish:
Direct Algorithms for Computing the Transitive Closure of Database Relations.
VLDB 1987: 255-266 BibTeX
- [ADJ88]
- ...
- [BaRa86]
- François Bancilhon, Raghu Ramakrishnan:
An Amateur's Introduction to Recursive Query Processing Strategies.
SIGMOD Conference 1986: 16-52 BibTeX
- [Carr79]
- ...
- [Cruz87]
- ...
- [CMW87]
- Isabel F. Cruz, Alberto O. Mendelzon, Peter T. Wood:
A Graphical Query Language Supporting Recursion.
SIGMOD Conference 1987: 323-330 BibTeX
- [CrMe88]
- ...
- [CMW88]
- Isabel F. Cruz, Alberto O. Mendelzon, Peter T. Wood:
G+: Recursive Queries Without Recursion.
Expert Database Conf. 1988: 645-666 BibTeX
- [DBGHM85]
- ...
- [Floy62]
- ...
- [GaMi78]
- Hervé Gallaire, Jack Minker (Eds.):
Logic and Data Bases, Symposium on Logic and Data Bases, Centre d'études et de recherches de Toulouse, 1977.
Advances in Data Base Theory Plemum Press 1978, ISBN 0-306-40060-X
Contents BibTeX
- [Ioan86]
- Yannis E. Ioannidis:
On the Computation of the Transitive Closure of Relational Operators.
VLDB 1986: 403-411 BibTeX
- [IoRa88]
- Yannis E. Ioannidis, Raghu Ramakrishnan:
Efficient Transitive Closure Algorithms.
VLDB 1988: 382-394 BibTeX
- [Lu87]
- Hongjun Lu:
New Strategies for Computing the Transitive Closure of a Database Relation.
VLDB 1987: 267-274 BibTeX
- [LMR87]
- Hongjun Lu, Krishna P. Mikkilineni, James P. Richardson:
Design and Evaluation of Algorithms to Compute the Transitive Closure of a Database Relation.
ICDE 1987: 112-119 BibTeX
- [Mehl84]
- ...
- [O'NO'73]
- ...
- [RHDM86]
- Arnon Rosenthal, Sandra Heiler, Umeshwar Dayal, Frank Manola:
Traversal Recursion: A Practical Approach to Supporting Recursive Applications.
SIGMOD Conference 1986: 166-176 BibTeX
- [VaBo86]
- Patrick Valduriez, Haran Boral:
Evaluation of Recursive Queries Using Join Indices.
Expert Database Conf. 1986: 271-293 BibTeX
- [Warr75]
- Henry S. Warren Jr.:
A Modification of Warshall's Algorithm for the Transitive Closure of Binary Relations.
Commun. ACM 18(4): 218-220(1975) BibTeX
- [Wars62]
- Stephen Warshall:
A Theorem on Boolean Matrices.
J. ACM 9(1): 11-12(1962) BibTeX
Referenced by
- Martin Erwig, Ralf Hartmut Güting:
Explicit Graphs in a Functional Model for Spatial Databases.
IEEE Trans. Knowl. Data Eng. 6(5): 787-804(1994)
- Rakesh Agrawal, H. V. Jagadish:
Algorithms for Searching Massive Graphs.
IEEE Trans. Knowl. Data Eng. 6(2): 225-238(1994)
- Ralf Hartmut Güting:
GraphDB: Modeling and Querying Graphs in Databases.
VLDB 1994: 297-308
- Alejandro Gutiérrez, Philippe Pucheral, Hermann Steffen, Jean-Marc Thévenin:
Database Graph Views: A Practical Model to Manage Persistent Graphs.
VLDB 1994: 391-402
- Yannis E. Ioannidis, Raghu Ramakrishnan, Linda Winger:
Transitive Closure Algorithms Based on Graph Traversal.
ACM Trans. Database Syst. 18(3): 512-576(1993)
- Shaul Dar, Rakesh Agrawal:
Extending SQL with Generalized Transitive Closure Functionality.
IEEE Trans. Knowl. Data Eng. 5(5): 799-812(1993)
- Shashi Shekhar, Ashim Kohli, Mark Coyle:
Path Computation Algorithms for Advanced Traveller Information System (ATIS).
ICDE 1993: 31-39
- Bin Jiang:
I/O-Efficiency of Shortest Path Algorithms: An Analysis.
ICDE 1992: 12-19
- Shaul Dar, H. V. Jagadish:
A Spanning Tree Transitive Closure Algorithm.
ICDE 1992: 2-11
- S. Sudarshan, Raghu Ramakrishnan:
Aggregation and Relevance in Deductive Databases.
VLDB 1991: 501-511
- Shaul Dar, Rakesh Agrawal, H. V. Jagadish:
Optimization of Generalized Transitive Closure Queries.
ICDE 1991: 345-354
- Rakesh Agrawal, H. V. Jagadish:
Hybrid Transitive Closure Algorithms.
VLDB 1990: 326-334
- Mariano P. Consens, Alberto O. Mendelzon:
Low Complexity Aggregation in GraphLog and Datalog.
ICDT 1990: 379-394
- Jeffrey D. Ullman:
Principles of Database and Knowledge-Base Systems, Volume II.
Computer Science Press 1989, ISBN 0-7167-8162-X
Contents
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
ICDE Proceedings: Copyright © by IEEE,
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:17:46 2009