EDBT 2026 Demo / reviewers in the wild / expert
Nikolay Pavlovich Laptev
dblp:252/5137
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 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
1 paper |
Query processing and optimization · 87% Database system architecture and tuning · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Query processing and optimization › runtime optimization › data skipping
block skipping |
0.7 | 1 | 2023 | Pando: Enhanced Data Skipping with Logical Data Partitioning · Proc. VLDB Endow. 2023 |
Query processing and optimization › runtime optimization
data skipping |
0.7 | 1 | 2023 | Pando: Enhanced Data Skipping with Logical Data Partitioning · Proc. VLDB Endow. 2023 |
Database system architecture and tuning › database design
physical database design |
0.2 | 1 | 2023 | Pando: Enhanced Data Skipping with Logical Data Partitioning · Proc. VLDB Endow. 2023 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Pando: Enhanced Data Skipping with Logical Data PartitioningabstractWith enormous volumes of data, quickly retrieving data that is relevant to a query is essential for achieving high performance. Modern cloud-based database systems often partition the data into blocks and employ various techniques to skip irrelevant blocks during query execution. Several algorithms, often based on historical properties of a workload of queries run over the data, have been proposed to tune the physical layout of data to reduce the number of blocks accessed. The effectiveness of these methods at skipping blocks depends on what metadata is stored and how well the physical data layout aligns with the queries. Existing work on automatic physical database design misses significant opportunities in skipping blocks because it ignores logical predicates in the workload that exhibit strongly correlated results. In this paper, we present Pando which enables significantly better block skipping than past methods by informing physical layout decisions with correlation-aware logical partitioning. Across a range of benchmark and real-world workloads, Pando attains up to 2.8X reduction in the number of blocks scanned and up to 2.3X speedup in end-to-end query execution time over the state-of-the-art techniques. Sivaprasad Sudhir, Wenbo Tao, Nikolay Pavlovich Laptev, Cyrille Habis, Michael J. Cafarella, Samuel Madden 0001 |
Proc. VLDB Endow. | 3 |