Demo Data from EDBT 2026 / reviewers in the wild / expert
Darren Shakib
dblp:10/4800
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2012
—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
2 papers |
Distributed and cloud data management · 57% Database system architecture and tuning · 36% Query processing and optimization · 6% |
Topics — the 2 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed and cloud data management › mapreduce
mapreduce query processing |
0.1 | 1 | 2012 | SCOPE: parallel databases meet MapReduce · VLDB J. 2012 |
Database system architecture and tuning
parallel database system |
0.1 | 1 | 2012 | SCOPE: parallel databases meet MapReduce · VLDB J. 2012 |
Methods — techniques the papers use, named apart from their topics
mapreduce · 0.1query compilation · 0.1SQL-like declarative language · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | SCOPE: parallel databases meet MapReduce
Jingren Zhou 0001, Nicolas Bruno, Ming-Chuan Wu, Per-Åke Larson, Ronnie Chaiken, Darren Shakib |
VLDB J. | 6 |
| 2008 | SCOPE: easy and efficient parallel processing of massive data setsabstractCompanies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, processing is typically done on large clusters of shared-nothing commodity machines. It is imperative to develop a programming model that hides the complexity of the underlying system but provides flexibility by allowing users to extend functionality to meet a variety of requirements. In this paper, we present a new declarative and extensible scripting language, SCOPE (Structured Computations Optimized for Parallel Execution), targeted for this type of massive data analysis. The language is designed for ease of use with no explicit parallelism, while being amenable to efficient parallel execution on large clusters. SCOPE borrows several features from SQL. Data is modeled as sets of rows composed of typed columns. The select statement is retained with inner joins, outer joins, and aggregation allowed. Users can easily define their own functions and implement their own versions of operators: extractors (parsing and constructing rows from a file), processors (row-wise processing), reducers (group-wise processing), and combiners (combining rows from two inputs). SCOPE supports nesting of expressions but also allows a computation to be specified as a series of steps, in a manner often preferred by programmers. We also describe how scripts are compiled into efficient, parallel execution plans and executed on large clusters. Ronnie Chaiken, Bob Jenkins, Per-Åke Larson, Bill Ramsey, Darren Shakib, Simon Weaver, Jingren Zhou 0001 |
Proc. VLDB Endow. | 5 |