2026-08-17T19:39:20Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4991 2024-03-06T10:35:40Z ddc:004 open_access

Optimal Broadcasting Strategies for Conjunctive Queries over Distributed Data Ketsman, Bas Neven, Frank Coordination-free evaluation conjunctive queries broadcasting In a distributed context where data is dispersed over many computing nodes, monotone queries can be evaluated in an eventually consistent and coordination-free manner through a simple but naive broadcasting strategy which makes all data available on every computing node. In this paper, we investigate more economical broadcasting strategies for full conjunctive queries without self-joins that only transmit a part of the local data necessary to evaluate the query at hand. We consider oblivious broadcasting strategies which determine which local facts to broadcast independent of the data at other computing nodes. We introduce the notion of broadcast dependency set (BDS) as a sound and complete formalism to represent locally optimal oblivious broadcasting functions. We provide algorithms to construct a BDS for a given conjunctive query and study the complexity of various decision problems related to these algorithms. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Bas Ketsman and Frank Neven 2015 Is Part Of LIPIcs, Volume 31, 18th International Conference on Database Theory (ICDT 2015) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICDT.2015.291 urn:nbn:de:0030-drops-49913 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2015.291 eng https://creativecommons.org/licenses/by/3.0/legalcode