On the public citation graph
Considering data skew factor in multi-way join query optimization for parallel execution
0 signed · 36 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/bf01277518openalex-snapshot
Optimization of parallel query execution plans in XPRS
inferredcites →https://doi.org/10.1007/bf03037022openalex-snapshot
Application of hash to data base machine and its architecture
inferredcites →https://doi.org/10.1016/0743-7315(92)90019-jopenalex-snapshot
Algorithms for handling skew in parallel task scheduling
inferredcites →https://doi.org/10.1109/69.50903openalex-snapshot
Prototyping Bubba, a highly parallel database system
inferredcites →https://doi.org/10.1109/dpds.1988.675008openalex-snapshot
Effect of Skew on Join Performance in Parallel Architectures
inferredcites →https://doi.org/10.1109/dpds.1990.113702openalex-snapshot
An effective algorithm for parallelizing sort merge joins in the presence of data skew
inferredcites →https://doi.org/10.1109/icde.1989.47254openalex-snapshot
Limiting factors of join performance on parallel processors
inferredcites →https://doi.org/10.1109/icde.1991.131467openalex-snapshot
An effective algorithm for parallelizing hash joins in the presence of data skew
inferredcites →https://doi.org/10.1109/pdis.1991.183070openalex-snapshot
Comparative performance of parallel join algorithms
inferredcites →https://doi.org/10.1109/pdis.1991.183106openalex-snapshot
Optimization of parallel query execution plans in XPRS
inferredcites →https://doi.org/10.1109/pdis.1993.253068openalex-snapshot
Including the load balancing issue in the optimization of multi-way join queries for shared-nothing database computers
inferredcites →https://doi.org/10.1145/143559.143653openalex-snapshot
Processing multi-join query in parallel systems
inferredcites →https://doi.org/10.1145/319057.319072openalex-snapshot
An effective algorithm for parallelizing sort merge joins in the presence of data skew
inferredcites →https://doi.org/10.1145/320473.320479openalex-snapshot
Decomposition—a strategy for query processing
inferredcites →https://doi.org/10.1145/582095.582099openalex-snapshot
Access path selection in a relational database management system
inferredcites →https://doi.org/10.1145/5922.5638openalex-snapshot
Fragmentation: a technique for efficient query processing
inferredcites →https://doi.org/10.1145/602259.602261openalex-snapshot
Implementation techniques for main memory database systems
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/67544.66937openalex-snapshot
A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment
inferredcites →https://doi.org/10.1145/98457.98766openalex-snapshot
A benchmark of NonStop SQL release 2 demonstrating near-linear speedup and scaleup on large databases
inferredcites →https://doi.org/10.1147/rd.355.0681openalex-snapshot
Exploiting database parallelism in a message-passing multiprocessor
inferredcites →https://doi.org/10.5555/62597.62611openalex-snapshot
Effect of skew on join performance in parallel architectures
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-48309-8_9openalex-snapshot
Cluster-Based Database Selection Techniques for Routing Bibliographic Queries
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_4openalex-snapshot
Dynamic load balancing in parallel database systems
inferred← citeshttps://doi.org/10.1007/978-3-642-12082-4openalex-snapshot
Advances in Databases and Information Systems
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.404036openalex-snapshot
Applying segmented right-deep trees to pipelining multiple hash joins
inferred← citeshttps://doi.org/10.1109/69.476502openalex-snapshot
Dynamic load balancing in multicomputer database systems using partition tuning
inferred← citeshttps://doi.org/10.1109/69.506709openalex-snapshot
Optimization of parallel execution for multi-join queries
inferred← citeshttps://doi.org/10.1109/icdsc.2001.918974openalex-snapshot
Distributed query processing in the Internet: exploring relation replication and network characteristics
inferred← citeshttps://doi.org/10.1109/icpads.2002.1183392openalex-snapshot
Effective skew handling for parallel sorting in multiprocessor database systems
inferred← citeshttps://doi.org/10.1145/1516360.1516452openalex-snapshot
Self-tuning query mesh for adaptive multi-route query processing
inferred← citeshttps://doi.org/10.1145/2602138openalex-snapshot
Robust Distributed Query Processing for Streaming Data
inferred← citeshttps://doi.org/10.1145/276675.276707openalex-snapshot
Database selection techniques for routing bibliographic queries
inferred← citeshttps://doi.org/10.14236/ewic/adbis1997.7openalex-snapshot
ModParOpt: a Modular Query Optimizer for Multi-query Parallel Databases
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.