EDBT 2026 Demo / reviewers in the wild / expert
Priyanka Kakade
dblp:381/6169
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
—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 |
Transaction processing and concurrency control · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Cloud and datacenter computing · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Transaction processing and concurrency control › concurrency control
locking |
0.8 | 1 | 2024 | Optimized Locking in SQL Azure · ICDE 2024 |
Transaction processing and concurrency control › concurrency control
multiversion concurrency control |
0.8 | 1 | 2024 | Optimized Locking in SQL Azure · ICDE 2024 |
Transaction processing and concurrency control › isolation levels
snapshot isolation |
0.8 | 1 | 2024 | Optimized Locking in SQL Azure · ICDE 2024 |
Cloud and datacenter computing
database-as-a-service |
0.2 | 1 | 2024 | Optimized Locking in SQL Azure · ICDE 2024 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Optimized Locking in SQL AzureabstractSQL Azure's concurrency control relies on multi-versioning to prevent readers and writers from blocking each other and on in-memory row locks to prevent multiple writers modifying the same row. If the number of in-memory locks exceeds a threshold, then to reduce memory used for locking, table-level lock escalation occurs which severely reduces concurrency. This paper presents a technique called transaction-id locking that drastically reduces the number of in-memory locks and eliminates lock escalation. It also describes another technique called lock after qualification where rows are qualified without locking thereby letting concurrent transactions interested in mutually exclusive sets of rows execute without blocking each other. Optimized locking combines these two techniques with the prior scheme of in-memory row locks. This combination to improve common isolation levels (like Read Committed Snapshot Isolation) while retaining support for Serializable isolation level in a developer-friendly manner distinguishes this work from prior art. The paper presents in detail this new scheme which required changes in both the storage engine and the query processing engine. It also presents the results of deploying optimized locking to more than eleven million SQL databases in Azure. Chaitanya Sreenivas Ravella, Prashanth Purnananda, Hanuma Kodavalla, Peter Byrne, Adrian-Leonard Radu, Wayne Chen, Srikanth Sampath, Naga Bhavana Atluri, Srinag Rao, Priyanka Kakade |
ICDE | 10 |