Transitive closure algorithms for very large databases-Reference-Cited by-同舟云学术

Transitive closure algorithms for very large databases

Published:1989 Issue: Volume: Page:122-147
ISSN:0302-9743
Container-title:Graph-Theoretic Concepts in Computer Science
language:
Short-container-title:

Author:

Biskup Joachim,Stiefeling Holger

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-50728-0_39.pdf

Reference21 articles.

1. Agrawal, R., "Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries," Proc. IEEE 3rd Int. Conf. Data Engineering, Los Angeles, Feb. 1987, pp. 580–590.

2. Agrawal, R., Dar, S., Jagadish, H.V., "Transitive Closure Algorithms Revisited: The Case of Path Computations," Submitted for publication.

3. Agrawal, R., Jagadish, H.V., "Direct Algorithms for Computing the Transitive Closure of Database Relations," Proc. of the 13th VLDB Conf., Brighton 1987, pp. 255–266.

4. Biskup, J., Raesch, U., Stiefeling, H., "An Extended Relational Query Language for Knowledgebase Support," Hildesheimer Informatik-Berichte, 1987, Hochschule Hildesheim.

5. Biskup, J., Raesch, U., Stiefeling, H., "Report on Structure and Complexity of Several Augmented Relational Algebras," ESPRIT Project 311: ADKMS, Deliverable D12.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Practical RDF Schema Reasoning with Annotated Semantic Web Data;The Semantic Web – ISWC 2011;2011

2. An efficient database transitive closure algorithm;Applied Intelligence;1994-05

3. Evaluation of upper bounds and least nodes as database operations;Foundations of Data Organization and Algorithms;1993

4. Decomposition of linear recursive logic programs;Graph-Theoretic Concepts in Computer Science;1991