On the public citation graph

Optimizing join queries in distributed databases

0 signed · 58 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.1016/0022-0000(84)90007-2openalex-snapshot
Optimization of distributed tree queries
inferredcites →https://doi.org/10.1093/comjnl/29.5.430openalex-snapshot
The Use of Termination Indicators in Computer Programming
inferredcites →https://doi.org/10.1093/comjnl/29.5.451openalex-snapshot
Index Database Machine
inferredcites →https://doi.org/10.1109/tc.1979.1675382openalex-snapshot
The Architectural Features and Implementation Techniques of the Multicell CASSM
inferredcites →https://doi.org/10.1109/tse.1983.236170openalex-snapshot
Optimization Algorithms for Distributed Queries
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/320064.320065openalex-snapshot
Implementing a relational database by means of specialzed hardware
inferredcites →https://doi.org/10.1145/322234.322238openalex-snapshot
Using Semi-Joins to Solve Relational Queries
inferredcites →https://doi.org/10.1145/3872.3874openalex-snapshot
Distributed query processing
inferredcites →https://doi.org/10.1145/509252.509292openalex-snapshot
Distributed query processing in a relational data base system
inferredcites →https://doi.org/10.1145/582250.582277openalex-snapshot
A methodology for interpreting tree queries into optimal semi-join expressions
inferredcites →https://doi.org/10.1145/582275.582277openalex-snapshot
A methodology for interpreting tree queries into optimal semi-join expressions

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-44289-7_17openalex-snapshot
Dynamic Cost Ant Colony Algorithm for Optimize Distributed Database Query
inferred← citeshttps://doi.org/10.1007/978-981-13-8300-7_19openalex-snapshot
Join Query Optimization Using Genetic Ant Colony Optimization Algorithm for Distributed Databases
inferred← citeshttps://doi.org/10.1007/bf01263657openalex-snapshot
An efficient processing of a chain join with the minimum communication cost in distributed database systems
inferred← citeshttps://doi.org/10.1007/bfb0014166openalex-snapshot
A hash partition strategy for distributed query processing
inferred← citeshttps://doi.org/10.1016/0895-7177(94)90029-9openalex-snapshot
Incorporating processor costs in optimizing the distributed execution of join queries
inferred← citeshttps://doi.org/10.1016/0895-7177(94)90111-2openalex-snapshot
Database placement in communication networks for minimizing the overall transmission cost
inferred← citeshttps://doi.org/10.1016/0895-7177(95)00033-xopenalex-snapshot
Evaluating multiple join queries in a distributed database system
inferred← citeshttps://doi.org/10.1016/0895-7177(95)00116-jopenalex-snapshot
Executing join queries in an uncertain distributed environment
inferred← citeshttps://doi.org/10.1016/0895-7177(95)00153-sopenalex-snapshot
Allocating relations in a distributed database system
inferred← citeshttps://doi.org/10.1016/0895-7177(95)00230-8openalex-snapshot
The propagation of updates to relational tables in a distributed database system
inferred← citeshttps://doi.org/10.1016/j.eij.2015.10.003openalex-snapshot
Design and analysis of stochastic DSS query optimizers in a distributed database system
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.1016/s0895-7177(96)00185-9openalex-snapshot
Minimizing the response time of executing a join between fragmented relations in a distributed database system
inferred← citeshttps://doi.org/10.1023/a:1018967414664openalex-snapshot
Optimizing distributed join queries: A genetic algorithm approach
inferred← citeshttps://doi.org/10.1109/69.224205openalex-snapshot
Combining joint and semi-join operations for distributed query processing
inferred← citeshttps://doi.org/10.1109/69.273034openalex-snapshot
A graph theoretical approach to determine a join reducer sequence in distributed query processing
inferred← citeshttps://doi.org/10.1109/69.298176openalex-snapshot
Site and query scheduling policies in multicomputer database systems
inferred← citeshttps://doi.org/10.1109/69.476497openalex-snapshot
Combinatorial optimization of distributed queries
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.139206openalex-snapshot
A parallel execution method for minimizing distributed query response time
inferred← citeshttps://doi.org/10.1109/71.159044openalex-snapshot
Interleaving a join sequence with semijoins in distributed query processing
inferred← citeshttps://doi.org/10.1109/71.238624openalex-snapshot
Performance issues in distributed query processing
inferred← citeshttps://doi.org/10.1109/access.2021.3049544openalex-snapshot
QIACO: A Quantum Dynamic Cost Ant System for Query Optimization in Distributed Database
inferred← citeshttps://doi.org/10.1109/cmpsac.1995.524770openalex-snapshot
Using constraints for distributed query processing
inferred← citeshttps://doi.org/10.1109/dpds.1990.113703openalex-snapshot
Using join operations as reducers in distributed query processing
inferred← citeshttps://doi.org/10.1109/hicss.1994.323258openalex-snapshot
A join ordering approach for multicomputer relational databases with highly skewed data
inferred← citeshttps://doi.org/10.1109/icctict.2016.7514546openalex-snapshot
Parametric analysis of different GA based distributed DSS Query Optimizer models
inferred← citeshttps://doi.org/10.1109/icdcs.1990.89300openalex-snapshot
Using combination of join and semijoin operations for 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/icde.1991.131452openalex-snapshot
Determining beneficial semijoins for a join sequence in distributed query processing
inferred← citeshttps://doi.org/10.1109/icde.1991.131525openalex-snapshot
Distributed query optimization by one-shot fixed-precision semi-join execution
inferred← citeshttps://doi.org/10.1109/icde.1996.492197openalex-snapshot
A distributed query processing strategy using placement dependency
inferred← citeshttps://doi.org/10.1109/icsmc.1996.565428openalex-snapshot
A genetic algorithm for set query optimization in distributed database systems
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/infrkm.2010.5466932openalex-snapshot
Query optimization in distributed database using hybrid evolutionary algorithm
inferred← citeshttps://doi.org/10.1109/spdp.1990.143612openalex-snapshot
The complexity of processing tree queries in distributed databases
inferred← citeshttps://doi.org/10.1109/tkde.2014.2357018openalex-snapshot
Enforcement of Autonomous Authorizations in Collaborative Distributed Query Evaluation
inferred← citeshttps://doi.org/10.1145/114325.103713openalex-snapshot
Optimizing equijoin queries in distributed databases where relations are hash partitioned
inferred← citeshttps://doi.org/10.1145/128762.128764openalex-snapshot
Join processing in relational databases
inferred← citeshttps://doi.org/10.1145/1352431.1352525openalex-snapshot
BioScout
inferred← citeshttps://doi.org/10.1145/1353343.1353437openalex-snapshot
BioScout
inferred← citeshttps://doi.org/10.1145/319057.319074openalex-snapshot
Using join operations as reducers in distributed query processing
inferred← citeshttps://doi.org/10.14778/1453856.1453864openalex-snapshot
Scalable multi-query optimization for exploratory queries over federated scientific databases
inferred← citeshttps://doi.org/10.26483/ijarcs.v8i8.4671openalex-snapshot
DETERMINING LOWEST COST COMMUNICATION PATH IN DISTRIBUTED DATABASE SYSTEM
inferred← citeshttps://doi.org/10.3390/sym13010070openalex-snapshot
Dynamic Cost Ant Colony Algorithm to Optimize Query for Distributed Database Based on Quantum-Inspired Approach
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.