Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/23138
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | KETSMAN, Bas | - |
dc.contributor.author | NEVEN, Frank | - |
dc.date.accessioned | 2017-02-20T09:45:54Z | - |
dc.date.available | 2017-02-20T09:45:54Z | - |
dc.date.issued | 2017 | - |
dc.identifier.citation | THEORY OF COMPUTING SYSTEMS, 61 (1), p. 233-260 | - |
dc.identifier.issn | 1432-4350 | - |
dc.identifier.uri | http://hdl.handle.net/1942/23138 | - |
dc.description.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. | - |
dc.description.sponsorship | Bas Ketsman is a PhD Fellow of the Research Foundation - Flanders (FWO) | - |
dc.language.iso | en | - |
dc.rights | © Springer Science+Business Media New York 2016 | - |
dc.subject.other | coordination-free evaluation; conjunctive queries; broadcasting | - |
dc.title | Optimal Broadcasting Strategies for Conjunctive Queries over Distributed Data | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 260 | - |
dc.identifier.issue | 1 | - |
dc.identifier.spage | 233 | - |
dc.identifier.volume | 61 | - |
local.format.pages | 28 | - |
local.bibliographicCitation.jcat | A1 | - |
dc.description.notes | Ketsman, B (reprint author), Hasselt Univ, Hasselt, Belgium. bas.ketsman@uhasselt.be; frank.neven@uhasselt.be | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.identifier.doi | 10.1007/s00224-016-9719-8 | - |
dc.identifier.isi | 000402462000007 | - |
item.validation | ecoom 2018 | - |
item.contributor | KETSMAN, Bas | - |
item.contributor | NEVEN, Frank | - |
item.accessRights | Open Access | - |
item.fullcitation | KETSMAN, Bas & NEVEN, Frank (2017) Optimal Broadcasting Strategies for Conjunctive Queries over Distributed Data. In: THEORY OF COMPUTING SYSTEMS, 61 (1), p. 233-260. | - |
item.fulltext | With Fulltext | - |
crisitem.journal.issn | 1432-4350 | - |
crisitem.journal.eissn | 1433-0490 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
main.pdf | Peer-reviewed author version | 398.36 kB | Adobe PDF | View/Open |
optimal.pdf Restricted Access | Published version | 582.57 kB | Adobe PDF | View/Open Request a copy |
SCOPUSTM
Citations
1
checked on Sep 7, 2020
WEB OF SCIENCETM
Citations
1
checked on Apr 30, 2024
Page view(s)
64
checked on Sep 7, 2022
Download(s)
106
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.