Sciweavers

630 search results - page 16 / 126
» Optimized union of non-disjoint distributed data sets
Sort
View
WWW
2007
ACM
15 years 10 months ago
Optimized query planning of continuous aggregation queries in dynamic data dissemination networks
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Krithi Ramamritham
PODS
2012
ACM
281views Database» more  PODS 2012»
13 years 4 days ago
Mergeable summaries
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang,...
ICDT
2011
ACM
270views Database» more  ICDT 2011»
14 years 1 months ago
On the equivalence of distributed systems with queries and communication
Distributed data management systems consist of peers that store, exchange and process data in order to collaboratively achieve a common goal, such as evaluate some query. We study...
Serge Abiteboul, Balder ten Cate, Yannis Katsis
ICDCS
1998
IEEE
15 years 1 months ago
Optimal Channel Allocation for Data Dissemination in Mobile Computing Environments
This paper discusses wireless channel allocation problem for data dissemination in mobile computing systems. Methods for accessing data through broadcast and on-demand channels ar...
Qinglong Hu, Dik Lun Lee, Wang-Chien Lee
WDAG
2005
Springer
88views Algorithms» more  WDAG 2005»
15 years 3 months ago
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage
We analyze the problem of efficient distributed storage of information in a message-passing environment where both less than one third of the servers, as well as an arbitrary num...
Christian Cachin, Stefano Tessaro