Theory of Computing Systems

, Volume 61, Issue 1, pp 233–260

Optimal Broadcasting Strategies for Conjunctive Queries over Distributed Data

Article

DOI: 10.1007/s00224-016-9719-8

Cite this article as:
Ketsman, B. & Neven, F. Theory Comput Syst (2017) 61: 233. doi:10.1007/s00224-016-9719-8

Abstract

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.

Keywords

Coordination-free evaluation Conjunctive queries Broadcasting 

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Hasselt University and transnational University of LimburgHasseltBelgium

Personalised recommendations