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

Ankur Dave

dblp:74/10101 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · none

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

Databases, data management, data science and information retrieval · 3 · 1 since 2021Systems, architecture and hardware · 2 · 1 first-author · 1 since 2021Computer networks · 2Software engineering, systems software and programming languages · 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
4 papers
Query processing and optimization · 64% Information retrieval · 22% Database system architecture and tuning · 10%
Network and information security
2 papers
Hardware security and side channels · 55% Privacy and data protection · 45%
Computer architecture, parallel and distributed computing, and storage systems
4 papers
Distributed systems · 38% Parallel and multicore computing · 21% Storage systems · 15%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection
privacy-preserving data analysis
0.412020
Oblivious coopetitive analytics using hardware enclaves · EuroSys 2020
Hardware security and side channels › trusted execution environments
secure enclaves
0.412020
Oblivious coopetitive analytics using hardware enclaves · EuroSys 2020
Hardware security and side channels
trusted execution environments
0.412020
Oblivious coopetitive analytics using hardware enclaves · EuroSys 2020
Information retrieval
indexing
0.412019
[Demo] Low-latency Spark Queries on Updatable Data · SIGMOD Conference 2019
Privacy and data protection › privacy-preserving computation › encrypted data processing
encrypted data analytics
0.312017
Opaque: An Oblivious and Encrypted Distributed Analytics Platform · NSDI 2017
Distributed systems
oblivious computation
0.312017
Opaque: An Oblivious and Encrypted Distributed Analytics Platform · NSDI 2017
Query processing and optimization
approximate query processing
0.212015
G-OLA: Generalized On-Line Aggregation for Interactive Analysis on Big Data · SIGMOD Conference 2015
Query processing and optimization
interactive data exploration
0.212015
G-OLA: Generalized On-Line Aggregation for Interactive Analysis on Big Data · SIGMOD Conference 2015
Query processing and optimization
OLAP
0.212015
G-OLA: Generalized On-Line Aggregation for Interactive Analysis on Big Data · SIGMOD Conference 2015
Query processing and optimization › aggregation
online aggregation
0.212015
G-OLA: Generalized On-Line Aggregation for Interactive Analysis on Big Data · SIGMOD Conference 2015
Parallel and multicore computing
graph processing
0.212014
GraphX: Graph Processing in a Distributed Dataflow Framework · OSDI 2014
Storage systems › data management › database storage
columnar storage
0.212022
Photon: A Fast Query Engine for Lakehouse Systems · SIGMOD Conference 2022
High-performance computing
cluster computing
0.112012
Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing · NSDI 2012
Distributed systems
fault tolerance
0.112012
Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing · NSDI 2012
Cloud and datacenter computing › cluster computing framework
in-memory cluster computing
0.112012
Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing · NSDI 2012
Query processing and optimization
interactive query processing
0.112019
[Demo] Low-latency Spark Queries on Updatable Data · SIGMOD Conference 2019
Query processing and optimization › query execution
low-latency query processing
0.112019
[Demo] Low-latency Spark Queries on Updatable Data · SIGMOD Conference 2019
Graph data management
distributed graph processing
0.112014
GraphX: Graph Processing in a Distributed Dataflow Framework · OSDI 2014
Parallel and multicore computing
parallel programming models
0.012012
Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing · NSDI 2012

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

oblivious computation · 1.0encryption · 0.6multi-version concurrency control · 0.4indexing · 0.4caching · 0.4lineage-based recovery · 0.1
YearPublicationVenuePosition
2022 In-Memory Indexed Caching for Distributed Data Processing
abstract
Powerful abstractions such as dataframes are only as efficient as their underlying runtime system. The de-facto distributed data processing framework, Apache Spark, is poorly suited for the modern cloud-based data-science workloads due to its outdated assumptions: static datasets analyzed using coarse-grained transformations. In this paper, we introduce the Indexed DataFrame, an in-memory cache that supports a dataframe abstraction which incorporates indexing capabilities to support fast lookup and join operations. Moreover, it supports appends with multi-version concurrency control. We implement the Indexed DataFrame as a lightweight, standalone library which can be integrated with minimum effort in existing Spark programs. We analyze the performance of the Indexed DataFrame in cluster and cloud deployments with real-world datasets and benchmarks using both Apache Spark and Databricks Runtime. In our evaluation, we show that the Indexed DataFrame significantly speeds-up query execution when compared to a non-indexed dataframe, incurring modest memory overhead.
Alexandru Uta, Bogdan Ghit, Ankur Dave, Jan S. Rellermeyer, Peter Boncz
IPDPS3
2022 Photon: A Fast Query Engine for Lakehouse Systems
abstract
Many organizations are shifting to a data management paradigm called the "Lakehouse," which implements the functionality of structured data warehouses on top of unstructured data lakes. This presents new challenges for query execution engines. The engine needs to provide good performance on the raw uncurated datasets that are ubiquitous in data lakes, and excellent performance on structured data stored in popular columnar file formats like Apache Parquet. Toward these goals, we present Photon, a vectorized query engine for Lakehouse environments that we developed at Databricks. Photon can outperform existing warehouses on SQL workloads and also supports the Apache Spark API. We discuss the design choices we made in Photon (e.g., vectorization vs. code generation) and describe its integration with our existing SQL and Apache Spark runtimes, its task model, and its memory manager. Photon has accelerated some customer workloads by over 10x and has recently allowed Databricks to set a new audited performance record for the official 100TB TPC-DS benchmark.
Alexander Behm, Shoumik Palkar, Utkarsh Agarwal, Timothy Armstrong, David Cashman, Ankur Dave, Todd Greenstein, Shant Hovsepian, Arvind Sai Krishnan, Paul Leventis, Ala Luszczak, Prashanth Menon, Mostafa Mokhtar, Gene Pang, Sameer Paranjpye, Greg Rahn, Bart Samwel, Tom van Bussel, Herman Van Hövell, Maryann Xue, Reynold Xin, Matei Zaharia
SIGMOD Conference6
2020 Oblivious coopetitive analytics using hardware enclaves
abstract
Coopetitive analytics refers to cooperation among competing parties to run queries over their joint data. Regulatory, business, and liability concerns prevent these organizations from sharing their sensitive data in plaintext.
Ankur Dave, Chester Leung, Raluca A. Popa, Joseph Gonzalez 0001, Ion Stoica
EuroSys1
2019 [Demo] Low-latency Spark Queries on Updatable Data
abstract
As data science gets deployed more and more into operational applications, it becomes important for data science frameworks to be able to perform computations in interactive, sub-second time. Indexing and caching are two key techniques that can make interactive query processing on large datasets possible. In this demo, we show the design, implementation and performance of a new indexing abstraction in Apache Spark, called the Indexed DataFrame. This is a cached DataFrame that incorporates an index to support fast lookup and join operations, and supports updates with multi-version concurrency. We demonstrate the Indexed Dataframe on a social network dataset using microbenchmarks and real-world graph processing queries, in datasets that are continuously growing.
Alexandru Uta, Bogdan Ghit, Ankur Dave, Peter Boncz
SIGMOD Conference3
2017 Opaque: An Oblivious and Encrypted Distributed Analytics Platform
Wenting Zheng, Ankur Dave, Jethro G. Beekman, Raluca A. Popa, Joseph Gonzalez 0001, Ion Stoica
NSDI2
2015 G-OLA: Generalized On-Line Aggregation for Interactive Analysis on Big Data
abstract
Nearly 15 years ago, Hellerstein, Haas and Wang proposed online aggregation (OLA), a technique that allows users to (1) observe the progress of a query by showing iteratively refined approximate answers, and (2) stop the query execution once its result achieves the desired accuracy. In this demonstration, we present G-OLA, a novel mini-batch execution model that generalizes OLA to support general OLAP queries with arbitrarily nested aggregates using efficient delta maintenance techniques. We have implemented G-OLA in FluoDB, a parallel online query execution framework that is built on top of the Spark cluster computing framework that can scale to massive data sets. We will demonstrate FluoDB on a cluster of 100 machines processing roughly 10TB of real-world session logs from a video-sharing website. Using an ad optimization and an A/B testing based scenario, we will enable users to perform real-time data analysis via web-based query consoles and dashboards.
Kai Zeng 0002, Sameer Agarwal 0002, Ankur Dave, Michael Armbrust, Ion Stoica
SIGMOD Conference3
2014 GraphX: Graph Processing in a Distributed Dataflow Framework
Joseph Gonzalez 0001, Reynold Xin, Ankur Dave, Daniel Crankshaw, Michael J. Franklin, Ion Stoica
OSDI3
2012 Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing
Matei Zaharia, Mosharaf Chowdhury, Tathagata Das, Ankur Dave, Justin Ma, Murphy McCauly, Michael J. Franklin, Scott Shenker, Ion Stoica
NSDI4