Optimizing Star Queries In A Distributed Database System
Summary: Polynomial-time optimal algorithm for star queries in distributed DBs, advancing beyond NP-hard general query optimization by shrinking the semi-join search space. With file-size and selectivity assumptions aligned to the current DB state, S collapses to unity, enabling direct generation of the optimal program; includes a heuristic-vs-optimal comparison. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,674 | Scalable Multi-Query Optimization for Exploratory Queries over Federated Scientific Databases | 2008 | VLDB | 6.0000019e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,308 | A Heuristic Approach to Distributed Query Processing | 1982 | VLDB | 0.00012664082 |
| 1,345 | On the Design of a Query Processing Strategy in a Distributed Database Environment | 1983 | SIGMOD | 0.0001247541 |
Previous
Page 1 / 1
Next