On the public citation graph

Parallel query processing with zigzag trees

https://doi.org/10.1007/bf01228672
0 signed · 45 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-57507-3_12openalex-snapshot
Parallel query processing
inferredcites →https://doi.org/10.1007/978-3-642-82375-6_2openalex-snapshot
Query Processing in R*
inferredcites →https://doi.org/10.1007/bf01277518openalex-snapshot
Optimization of parallel query execution plans in XPRS
inferredcites →https://doi.org/10.1007/bf01277522openalex-snapshot
Dataflow query execution in a parallel main-memory environment
inferredcites →https://doi.org/10.1007/bf03192151openalex-snapshot
Master thesis
inferredcites →https://doi.org/10.1109/69.50903openalex-snapshot
Prototyping Bubba, a highly parallel database system
inferredcites →https://doi.org/10.1109/icde.1992.213178openalex-snapshot
ESQL2: an object-oriented SQL with F-Logic semantics
inferredcites →https://doi.org/10.1109/icde.1992.213205openalex-snapshot
Scheduling and processor allocation for parallel execution of multijoin queries
inferredcites →https://doi.org/10.1109/pdis.1991.183069openalex-snapshot
Dataflow query execution in a parallel main-memory environment
inferredcites →https://doi.org/10.1109/pdis.1991.183107openalex-snapshot
Prototyping DBS3, a shared-memory parallel database system
inferredcites →https://doi.org/10.1109/pdis.1991.183114openalex-snapshot
Compiling control into database queries for parallel execution management
inferredcites →https://doi.org/10.1109/pdis.1993.253066openalex-snapshot
Parallel query processing in DBS3
inferredcites →https://doi.org/10.1145/115790.115813openalex-snapshot
Left-deep vs. bushy trees
inferredcites →https://doi.org/10.1145/122058.122071openalex-snapshot
Parallel database systems
inferredcites →https://doi.org/10.1145/130283.130291openalex-snapshot
Query optimization for parallel execution
inferredcites →https://doi.org/10.1145/130283.130292openalex-snapshot
Exploiting inter-operation parallelism in XPRS
inferredcites →https://doi.org/10.1145/130283.130322openalex-snapshot
Optimization of object-oriented recursive queries using cost-controlled strategies
inferredcites →https://doi.org/10.1145/348.318590openalex-snapshot
Join and Semijoin Algorithms for a Multiprocessor Database Machine
inferredcites →https://doi.org/10.1145/582095.582099openalex-snapshot
Access path selection in a relational database management system
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/66926.66960openalex-snapshot
Dynamic query evaluation plans
inferredcites →https://doi.org/10.1145/66926.66961openalex-snapshot
Optimization of large join queries: combining heuristics and combinatorial techniques
inferredcites →https://doi.org/10.1145/67544.66937openalex-snapshot
A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment
inferredcites →https://doi.org/10.1145/67544.66960openalex-snapshot
Dynamic query evaluation plans
inferredcites →https://doi.org/10.1145/67544.66961openalex-snapshot
Optimization of large join queries: combining heuristics and combinatorial techniques
inferredcites →https://doi.org/10.1145/93597.98720openalex-snapshot
Encapsulation of parallelism in the Volcano query processing system

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/bf02962206openalex-snapshot
Performance evaluation of a parallel cascade semijoin algorithm for computing path expressions in object database systems
inferred← citeshttps://doi.org/10.1016/0020-0190(95)94067-3openalex-snapshot
Query processing for multimedia applications on optical media
inferred← citeshttps://doi.org/10.1016/0306-4379(94)90017-5openalex-snapshot
Industrial-strength parallel query optimization: Issues and lessons
inferred← citeshttps://doi.org/10.1016/j.bdr.2019.07.002openalex-snapshot
Parallelizing Computations of Full Disjunctions
inferred← citeshttps://doi.org/10.1016/s0167-739x(99)00080-1openalex-snapshot
Managing the operator ordering problem in parallel databases
inferred← citeshttps://doi.org/10.1109/69.506710openalex-snapshot
Parallel optimization of large join queries with set operators and aggregates in a parallel environment supporting pipeline
inferred← citeshttps://doi.org/10.1109/88.494602openalex-snapshot
Benchmarking the DBS3 parallel query optimizer
inferred← citeshttps://doi.org/10.1109/dasfaa.2001.916385openalex-snapshot
Comparison of parallel algorithms for path expression query in object database systems
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00299openalex-snapshot
Nested Loops Revisited Again
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00446openalex-snapshot
LakeHarbor: Making Structures First-Class Citizens in Data Lakes
inferred← citeshttps://doi.org/10.1109/tkde.2010.248openalex-snapshot
MAP-JOIN-REDUCE: Toward Scalable and Efficient Data Analysis on Large Clusters
inferred← citeshttps://doi.org/10.1145/1068009.1068134openalex-snapshot
Learning computer programs with the bayesian optimization algorithm
inferred← citeshttps://doi.org/10.1145/3318464.3384406openalex-snapshot
Re-evaluating the Performance Trade-offs for Hash-Based Multi-Join Queries
inferred← citeshttps://doi.org/10.1145/3698038.3698565openalex-snapshot
Memory Management in Complex Join Queries: A Re-evaluation Study
inferred← citeshttps://doi.org/10.1360/ssi-2019-0179openalex-snapshot
RLO: a reinforcement learning-based method for join optimization
inferred← citeshttps://doi.org/10.14778/3415478.3415571openalex-snapshot
Out-of-order execution of database queries
inferred← citeshttps://doi.org/10.3390/electronics12061504openalex-snapshot
Query Join Order Optimization Method Based on Dynamic Double Deep Q-Network
inferred← citeshttps://doi.org/10.48550/arxiv.1808.03196openalex-snapshot
Learning to Optimize Join Queries With Deep Reinforcement Learning
inferred← citeshttps://doi.org/10.5120/10723-5620openalex-snapshot
Eliminating Homogeneous Cluster Setup for Efficient Parallel Data Processing
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.