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

Sourav Sikdar

dblp:201/4821 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2020
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-author

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
Query processing and optimization · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 44% High-performance computing · 44% Storage systems · 13%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization
adaptive query processing
0.412020
MONSOON: Multi-Step Optimization and Execution of Queries with Partially Obscured Predicates · SIGMOD Conference 2020
Query processing and optimization
query optimization
0.412020
MONSOON: Multi-Step Optimization and Execution of Queries with Partially Obscured Predicates · SIGMOD Conference 2020
Cloud and datacenter computing
cluster resource management and scheduling
0.312018
PlinyCompute: A Platform for High-Performance, Distributed, Data-Intensive Tool Development · SIGMOD Conference 2018
High-performance computing › data-intensive computing
distributed data-intensive computing
0.312018
PlinyCompute: A Platform for High-Performance, Distributed, Data-Intensive Tool Development · SIGMOD Conference 2018
Query processing and optimization
cardinality estimation
0.112020
MONSOON: Multi-Step Optimization and Execution of Queries with Partially Obscured Predicates · SIGMOD Conference 2020

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

markov decision process · 0.4relational-database style optimization · 0.3memory management · 0.3
YearPublicationVenuePosition
2020 MONSOON: Multi-Step Optimization and Execution of Queries with Partially Obscured Predicates
abstract
User-defined functions (UDFs) in modern SQL database systems and Big Data processing systems such as Spark---that offer API bindings in high-level languages such as Python or Scala---make automatic optimization challenging. The foundation of modern database query optimization is the collection of statistics describing the data to be processed, but when a database or Big Data computation is partially obscured by UDFs, good statistics are often unavailable. In this paper, we describe a query optimizer called the Monsoon optimizer. In the presence of UDFs, the Monsoon optimizer may choose to collect statistics on the UDFs, and then run the computation. Or, it may optimize and execute part of the plan, collecting statistics on the result of the partial plan, followed by a re optimization step, with the process repeated as needed. Monsoon decides how to interleave execution and statistics collection in a principled fashion by formalizing the problem as a Markov decision process.
Sourav Sikdar, Chris Jermaine
SIGMOD Conference1
2018 PlinyCompute: A Platform for High-Performance, Distributed, Data-Intensive Tool Development
abstract
This paper describes PlinyCompute, a system for development of high-performance, data-intensive, distributed computing tools and libraries. \emphIn the large, PlinyCompute presents the programmer with a very high-level, declarative interface, relying on automatic, relational-database style optimization to figure out how to stage distributed computations. However, in the small, PlinyCompute presents the capable systems programmer with a persistent object data model and API (the "PC object model'') and associated memory management system that has been designed from the ground-up for high performance, distributed, data-intensive computing. This contrasts with most other Big Data systems, which are constructed on top of the Java Virtual Machine (JVM), and hence must at least partially cede performance-critical concerns such as memory management (including layout and de/allocation) and virtual method/function dispatch to the JVM. This hybrid approach---declarative in the large, trusting the programmer's ability to utilize PC object model efficiently in the small---results in a system that is ideal for the development of reusable, data-intensive tools and libraries.
Jia Zou 0001, R. Matthew Barnett, Tania Lorido-Botran, Shangyu Luo, Carlos Monroy, Sourav Sikdar, Kia Teymourian, Binhang Yuan, Chris Jermaine
SIGMOD Conference6
2017 An experimental comparison of complex object implementations for big data systems
abstract
Many cloud-based data management and analytics systems support complex objects. Dataflow platforms such as Spark and Flink allow programmers to manipulate sets consisting of objects from a host programming language (often Java). Document databases such as MongoDB make use of hierarchical interchange formats---most popularly JSON---which embody a data model where individual records can themselves contain sets of records. Systems such as Dremel and AsterixDB allow complex nesting of data structures.
Sourav Sikdar, Kia Teymourian, Chris Jermaine
SoCC1