Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Frank McSherry"'
Publikováno v:
The Journal of Privacy and Confidentiality, Vol 7, Iss 3 (2017)
We continue a line of research initiated in Dinur and Nissim (2003); Dwork and Nissim (2004); and Blum et al. (2005) on privacy-preserving statistical databases. Consider a trusted server that holds a database of sensitive information. Given a que
Externí odkaz:
https://doaj.org/article/b011dabf17ba4cde93da5b4b1f731334
Publikováno v:
Proceedings of the VLDB Endowment. 16:1601-1614
Incremental view maintenance (IVM) has long been a central problem in database theory. Many solutions have been proposed for restricted classes of database languages, such as the relational algebra, or Datalog. These techniques do not naturally gener
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ad31dbe787477b0dd776ec02c5926ae
https://doi.org/10.14778/3587136.3587137
https://doi.org/10.14778/3587136.3587137
Autor:
Frank McSherry
Publikováno v:
Proceedings of the 16th ACM International Conference on Distributed and Event-Based Systems.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca9f9a2c8fe9ed3d262aea3338499706
https://doi.org/10.1145/3524860.3544408
https://doi.org/10.1145/3524860.3544408
Publikováno v:
Proceedings of the VLDB Endowment, 13 (10)
Current systems for data-parallel, incremental processing and view maintenance over high-rate streams isolate the execution of independent queries. This creates unwanted redundancy and overhead in the presence of concurrent incrementally maintained q
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4aed71c82344b79259e055f60611e7a0
https://hdl.handle.net/20.500.11850/442881
https://hdl.handle.net/20.500.11850/442881
Publikováno v:
Proceedings of the VLDB Endowment. 11:691-704
We study the problem of finding and monitoring fixed-size subgraphs in a continually changing large-scale graph. We present the first approach that (i) performs worst-case optimal computation and communication, (ii) maintains a total memory footprint
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa050b3ab8e548fb030ffb282a219b06
https://doi.org/10.14778/3199517.3199520
https://doi.org/10.14778/3199517.3199520
Publikováno v:
The Journal of Privacy and Confidentiality, Vol 7, Iss 3 (2017)
We continue a line of research initiated in Dinur and Nissim (2003); Dwork and Nissim (2004); and Blum et al. (2005) on privacy-preserving statistical databases. Consider a trusted server that holds a database of sensitive information. Given a query
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0abc3bdd065c39f945611c5c5453aa8f
https://doi.org/10.29012/jpc.v7i3.405
https://doi.org/10.29012/jpc.v7i3.405
Publikováno v:
Communications of the ACM. 59:75-83
We describe the timely dataflow model for distributed computation and its implementation in the Naiad system. The model supports stateful iterative and incremental computations. It enables both low-latency stream processing and high-throughput batch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6edfdf90055a1518d9a261212ad22dd6
https://doi.org/10.1145/2983551
https://doi.org/10.1145/2983551
Publikováno v:
Proceedings of the VLDB Endowment. 9:1137-1148
We report on the design and implementation of a general framework for interactively explaining the outputs of modern data-parallel computations, including iterative data analytics. To produce explanations, existing works adopt a naive backward tracin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0cd742216398fd55e68b6a64e3ec82f9
https://doi.org/10.14778/2994509.2994530
https://doi.org/10.14778/2994509.2994530
Publikováno v:
BeyondMR@SIGMOD
We propose a prototype incremental data migration mechanism for stateful distributed data-parallel dataflow engines with latency objectives. When compared to existing scaling mechanisms, our prototype has the following differentiating characteristics
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3934fadb5caccb376a9d1d4f898cf93f
https://doi.org/10.1145/3206333.3206334
https://doi.org/10.1145/3206333.3206334
Publikováno v:
BeyondMR@SIGMOD
This document presents Faucet, a modular flow control approach for distributed data-parallel dataflow engines with support for arbitrary (cyclic) topologies. When compared to existing backpressure techniques Faucet has the following differentiating c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43ad964696e2f82b5c1f533c1e1847ec
https://doi.org/10.1145/2926534.2926544
https://doi.org/10.1145/2926534.2926544