Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Erik Sutherland

dblp:149/5936 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Transaction processing and concurrency control · 56% Data stream processing · 44%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data stream processing › stream processing systems
transactional stream processing
0.212014
S-Store: A Streaming NewSQL System for Big Velocity Applications · Proc. VLDB Endow. 2014
Transaction processing and concurrency control › OLTP
in-memory transaction processing
0.112014
S-Store: A Streaming NewSQL System for Big Velocity Applications · Proc. VLDB Endow. 2014

Methods — techniques the papers use, named apart from their topics

windows · 0.2triggers · 0.2transaction workflows · 0.2hidden state · 0.2
YearPublicationVenuePosition
2014 S-Store: A Streaming NewSQL System for Big Velocity Applications
abstract
First-generation streaming systems did not pay much attention to state management via ACID transactions (e.g., [3, 4]). S-Store is a data management system that combines OLTP transactions with stream processing. To create S-Store, we begin with H-Store, a main-memory transaction processing engine, and add primitives to support streaming. This includes triggers and transaction workflows to implement push-based processing, windows to provide a way to bound the computation, and tables with hidden state to implement scoping for proper isolation. This demo explores the benefits of this approach by showing how a naïve implementation of our benchmarks using only H-Store can yield incorrect results. We also show that by exploiting push-based semantics and our implementation of triggers, we can achieve significant improvement in transaction throughput. We demo two modern applications: (i) leaderboard maintenance for a version of "American Idol", and (ii) a city-scale bicycle rental scenario.
Ugur Çetintemel, Jiang Du 0001, Tim Kraska, Samuel Madden 0001, David Maier 0001, John Meehan, Andrew Pavlo, Michael Stonebraker, Erik Sutherland, Nesime Tatbul, Kristin Tufte, Stanley B. Zdonik
Proc. VLDB Endow.9