On the public citation graph

A hierarchical approach to parallel multiquery scheduling

0 signed · 52 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.1057/jors.1989.116openalex-snapshot
Resource Allocation Problems: Algorithmic Approaches
inferredcites →https://doi.org/10.1109/12.165388openalex-snapshot
Optimal partitioning of cache memory
inferredcites →https://doi.org/10.1109/12.214665openalex-snapshot
An approximation algorithm for scheduling tasks on varying partition sizes in partitionable multiprocessor systems
inferredcites →https://doi.org/10.1109/32.129222openalex-snapshot
On workload characterization of relational database environments
inferredcites →https://doi.org/10.1109/69.50905openalex-snapshot
The Gamma database machine project
inferredcites →https://doi.org/10.1109/69.63253openalex-snapshot
Effectiveness of parallel joins
inferredcites →https://doi.org/10.1109/71.205654openalex-snapshot
A parallel sort merge join algorithm for managing data skew
inferredcites →https://doi.org/10.1109/icde.1990.113475openalex-snapshot
System issues in parallel sorting for database systems
inferredcites →https://doi.org/10.1109/icde.1990.113500openalex-snapshot
A multiuser performance analysis of alternative declustering strategies
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/icde.1991.131500openalex-snapshot
Optimal buffer partitioning for the nested block join algorithm
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.183115openalex-snapshot
Parallel sorting on a shared-nothing architecture using probabilistic splitting
inferredcites →https://doi.org/10.1109/pdis.1993.253075openalex-snapshot
The Kendall Square Query Decomposer
inferredcites →https://doi.org/10.1109/sfcs.1991.185361openalex-snapshot
Scheduling parallel machines on-line
inferredcites →https://doi.org/10.1137/0117039openalex-snapshot
Bounds on Multiprocessing Timing Anomalies
inferredcites →https://doi.org/10.1137/0209062openalex-snapshot
Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
inferredcites →https://doi.org/10.1137/0209064openalex-snapshot
Orthogonal Packings in Two Dimensions
inferredcites →https://doi.org/10.1137/0212033openalex-snapshot
Shelf Algorithms for Two-Dimensional Packing Problems
inferredcites →https://doi.org/10.1137/0221021openalex-snapshot
A Heuristic of Scheduling Parallel Tasks and Its Analysis
inferredcites →https://doi.org/10.1137/0402042openalex-snapshot
Complexity of Scheduling Parallel Task Systems
inferredcites →https://doi.org/10.1145/1007771.55624openalex-snapshot
Optimal allocation of multiple class resources in computer systems
inferredcites →https://doi.org/10.1145/129888.129894openalex-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/133057.133111openalex-snapshot
Scheduling parallelizable tasks
inferredcites →https://doi.org/10.1145/140901.141909openalex-snapshot
Approximate algorithms scheduling parallelizable tasks
inferredcites →https://doi.org/10.1145/170035.170053openalex-snapshot
On optimal processor allocation to support pipelined hash joins
inferredcites →https://doi.org/10.1145/181014.181331openalex-snapshot
Scheduling parallelizable tasks to minimize average response time
inferredcites →https://doi.org/10.1145/191839.191879openalex-snapshot
On parallel execution of multiple pipelined hash joins
inferredcites →https://doi.org/10.1145/214419.214421openalex-snapshot
VAXcluster
inferredcites →https://doi.org/10.1145/319057.319060openalex-snapshot
Parallelism in relational data base 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/66926.66961openalex-snapshot
Optimization of large join queries: combining heuristics and combinatorial techniques
inferredcites →https://doi.org/10.2307/2529486openalex-snapshot
Exploratory Data Analysis
inferredcites →https://doi.org/10.5555/314464.314485openalex-snapshot
Scheduling parallel tasks to minimize average response time

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470391365.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/978-1-84882-310-5_2openalex-snapshot
Basics
inferred← citeshttps://doi.org/10.1007/978-1-84882-310-5_5openalex-snapshot
Parallel Tasks
inferred← citeshttps://doi.org/10.1007/bfb0002866openalex-snapshot
Database program mapping onto a shared-nothing multiprocessor architecture: Minimizing communication costs
inferred← citeshttps://doi.org/10.1016/j.dam.2007.08.008openalex-snapshot
Scheduling malleable tasks with interdependent processing rates: Comments and observations
inferred← citeshttps://doi.org/10.1016/s0020-0255(03)00152-xopenalex-snapshot
The impact of load balancing to object-oriented query execution scheduling in parallel machine environment
inferred← citeshttps://doi.org/10.1016/s0950-5849(98)00111-6openalex-snapshot
Query execution scheduling in parallel object-oriented databases
inferred← citeshttps://doi.org/10.1080/1206212x.2004.11441731openalex-snapshot
Deductive Query Processing with an Object-Oriented Semantic Network in a Massively Parallel Environment
inferred← citeshttps://doi.org/10.1109/3468.983424openalex-snapshot
A shelf-based Lagrangian relaxation algorithm to schedule parallelizable tasks
inferred← citeshttps://doi.org/10.1109/69.506709openalex-snapshot
Optimization of parallel execution for multi-join queries
inferred← citeshttps://doi.org/10.1109/gcc.2007.40openalex-snapshot
Allocating Resources to Parallel Query Plans in Data Grids
inferred← citeshttps://doi.org/10.1109/hpc.2000.843559openalex-snapshot
Multiple query optimization in PBASE/3
inferred← citeshttps://doi.org/10.1109/icapp.1997.651534openalex-snapshot
Multiple dependent queries execution using critical path scheduling in parallel databases
inferred← citeshttps://doi.org/10.1109/tkde.2018.2884724openalex-snapshot
Scheduling Resources to Multiple Pipelines of One Query in a Main Memory Database Cluster
inferred← citeshttps://doi.org/10.2316/journal.202.2004.2.202-1266openalex-snapshot
Deductive Query Processing with an Object-Oriented Semantic Network in a Massively Parallel Environment
inferred← citeshttps://doi.org/10.48550/arxiv.1403.7729openalex-snapshot
Multi-Resource Parallel Query Scheduling and Optimization
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.