J
Joseph M. Hellerstein
Researcher at University of California, Berkeley
Publications - 313
Citations - 39413
Joseph M. Hellerstein is an academic researcher from University of California, Berkeley. The author has contributed to research in topics: Query optimization & Query language. The author has an hindex of 91, co-authored 300 publications receiving 37800 citations. Previous affiliations of Joseph M. Hellerstein include Carnegie Mellon University & IBM.
Papers
More filters
Proceedings ArticleDOI
CONTROL: continuous output and navigation technology with refinement on-line
Ron Avnur,Joseph M. Hellerstein,Bruce Lo,Christopher Olston,Bhaskaran Raman,Vijayshankar Raman,Tali Roth,Kirk Wylie +7 more
TL;DR: This demonstration displays the modifications to a database system and the resulting impact on aggregation queries, data visualization, and GUI widgets, and compares this interactive behavior to batch-processing alternatives.
Journal Article
Probabilistic Data Management for Pervasive Computing: The Data Furnace Project.
Minos Garofalakis,Kurt P. Brown,Michael J. Franklin,Joseph M. Hellerstein,Daisy Zhe Wang,Eirinaios Michelakis,Liviu Tancau,Eugene Wu,Shawn R. Jeffery,Ryan Aipperspach +9 more
TL;DR: The Data Furnace project at Intel Research and UC-Berkeley aims to build a probabilistic data management infrastructure for pervasive computing environments that handles the uncertain nature of such data as a first-class citizen through a principled framework grounded in probabilism models and inference techniques.
Journal ArticleDOI
Java support for data-intensive systems: experiences building the telegraph dataflow system
TL;DR: This paper highlights the pleasures of coding with Java, and some of the pains of coding around Java in order to obtain good performance in a data-intensive server, and presents concrete suggestions for evolving Java's interfaces to better suit serious software systems development.
Journal ArticleDOI
I do declare: consensus in a logic language
TL;DR: It is found that the Paxos algorithm is easily translated to declarative logic, in large part because the primitives used in consensus protocol specifications map directly to simple Overlog constructs such as aggregation and selection.