On the public citation graph
Optimizing joins in fragmented database systems on a broadcast local network
0 signed · 38 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.1006/jpdc.1996.0054openalex-snapshot
An Analysis of Degenerate Sharing and False Coherence
inferredcites →https://doi.org/10.1016/0141-9331(85)90187-5openalex-snapshot
Computer architecture and parallel processing
inferredcites →https://doi.org/10.1016/0306-4379(83)90035-2openalex-snapshot
Estimating record selectivities
inferredcites →https://doi.org/10.1016/0306-4379(86)90021-9openalex-snapshot
Taxonomy and formal properties of distributed joins
inferredcites →https://doi.org/10.1016/0743-7315(86)90003-1openalex-snapshot
Optimizing joins between two partitioned relations in distributed databases
inferredcites →https://doi.org/10.1109/tc.1984.1676370openalex-snapshot
Improvement Algorithms for Semijoin Query Processing Programs in Distributed Database Systems
inferredcites →https://doi.org/10.1109/tse.1979.234179openalex-snapshot
Query Processing in Distributed Database System
inferredcites →https://doi.org/10.1109/tse.1983.236170openalex-snapshot
Optimization Algorithms for Distributed Queries
inferredcites →https://doi.org/10.1109/tse.1985.231857openalex-snapshot
An Optimal Algorithm for Processing Distributed Star Queries
inferredcites →https://doi.org/10.1109/tse.1985.232505openalex-snapshot
Design of Distributed Databases on Local Computer Systems with a Multiaccess Network
inferredcites →https://doi.org/10.1109/tse.1985.232528openalex-snapshot
Query Processing in a Fragmented Relational Distributed System: Mermaid
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/322234.322238openalex-snapshot
Using Semi-Joins to Solve Relational Queries
inferredcites →https://doi.org/10.1145/362384.362685openalex-snapshot
A relational model of data for large shared data banks
inferredcites →https://doi.org/10.1145/509252.509292openalex-snapshot
Distributed query processing in a relational data base system
inferredcites →https://doi.org/10.1145/5236.5241openalex-snapshot
Optimization of join operations in horizontally partitioned database systems
inferredcites →https://doi.org/10.1145/582318.582343openalex-snapshot
Evaluation of the size of a query expressed in relational algebra
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-57234-1_11openalex-snapshot
Predict query processing cost in a distributed database system
inferred← citeshttps://doi.org/10.1016/0020-0255(93)90127-8openalex-snapshot
Minimum-weight vertex cover problem for two-class resource connection graphs
inferred← citeshttps://doi.org/10.1016/0165-6074(90)90311-vopenalex-snapshot
Join optimization in distributed databases on broadcast network
inferred← citeshttps://doi.org/10.1016/0306-4379(90)90025-kopenalex-snapshot
A robust protocol for distributed query processing on a local area network
inferred← citeshttps://doi.org/10.1016/0306-4379(91)90014-zopenalex-snapshot
Optimizing joins between two fragmented relations on a broadcast local network
inferred← citeshttps://doi.org/10.1016/0306-4379(91)90028-8openalex-snapshot
Optimization of join strategies in distributed databases
inferred← citeshttps://doi.org/10.1016/0306-4379(93)90001-hopenalex-snapshot
Query processing in distributed databases with nondisjoint data
inferred← citeshttps://doi.org/10.1016/s0020-0255(98)10069-5openalex-snapshot
Extension of the one-shot semijoin strategy to minimize data transmission cost in distributed query processing
inferred← citeshttps://doi.org/10.1023/a:1008617911992openalex-snapshot
Adaptive Algorithms for Join Processing in Distributed Database Systems
inferred← citeshttps://doi.org/10.1023/a:1018967414664openalex-snapshot
Optimizing distributed join queries: A genetic algorithm approach
inferred← citeshttps://doi.org/10.1109/69.536256openalex-snapshot
On the complexity of distributed query optimization
inferred← citeshttps://doi.org/10.1109/69.940737openalex-snapshot
Criss-cross hash joins: design and analysis
inferred← citeshttps://doi.org/10.1109/71.238624openalex-snapshot
Performance issues in distributed query processing
inferred← citeshttps://doi.org/10.1109/icdcs.1992.235015openalex-snapshot
Validation and performance evaluation of the partition and replicate algorithm
inferred← citeshttps://doi.org/10.1109/icdcs.1995.500043openalex-snapshot
Distributed join processing using bipartite graphs
inferred← citeshttps://doi.org/10.1109/icde.1996.492197openalex-snapshot
A distributed query processing strategy using placement dependency
inferred← citeshttps://doi.org/10.1109/pdis.1994.331712openalex-snapshot
Managing network resources for efficient, reliable information systems
inferred← citeshttps://doi.org/10.1145/128762.128764openalex-snapshot
Join processing in relational 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.