Making the Partial Transitive Closure an Elementary Database Operation
- 1 January 1989
- book chapter
- Published by Springer Nature in Informatik-Fachberichte
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Moving selections into linear least fixpoint queriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The processing and evaluation of transitive closure queriesPublished by Springer Nature ,1988
- Efficient evaluation for a subset of recursive queriesPublished by Association for Computing Machinery (ACM) ,1987
- On the power of magicPublished by Association for Computing Machinery (ACM) ,1987
- On the evaluation of recursion in (deductive) database systems by efficient differential fixpoint iterationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Handling redundancy in the processing of recursive database queriesPublished by Association for Computing Machinery (ACM) ,1987
- An amateur's introduction to recursive query processing strategiesPublished by Association for Computing Machinery (ACM) ,1986
- Access methods for textACM Computing Surveys, 1985
- Logic and Databases: A Deductive ApproachACM Computing Surveys, 1984
- On a routing problemQuarterly of Applied Mathematics, 1958