Demo Data from EDBT 2026 / reviewers in the wild / expert
Dylan Zinsley
dblp:358/1742
· 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 · 46% Indexing and storage engines · 46% Transaction processing and concurrency control · 7% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Indexing and storage engines › tree index
AB-tree |
0.7 | 1 | 2023 | Approximate Queries over Concurrent Updates · Proc. VLDB Endow. 2023 |
Query processing and optimization
approximate query processing |
0.7 | 1 | 2023 | Approximate Queries over Concurrent Updates · Proc. VLDB Endow. 2023 |
Indexing and storage engines
concurrent index |
0.7 | 1 | 2023 | Approximate Queries over Concurrent Updates · Proc. VLDB Endow. 2023 |
Query processing and optimization › approximate query processing
sampling-based approximate query processing |
0.7 | 1 | 2023 | Approximate Queries over Concurrent Updates · Proc. VLDB Endow. 2023 |
Transaction processing and concurrency control › update management
concurrent update |
0.2 | 1 | 2023 | Approximate Queries over Concurrent Updates · Proc. VLDB Endow. 2023 |
Methods — techniques the papers use, named apart from their topics
index-assisted sampling · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Approximate Queries over Concurrent UpdatesabstractApproximate Query Processing (AQP) systems produce estimation of query answers using small random samples. It is attractive for the users who are willing to trade accuracy for low query latency. On the other hand, real-world data are often subject to concurrent updates. If the user wants to perform real-time approximate data analysis, the AQP system must support concurrent updates and sampling. Towards that, we recently developed a new concurrent index, AB-tree, to support efficient sampling under updates. In this work, we will demonstrate the feasibility of supporting realtime approximate data analysis in online transaction settings using index-assisted sampling. Congying Wang, Nithin Sastry Tellapuri, Sphoorthi Keshannagari, Dylan Zinsley, Zhuoyue Zhao 0001, Dong Xie 0001 |
Proc. VLDB Endow. | 4 |