On the public citation graph
A survey of parallel execution strategies for transitive closure and logic programs
0 signed · 71 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-17187-8_37openalex-snapshot
Filtering data flow in deductive databases
inferredcites →https://doi.org/10.1007/3-540-19074-0_82openalex-snapshot
PRISMA database machine: A distributed, main-memory approach
inferredcites →https://doi.org/10.1007/3-540-19129-1_5openalex-snapshot
Rule rewriting methods for efficient implementations of horn logic
inferredcites →https://doi.org/10.1007/3-540-51324-8_43openalex-snapshot
A parallel transitive closure algorithm using hash-based clustering
inferredcites →https://doi.org/10.1007/3-540-53507-1_96openalex-snapshot
Complex transitive closure queries on a fragmented graph
inferredcites →https://doi.org/10.1007/978-1-4612-4980-1_17openalex-snapshot
Naive Evaluation of Recursively Defined Relations
inferredcites →https://doi.org/10.1007/978-3-642-83952-8openalex-snapshot
Logic Programming and Databases
inferredcites →https://doi.org/10.1007/bf01379321openalex-snapshot
Parallel evaluation of the transitive closure of a database relation
inferredcites →https://doi.org/10.1007/bf02242140openalex-snapshot
An improved transitive closure algorithm
inferredcites →https://doi.org/10.1007/bf03037407openalex-snapshot
The Alexander Method — A technique for the processing of recursive axioms in deductive databases
inferredcites →https://doi.org/10.1016/0169-023x(92)90029-bopenalex-snapshot
Algebraic optimization of recursive queries
inferredcites →https://doi.org/10.1016/0743-1066(87)90004-5openalex-snapshot
A generalization of the differential approach to recursive query evaluation
inferredcites →https://doi.org/10.1109/69.43418openalex-snapshot
Moving selections into linear least fixpoint queries
inferredcites →https://doi.org/10.1109/dpds.1988.675001openalex-snapshot
Sharing The Load Of Logic-program Evaluation
inferredcites →https://doi.org/10.1109/dpds.1988.675002openalex-snapshot
Multiprocessor Transitive Closure Algorithms
inferredcites →https://doi.org/10.1109/dpds.1990.113696openalex-snapshot
An experimental performance study of a pipelined recursive query processing strategy
inferredcites →https://doi.org/10.1109/dpds.1990.113697openalex-snapshot
A transitive closure and magic functions machine
inferredcites →https://doi.org/10.1109/icde.1989.47239openalex-snapshot
Aggregative closure: an extension of transitive closure
inferredcites →https://doi.org/10.1109/icde.1990.113477openalex-snapshot
A suitable algorithm for computing partial transitive closures in databases
inferredcites →https://doi.org/10.1109/icde.1991.131482openalex-snapshot
Optimization of generalized transitive closure queries
inferredcites →https://doi.org/10.1109/icde.1993.344036openalex-snapshot
Data fragmentation for parallel transitive closure strategies
inferredcites →https://doi.org/10.1109/pdis.1991.183080openalex-snapshot
Parallel hierarchical evaluation of transitive closure queries
inferredcites →https://doi.org/10.1109/tse.1983.236170openalex-snapshot
Optimization Algorithms for Distributed Queries
inferredcites →https://doi.org/10.1145/103516.103521openalex-snapshot
Towards an algebraic theory of recursion
inferredcites →https://doi.org/10.1145/16856.16859openalex-snapshot
An amateur's introduction to recursive query processing strategies
inferredcites →https://doi.org/10.1145/16856.16870openalex-snapshot
A message passing framework for logical query evaluation
inferredcites →https://doi.org/10.1145/16894.16859openalex-snapshot
An amateur's introduction to recursive query processing strategies
inferredcites →https://doi.org/10.1145/308386.308420openalex-snapshot
Optimizing existential datalog queries
inferredcites →https://doi.org/10.1145/319628.319650openalex-snapshot
Query processing in a system for distributed databases (SDD-1)
inferredcites →https://doi.org/10.1145/360715.360746openalex-snapshot
A modification of Warshall's algorithm for the transitive closure of binary relations
inferredcites →https://doi.org/10.1145/38713.38750openalex-snapshot
A study of transitive closure as a recursion mechanism
inferredcites →https://doi.org/10.1145/38714.38750openalex-snapshot
A study of transitive closure as a recursion mechanism
inferredcites →https://doi.org/10.1145/512950.512957openalex-snapshot
Expression continuity and the formal differentiation of algorithms
inferredcites →https://doi.org/10.1145/567752.567763openalex-snapshot
Universality of data retrieval languages
inferredcites →https://doi.org/10.1145/6012.15399openalex-snapshot
Magic sets and other strange ways to implement logic programs (extended abstract)
inferredcites →https://doi.org/10.1145/66926.66937openalex-snapshot
A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment
inferredcites →https://doi.org/10.1145/800168.811544openalex-snapshot
Induction variables in very high level languages
inferredcites →https://doi.org/10.1145/88636.88888openalex-snapshot
Direct transitive closure algorithms: design and performance evaluation
inferredcites →https://doi.org/10.1145/93597.98723openalex-snapshot
A new paradigm for parallel and distributed rule-processing
inferredcites →https://doi.org/10.1145/93597.98724openalex-snapshot
A framework for the parallel processing of Datalog queries
inferredcites →https://doi.org/10.1145/971701.50245openalex-snapshot
A performance analysis of the gamma database machine
inferredcites →https://doi.org/10.5555/62597.62604openalex-snapshot
Sharing the load of logic-program evaluation
inferredcites →https://doi.org/10.5555/62597.62605openalex-snapshot
Multiprocessor transitive closure algorithms
inferredcites →https://doi.org/10.5860/choice.27-0349openalex-snapshot
A logical language for data and knowledge bases
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-53507-1_96openalex-snapshot
Complex transitive closure queries on a fragmented graph
inferred← citeshttps://doi.org/10.1007/3-540-54132-2_49openalex-snapshot
An overview of parallel strategies for transitive closure on algebraic machines
inferred← citeshttps://doi.org/10.1007/3-540-60608-4_37openalex-snapshot
Practical behavior of parallelization strategies for Datalog
inferred← citeshttps://doi.org/10.1007/bf01264049openalex-snapshot
Parallel database systems: Open problems and new issues
inferred← citeshttps://doi.org/10.1007/bf01421676openalex-snapshot
Parallel processing of graph reachability in databases
inferred← citeshttps://doi.org/10.1016/0169-023x(92)90005-vopenalex-snapshot
The processing of a class of transitive-closure queries on uniprocessor and shared-nothing multiprocessor systems
inferred← citeshttps://doi.org/10.1016/0169-023x(92)90029-bopenalex-snapshot
Algebraic optimization of recursive queries
inferred← citeshttps://doi.org/10.1016/0169-023x(95)00024-mopenalex-snapshot
Set-oriented data mining in relational databases
inferred← citeshttps://doi.org/10.1109/bec.2010.5630890openalex-snapshot
Medical and context data acquisition system for patient home monitoring
inferred← citeshttps://doi.org/10.1109/bigdata.2014.7004240openalex-snapshot
Main memory evaluation of recursive queries on multicore machines
inferred← citeshttps://doi.org/10.1109/icde.1993.344036openalex-snapshot
Data fragmentation for parallel transitive closure strategies
inferred← citeshttps://doi.org/10.1109/icde.2017.226openalex-snapshot
Towards Scalable Non-Monotonic Stream Reasoning via Input Dependency Analysis
inferred← citeshttps://doi.org/10.1109/ideas.2000.880565openalex-snapshot
StreamJoin: a generic database approach to support the class of stream-oriented applications
inferred← citeshttps://doi.org/10.1109/pdis.1993.253087openalex-snapshot
A methodology for evaluating parallel graph algorithms and its application to single source reachability
inferred← citeshttps://doi.org/10.1109/scam.2010.10openalex-snapshot
Parallel Reachability and Escape Analyses
inferred← citeshttps://doi.org/10.1145/152610.152611openalex-snapshot
Query evaluation techniques for large databases
inferred← citeshttps://doi.org/10.1145/945721.945730openalex-snapshot
Toward network data independence
inferred← citeshttps://doi.org/10.13025/16389openalex-snapshot
Expressive RDF stream reasoning via data parallelism in answer set programming
inferred← citeshttps://doi.org/10.3233/sw-180330openalex-snapshot
Enhancing the scalability of expressive stream reasoning via input-driven parallelization
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.