On the public citation graph

A hash partition strategy for distributed query processing

0 signed · 35 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.1109/32.24731openalex-snapshot
Partition strategy for distributed query processing in fast local networks
inferredcites →https://doi.org/10.1109/32.6175openalex-snapshot
Optimizing join queries in distributed databases
inferredcites →https://doi.org/10.1109/69.87981openalex-snapshot
Automatic knowledge acquisition and maintenance for semantic query optimization
inferredcites →https://doi.org/10.1109/71.238624openalex-snapshot
Performance issues in distributed query processing
inferredcites →https://doi.org/10.1109/icdcs.1992.235015openalex-snapshot
Validation and performance evaluation of the partition and replicate algorithm
inferredcites →https://doi.org/10.1109/icde.1990.113500openalex-snapshot
A multiuser performance analysis of alternative declustering strategies
inferredcites →https://doi.org/10.1145/114325.103713openalex-snapshot
Optimizing equijoin queries in distributed databases where relations are hash partitioned
inferredcites →https://doi.org/10.1145/170035.170078openalex-snapshot
Predicate migration
inferredcites →https://doi.org/10.1145/191839.191904openalex-snapshot
Practical predicate placement
inferredcites →https://doi.org/10.1145/3148.3161openalex-snapshot
Database partitioning in a cluster of processors
inferredcites →https://doi.org/10.1145/322234.322238openalex-snapshot
Using Semi-Joins to Solve Relational Queries
inferredcites →https://doi.org/10.1145/331119.331174openalex-snapshot
A heuristic algorithm for partition strategy in distributed query processing
inferredcites →https://doi.org/10.1145/348.318590openalex-snapshot
Join and Semijoin Algorithms for a Multiprocessor Database Machine
inferredcites →https://doi.org/10.1145/509252.509292openalex-snapshot
Distributed query processing in a relational data base system
inferredcites →https://doi.org/10.1145/582192.582201openalex-snapshot
Distributing a database for parallelism
inferredcites →https://doi.org/10.1145/5922.5638openalex-snapshot
Fragmentation: a technique for efficient query processing
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

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11549468_42openalex-snapshot
Hierarchical Aggregation in Networked Data Management
inferred← citeshttps://doi.org/10.1007/978-3-540-30076-2_4openalex-snapshot
Workload-Based Placement and Join Processing in Node-Partitioned Data Warehouses
inferred← citeshttps://doi.org/10.1007/978-3-540-85176-9_6openalex-snapshot
Dynamic Source Selection in Large Scale Mediation Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-33078-0_34openalex-snapshot
Overcoming the Scalability Limitations of Parallel Star Schema Data Warehouses
inferred← citeshttps://doi.org/10.1007/978-3-642-34624-8_47openalex-snapshot
Providing Timely Results with an Elastic Parallel DW
inferred← citeshttps://doi.org/10.1109/cis.2019.00035openalex-snapshot
NOLGP: A Novel Optimized Large-Scale Graph Partitioning Algorithm
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00075openalex-snapshot
Scaling Out Schema-free Stream Joins
inferred← citeshttps://doi.org/10.1109/icpads.2004.1316088openalex-snapshot
Hash-based placement and processing for efficient node partitioned query-intensive databases
inferred← citeshttps://doi.org/10.1109/icsea.2006.261299openalex-snapshot
Data Based Application Partitioning and Workload Balance in Distributed Environment
inferred← citeshttps://doi.org/10.1109/icsm.2007.4362662openalex-snapshot
Experience Report: Reengineering Standalone System into the Service-Partition Distributed Environment
inferred← citeshttps://doi.org/10.1109/ideas.2004.1319785openalex-snapshot
Algorithms for efficient processing of complex queries in node-partitioned data warehouses
inferred← citeshttps://doi.org/10.1109/ideas.2004.9openalex-snapshot
Algorithms for efficient processing of complex queries in node-partitioned data warehouses
inferred← citeshttps://doi.org/10.1109/ipdps.2005.194openalex-snapshot
Efficiently Processing Query-Intensive Databases over a Non-Dedicated Local Network
inferred← citeshttps://doi.org/10.1145/1031763.1031769openalex-snapshot
Experimental evidence on partitioning in parallel data warehouses
inferred← citeshttps://doi.org/10.1145/1134285.1134359openalex-snapshot
Reengineering standalone C++ legacy systems into the J2EE partition distributed environment
inferred← citeshttps://doi.org/10.1145/1341771.1341789openalex-snapshot
An integrated query optimization system for data grids
inferred← citeshttps://doi.org/10.1145/2351476.2351480openalex-snapshot
TEEPA
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.