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

Jonathan Gabor

dblp:231/6287 · DBLP profile ↗
← Back
1ranked-venue papers
0as 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 · 1

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.

Theoretical computer science
1 paper
Algorithms and data structures · 100%
Databases, data mining, and information retrieval
1 paper
Indexing and storage engines · 100%

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

TopicWeightPapersLastEvidence papers
Indexing and storage engines
string indexing
0.412020
Suffix Rank: a new scalable algorithm for indexing large string collections · Proc. VLDB Endow. 2020
Algorithms and data structures › sequence algorithms
string algorithms
0.412020
Suffix Rank: a new scalable algorithm for indexing large string collections · Proc. VLDB Endow. 2020
Algorithms and data structures › sequence algorithms › string algorithms › string indexing
suffix array construction
0.412020
Suffix Rank: a new scalable algorithm for indexing large string collections · Proc. VLDB Endow. 2020

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

parallel sorting · 0.9external-memory algorithm · 0.4external memory algorithms · 0.4
YearPublicationVenuePosition
2020 Suffix Rank: a new scalable algorithm for indexing large string collections
Marina Barsky, Jonathan Gabor, Mariano P. Consens, Alex Thomo
Proc. VLDB Endow.2