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

Chris Croswhite

dblp:185/4332 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2018
—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
Transaction processing and concurrency control · 52% Database system architecture and tuning · 22% Query processing and optimization · 13%

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

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control
concurrency control
0.312018
Rethinking Concurrency Control for In-Memory OLAP DBMSs · ICDE 2018
Transaction processing and concurrency control › synchronization
lock-free algorithms
0.312018
Rethinking Concurrency Control for In-Memory OLAP DBMSs · ICDE 2018
Transaction processing and concurrency control › isolation levels
snapshot isolation
0.312018
Rethinking Concurrency Control for In-Memory OLAP DBMSs · ICDE 2018
Indexing and storage engines
multidimensional indexing
0.212016
Cubrick: Indexing Millions of Records per Second for Interactive Analytics · Proc. VLDB Endow. 2016
Query processing and optimization › OLAP
OLAP query processing
0.212016
Cubrick: Indexing Millions of Records per Second for Interactive Analytics · Proc. VLDB Endow. 2016
Database system architecture and tuning › main-memory database
distributed in-memory database
0.112016
Cubrick: Indexing Millions of Records per Second for Interactive Analytics · Proc. VLDB Endow. 2016
YearPublicationVenuePosition
2018 Rethinking Concurrency Control for In-Memory OLAP DBMSs
abstract
Although OLTP and OLAP database systems have fundamentally disparate architectures, most research work on concurrency control is geared towards transactional systems and simply adopted by OLAP DBMSs. In this paper we describe a new concurrency control protocol specifically designed for analytical DBMSs that can provide Snapshot Isolation for distributed in-memory OLAP database systems, called Append-Only Snapshot Isolation (AOSI). Unlike previous work, which are either based on multiversion concurrency control (MVCC) or Two Phase Locking (2PL), AOSI is completely lock-free and always maintains a single version of each data item. In addition, it removes the need for per-record timestamps of traditional MVCC implementations and thus considerably reduces the memory overhead incurred by concurrency control. In order to support these characteristics, the protocol sacrifices flexibility and removes support for a few operations, particularly record updates and single record deletions; however, we argue that even though these operations are essential in a pure transactional system, they are not strictly required in most analytic pipelines and OLAP systems. We also present an experimental evaluation of AOSI's current implementation within the Cubrick in-memory OLAP DBMS at Facebook, and show that lock-free single-version Snapshot Isolation can be achieved with low memory overhead and minor impact in query latency.
Pedro Pedreira, Yinghai Lu, Sergey Pershin, Chris Croswhite
ICDE5
2016 Cubrick: Indexing Millions of Records per Second for Interactive Analytics
abstract
This paper describes the architecture and design of Cubrick, a distributed multidimensional in-memory DBMS suited for interactive analytics over highly dynamic datasets. Cubrick has a strictly multidimensional data model composed of cubes, dimensions and metrics, supporting sub-second OLAP operations such as slice and dice, roll-up and drill-down over terabytes of data. All data stored in Cubrick is range partitioned by every dimension and stored within containers called bricks in an unordered and sparse fashion, providing high data ingestion rates and indexed access through any combination of dimensions. In this paper, we describe details about Cubrick's internal data structures, distributed model, query execution engine and a few details about the current implementation. Finally, we present results from a thorough experimental evaluation that leveraged datasets and queries collected from a few internal Cubrick deployments at Facebook.
Pedro Pedreira, Chris Croswhite, Luis C. E. Bona
Proc. VLDB Endow.2