On the transitive closure representation and adjustable compression
Authors:
Open Access
- 23 April 2006
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 450-455
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- On the graph traversal and linear binary-chain programsIEEE Transactions on Knowledge and Data Engineering, 2003
- A survey of deductive database systemsThe Journal of Logic Programming, 1995
- Transitive closure algorithms based on graph traversalACM Transactions on Database Systems, 1993
- Direct transitive closure algorithms: design and performance evaluationACM Transactions on Database Systems, 1990
- The implementation of POSTGRESIEEE Transactions on Knowledge and Data Engineering, 1990
- Clustering a DAG for CAD databasesIEEE Transactions on Software Engineering, 1988
- Join processing in database systems with large main memoriesACM Transactions on Database Systems, 1986
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- A modification of Warshall's algorithm for the transitive closure of binary relationsCommunications of the ACM, 1975
- A transitive closure algorithmBIT Numerical Mathematics, 1970