2005 · 1.2K citations · 39 references
ComputingComputer EngineeringComputer ScienceDistributed SystemsFault ToleranceFault-tolerant SystemsDistributed ComputingDistributed Data ProcessingFault Tolerance DesignHigh-availability DesignQuery ProcessingStream ProcessingConsistency Trade-offsData Stream ProcessingDistributed Stream ProcessingFault Tolerance MechanismsStream ComputationStream Processing ScalabilityStream Query ProcessingStreaming Data Processing
Borealis is a second‑generation distributed stream processing engine developed at Brandeis, Brown, and MIT that extends Aurora’s core functionality and Medusa’s distribution model to deliver advanced capabilities required by emerging stream processing applications. The paper outlines the basic design and functionality of Borealis. Borealis tackles dynamic query revision and specification changes with revision records, time travel, and control lines, and introduces a scalable QoS‑based optimization model for server and sensor networks along with a fault‑tolerance model offering flexible consistency‑availability trade‑offs. Real‑world application examples demonstrate the necessity of dynamically revising query results and modifying query specifications.
Borealis is a second-generation distributed stream processing engine that is being developed at Brandeis University, Brown University, and MIT. Borealis inherits core stream processing functionality from Aurora [14] and distribution functionality from Medusa [51]. Borealis modifies and extends both systems in non-trivial and critical ways to provide advanced capabilities that are commonly required by newly-emerging stream processing applications. In this paper, we outline the basic design and functionality of Borealis. Through sample real-world applications, we motivate the need for dynamically revising query results and modifying query specifications. We then describe how Borealis addresses these challenges through an innovative set of features, including revision records, time travel, and control lines. Finally, we present a highly flexible and scalable QoS-based optimization model that operates across server and sensor networks and a new fault-tolerance model with flexible consistency-availability trade-offs.
39
Consistent hashing and random trees
David R. Karger, Eric Lehman, Tom Leighton et al. · 1997 · 2K citations
Aurora: a new model and architecture for data stream management
Daniel J. Abadi, Don Carney, Ugur �etintemel et al. · The VLDB Journal · 2003 · 1.5K citations
The dangers of replication and a solution
Jim Gray, Pat Helland, Patrick O’Neil et al. · 1996 · 1K citations
The design of an acquisitional query processor for sensor networks
Samuel Madden, Michael J. Franklin, Joseph M. Hellerstein et al. · 2003 · 937 citations