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

Jesse Trutna

dblp:93/1347 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none

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

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

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
Indexing and storage engines · 39% Data models and query languages · 30% Database system architecture and tuning · 30%

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

TopicWeightPapersLastEvidence papers
Indexing and storage engines
index management
0.112010
PIQL: a performance insightful query language · SIGMOD Conference 2010
Database system architecture and tuning
index recommendation
0.112010
PIQL: a performance insightful query language · SIGMOD Conference 2010
Data models and query languages
query language design
0.112010
PIQL: a performance insightful query language · SIGMOD Conference 2010
Indexing and storage engines
key-value store
0.012010
PIQL: a performance insightful query language · SIGMOD Conference 2010
YearPublicationVenuePosition
2010 PIQL: a performance insightful query language
abstract
Large-scale websites are increasingly moving from relational databases to distributed key-value stores for high request rate, low latency workloads. Often this move is motivated not only by key-value stores' ability to scale simply by adding more hardware, but also by the easy to understand predictable performance they provide for all operations. While this data model works well, lookups are only done by primary key. More complex queries require onerous, explicit index management and imperative data lookups by the developer. We demonstrate PIQL, a Performance Insightful Query Language that allows developers to express many of the queries found on these websites, while still providing strict bounds on the number of I/O operations for any query.
Michael Armbrust, Stephen Tu, Armando Fox, Michael J. Franklin, David A. Patterson 0001, Nick Lanham, Beth Trushkowsky, Jesse Trutna
SIGMOD Conference8
2009 SCADS: Scale-Independent Storage for Social Computing Applications
Michael Armbrust, Armando Fox, David A. Patterson 0001, Nick Lanham, Beth Trushkowsky, Jesse Trutna, Haruki Oh
CIDR6