Optimizing joins in fragmented database systems on a broadcast local network

DOI10.1109/32.21723MaRDI QIDQ3814844zbMATH OpenOpenAlexFDO

Authors Jason S. J. Chen, Victor O. K. Li

Publication date 1989

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

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

zbMATH Keywords

broadcast networkdistributed query processingfragmented databasejoinsminimum-weight vertex coverNP-hardsemijoin

Mathematics Subject Classification ID

Theory of operating systems (68N25) Theory of software (68N99) Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Taxonomy and formal properties of distributed joins
• Minimizing the response time of executing a join between fragmented relations in a distributed database system
• On the optimality of strategies for multiple join
• Querying fragmented relations in a distributed database
• scientific article; zbMATH DE number 54592

Cited in

(7)

• Taxonomy and formal properties of distributed joins
• Minimum-weight vertex cover problem for two-class resource connection graphs
• Minimizing the response time of executing a join between fragmented relations in a distributed database system
• Extension of the one-shot semijoin strategy to minimize data transmission cost in distributed query processing
• Distributed spatial data fragmentation and cross-border topological join optimization
• Optimizing entity join queries when data transmission cost dominates
• Distributed joins and data placement for minimal network traffic

This page was built for publication: Optimizing joins in fragmented database systems on a broadcast local network

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