Optimizing joins in fragmented database systems on a broadcast local network

DOI10.1109/32.21723zbMath0663.68108OpenAlexW2154220864MaRDI QIDQ3814844

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

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

NP-hardjoinsdistributed query processingsemijoinbroadcast networkfragmented databaseminimum-weight vertex cover

Mathematics Subject Classification ID

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) Information storage and retrieval of data (68P20) Theory of operating systems (68N25) Theory of software (68N99)

Related Items (2)

Extension of the one-shot semijoin strategy to minimize data transmission cost in distributed query processing ⋮ Minimum-weight vertex cover problem for two-class resource connection graphs

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