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

Chaichon Wongkham

dblp:324/2244 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2022
—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 first-author · 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
Indexing and storage engines · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Indexing and storage engines
learned index
0.612022
Are Updatable Learned Indexes Ready? · Proc. VLDB Endow. 2022
Indexing and storage engines › learned index
updatable learned index
0.612022
Are Updatable Learned Indexes Ready? · Proc. VLDB Endow. 2022
Performance modeling and evaluation
benchmarking
0.612022
Are Updatable Learned Indexes Ready? · Proc. VLDB Endow. 2022
Performance modeling and evaluation › benchmarking › database system benchmarking
index benchmarking
0.612022
Are Updatable Learned Indexes Ready? · Proc. VLDB Endow. 2022

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

workload characterization · 1.1concurrency testing · 1.1
YearPublicationVenuePosition
2022 Are Updatable Learned Indexes Ready?
abstract
Recently, numerous promising results have shown that updatable learned indexes can perform better than traditional indexes with much lower memory space consumption. But it is unknown how these learned indexes compare against each other and against the traditional ones under realistic workloads with changing data distributions and concurrency levels. This makes practitioners still wary about how these new indexes would actually behave in practice. To fill this gap, this paper conducts the first comprehensive evaluation on updatable learned indexes. Our evaluation uses ten real datasets and various workloads to challenge learned indexes in three aspects: performance, memory space efficiency and robustness. Based on the results, we give a series of takeaways that can guide the future development and deployment of learned indexes.
Chaichon Wongkham, Baotong Lu, Chris Liu, Zhicong Zhong, Eric Lo 0001, Tianzheng Wang 0001
Proc. VLDB Endow.1