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

Bikas Saha

dblp:49/10014 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
1since 2021 · last 2026
0009-0000-5152-6529ORCID · corroborated

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

Databases, data management, data science and information retrieval · 3 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1Computer networks · 1Software engineering, systems software and programming languages · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

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
Knowledge graphs · 37% Query processing and optimization · 25% Distributed and cloud data management · 20%
Software engineering, system software, and programming languages
1 paper
Services computing and microservices · 100%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Cloud and datacenter computing · 72% Distributed systems · 22% Parallel and multicore computing · 6%

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

TopicWeightPapersLastEvidence papers
Data integration and cleaning
data provenance
0.412019
SAC: A System for Big Data Lineage Tracking · ICDE 2019
Distributed and cloud data management
distributed query processing
0.312018
SHC: Distributed Query Processing for Non-Relational Data Store · ICDE 2018
Query processing and optimization › query optimization › predicate optimization
predicate pushdown
0.312018
SHC: Distributed Query Processing for Non-Relational Data Store · ICDE 2018
Query processing and optimization
query optimization
0.312018
SHC: Distributed Query Processing for Non-Relational Data Store · ICDE 2018
Cloud and datacenter computing
datacenter network
0.112011
Sharing the Data Center Network · NSDI 2011
Cloud and datacenter computing › datacenter network
network sharing
0.112011
Sharing the Data Center Network · NSDI 2011
Cloud and datacenter computing
cluster resource management and scheduling
0.112010
Reining in the Outliers in Map-Reduce Clusters using Mantri · OSDI 2010
Distributed systems › distributed data processing
straggler mitigation
0.112010
Reining in the Outliers in Map-Reduce Clusters using Mantri · OSDI 2010
Indexing and storage engines
key-value store
0.112018
SHC: Distributed Query Processing for Non-Relational Data Store · ICDE 2018
Network optimization and economics
resource allocation
0.012011
Sharing the Data Center Network · NSDI 2011
Parallel and multicore computing › data-parallel programming
mapreduce
0.012010
Reining in the Outliers in Map-Reduce Clusters using Mantri · OSDI 2010

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

machine learning-based prediction · 2.0conversational interface · 2.0visual lineage representation · 0.8dependency tracking · 0.8predicate pushdown · 0.3partition pruning · 0.3column pruning · 0.3
YearPublicationVenuePosition
2026 PAGER: Proactive Monitoring Agent for Enterprise AI Assistant
abstract
We present a Proactive Monitoring Agent designed for large-scale customer data platforms, such as Adobe Experience Platform (AEP), to predict and prevent workflow disruptions before they impact business operations. Unlike existing reactive solutions that assist engineers only after failures occur, our agent anticipates potential failures across multiple workflow stages, explains its predictions in natural language, and interacts with customer support engineers through a conversational interface. The system integrates a machine learning-based Prediction Module, Knowledge Graph APIs for contextual data access, and a Query Processor that powers an interactive Q&A experience, enabling timely and actionable insights to minimize operational risks and maximize business continuity.
Sujan Dutta, Junior Francisco Garcia Ayala, Pranav Umakant Pujar, Sai Sree Harsha, Dan Luo 0004, Nikhil Vasudeva, Bikas Saha, Pritom Baruah, Yunyao Li 0001
AAAI7
2019 SAC: A System for Big Data Lineage Tracking
abstract
In the era of big data, a data processing flow contains various types of tasks. It is nontrivial to discover the data flow/movement from its source to destination, such that monitoring different transformations and hops on its way in an enterprise environment. Therefore, data lineage or provenance is useful to learn how the data gets transformed along the way, how the representation and parameters change, and how the data splits or converges after each hop. However, existing systems offer limited support for such use cases in a distributed computing setup. To address this issue, we build Spark-Atlas-Connector (short as SAC), a new system to track data lineage in a distributed computation platform, e.g., Spark. SAC tracks different processes involved in the data flow and their dependencies, supporting different data storage (e.g., HBase, HDFS, and Hive) and data processing paradigms (e.g., SQL, ETL, machine learning, and streaming). SAC provides a visual representation of data lineage to track data from its origin to downstreams, and is deployed in a distributed production environment for demonstrating its efficiency and scalability.
MingJie Tang, Saisai Shao, Weiqing Yang, Yanbo Liang, Yongyang Yu, Bikas Saha, Dongjoon Hyun
ICDE6
2018 SHC: Distributed Query Processing for Non-Relational Data Store
abstract
We introduce a simple data model to process non-relational data for relational operations, and SHC (Apache Spark - Apache HBase Connector), an implementation of this model in the cluster computing framework, Spark. SHC leverages optimization techniques of relational data processing over the distributed and column-oriented key-value store (i.e., HBase). Compared to existing systems, SHC makes two major contributions. At first, SHC offers a much tighter integration between optimizations of relational data processing and non-relational data store, through a plug-in implementation that integrates with Spark SQL, a distributed in-memory computing engine for relational data. The design makes the system maintenance relatively easy, and enables users to perform complex data analytics on top of key-value store. Second, SHC leverages the Spark SQL Catalyst engine for high performance query optimizations and processing, e.g., data partitions pruning, columns pruning, predicates pushdown and data locality. SHC has been deployed and used in multiple production environments with hundreds of nodes, and provides OLAP query processing on petabytes of data efficiently.
Weiqing Yang, MingJie Tang, Yongyang Yu, Yanbo Liang, Bikas Saha
ICDE5
2015 Apache Tez: A Unifying Framework for Modeling and Building Data Processing Applications
abstract
The broad success of Hadoop has led to a fast-evolving and diverse ecosystem of application engines that are building upon the YARN resource management layer. The open-source implementation of MapReduce is being slowly replaced by a collection of engines dedicated to specific verticals. This has led to growing fragmentation and repeated efforts with each new vertical engine re-implementing fundamental features (e.g. fault-tolerance, security, stragglers mitigation, etc.) from scratch.
Bikas Saha, Hitesh Shah, Siddharth Seth, Gopal Vijayaraghavan, Arun C. Murthy, Carlo Curino
SIGMOD Conference1
2013 Apache Hadoop YARN: yet another resource negotiator
abstract
The initial design of Apache Hadoop [1] was tightly focused on running massive, MapReduce jobs to process a web crawl. For increasingly diverse companies, Hadoop has become the data and computational agorá---the de facto place where data and computational resources are shared and accessed. This broad adoption and ubiquitous usage has stretched the initial design well beyond its intended target, exposing two key shortcomings: 1) tight coupling of a specific programming model with the resource management infrastructure, forcing developers to abuse the MapReduce programming model, and 2) centralized handling of jobs' control flow, which resulted in endless scalability concerns for the scheduler.
Vinod Kumar Vavilapalli, Arun C. Murthy, Chris Douglas, Sharad Agarwal, Mahadev Konar, Robert Evans, Thomas Graves, Jason Lowe, Hitesh Shah, Siddharth Seth, Bikas Saha, Carlo Curino, Owen O'Malley, Sanjay Radia, Benjamin C. Reed, Eric Baldeschwieler
SoCC11
2011 Sharing the Data Center Network
Alan Shieh, Srikanth Kandula, Albert G. Greenberg, Changhoon Kim, Bikas Saha
NSDI5
2010 Reining in the Outliers in Map-Reduce Clusters using Mantri
Ganesh Ananthanarayanan, Srikanth Kandula, Albert G. Greenberg, Ion Stoica, Yi Lu 0001, Bikas Saha
OSDI6