Database Paper Browser

Back to papers

A Strategy for Decomposing Complex Queries in a Heterogeneous DDB

Summary: Optimal decomposition algorithm for complex queries in a heterogeneous, decentralized DDB with data integration. It models node-operation availability and other constraints to guide subquery generation; implemented in the PRECI* system. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7667
Venue
VLDB
Year
1984
Pagerank
4.1905499e-05
Overall Rank
13,057 | 9.26%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
315 Distributed Query Processing In A Relational Data Base System 1978 SIGMOD 0.00028022592
678 Constructing Superviews 1981 SIGMOD 0.0001824315
2,392 Processing Queries Over Generalization Hierarchies in a Multidatabase System 1983 VLDB 8.8934863e-05
Previous Page 1 / 1 Next

Semantically Similar Papers