The efficient computation of strong partial transitive-closures
- 30 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 530-537
- https://doi.org/10.1109/icde.1993.344027
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- New transitive closure algorithm for recursive query processing in deductive databasesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A spanning tree transitive closure algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A suitable algorithm for computing partial transitive closures in databasesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient algorithms for the instantiated transitive closure queriesIEEE Transactions on Software Engineering, 1991
- Join processing in database systems with large main memoriesACM Transactions on Database Systems, 1986
- An amateur's introduction to recursive query processing strategiesACM SIGMOD Record, 1986
- Implementation techniques for main memory database systemsPublished by Association for Computing Machinery (ACM) ,1984