An Optimal Algorithm for Processing Distributed Star Queries

DOI10.1109/TSE.1985.231857MaRDI QIDQ3690266zbMATH OpenOpenAlexFDO

Authors Arbee L. P. Chen, Victor O. K. Li

Publication date 1985

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tse.1985.231857

zbMATH Keywords

distributed database systemsoptimal query processingquery optimizationrelational data modelsemijoin

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• Improvement Algorithms for Semijoin Query Processing Programs in Distributed Database Systems
• Properties of semijoin sequences
• Optimization of distributed tree queries
• Optimising the distributed execution of join queries in polynomial time
• Optimizing Chain Queries in a Distributed Database System

Cited in

(5)

• An efficient distributed algorithm for canonical labeling on directed split-stars
• Asserting the optimality of serial SJRPs in processing simple queries in chain networks
• Properties of semijoin sequences
• Improvement Algorithms for Semijoin Query Processing Programs in Distributed Database Systems
• Optimization of distributed tree queries

This page was built for publication: An Optimal Algorithm for Processing Distributed Star Queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3690266)