Complex transitive closure queries on a fragmented graph
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 470-484
- https://doi.org/10.1007/3-540-53507-1_96
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Sharing The Load Of Logic-program EvaluationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Multiprocessor Transitive Closure AlgorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- An overview of parallel strategies for transitive closure on algebraic machinesPublished by Springer Nature ,1991
- Integrating object-oriented data modelling with a rule-based programming paradigmPublished by Association for Computing Machinery (ACM) ,1990
- A framework for the parallel processing of Datalog queriesPublished by Association for Computing Machinery (ACM) ,1990
- Logic Programming and DatabasesPublished by Springer Nature ,1990
- Efficient management of transitive relationships in large data and knowledge basesPublished by Association for Computing Machinery (ACM) ,1989
- A file structure supporting traversal recursionPublished by Association for Computing Machinery (ACM) ,1989
- PRISMA database machine: A distributed, main-memory approachPublished by Springer Nature ,1988
- Magic sets and other strange ways to implement logic programs (extended abstract)Published by Association for Computing Machinery (ACM) ,1985