DBScholar

Back to papers

Optimal Semijoin Schedules For Query Processing In Local Distributed Database Systems

Summary: Extends semijoin planning to bus/loop networks with broadcast, accounting for local processing costs and capacity in a minimum response-time schedule. Shows NP-hardness for general tree queries even on 1-bus and many m-bus cases; polynomial-time only for simple 1-bus queries. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h3e55cfb9c9d84ccf
Venue
SIGMOD
Year
1981
Pagerank
5.1677187e-05
Overall Rank
9,393 | 37.04%
DOI
10.1145/582318.582344

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{gouda_sigmod81,
        title = {{OPTIMAL SEMIJOIN SCHEDULES FOR QUERY PROCESSING IN LOCAL DISTRIBUTED DATABASE SYSTEMS}},
        author = {Gouda, Mohamed G. and Dayal, Umeshwar},
        series = {{SIGMOD} '81},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/582318.582344},
        url = {https://dl.acm.org/doi/10.1145/582318.582344},
        year = {1981}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 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,536 A Methodology For Interpreting Tree Queries Into Optimal Semi-Join Expressions 1980 SIGMOD 0.00010297567
Previous Page 1 / 1 Next

Semantically Similar Papers