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
Demo Data from VLDB 2026 / reviewers in the wild / expert

Scott Meyer

dblp:18/4022 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1Databases, 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.

Databases, data mining, and information retrieval
1 paper
Graph data management · 56% Indexing and storage engines · 44%
Software engineering, system software, and programming languages
1 paper
Runtime systems and virtual machines · 100%

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

TopicWeightPapersLastEvidence papers
Indexing and storage engines
concurrent index		 0.412019
Nanosecond Indexing of Graph Data With Hash Maps and VLists · SIGMOD Conference 2019
Graph data management
graph indexing		 0.412019
Nanosecond Indexing of Graph Data With Hash Maps and VLists · SIGMOD Conference 2019
Runtime systems and virtual machines › virtual machine implementation
java virtual machine		 0.011998
The New Crop of Java Virtual Machines (Panel) · OOPSLA 1998
Runtime systems and virtual machines › dynamic compilation
just-in-time compilation		 0.011998
The New Crop of Java Virtual Machines (Panel) · OOPSLA 1998
YearPublicationVenuePosition
2019 Nanosecond Indexing of Graph Data With Hash Maps and VLists
abstract
We introduce a wait-free, multi-reader, single-writer, "kill -9" durable, indexing structure for in-memory social graph databases. This structure requires no communication from the readers back to the writer, allowing for trivial read scalability and isolation. We support online updates without compromising availability or read performance. Our structure supports looking up small subgraphs in 80 nanoseconds and a materialization rate of 12 nanoseconds per edge. Storage takes 7 bytes per edge per index and supports almost 1 million online writes per second.
Andrew Carter, Andrew Rodriguez, Scott Meyer
 SIGMOD Conference4
1998 The New Crop of Java Virtual Machines (Panel)
Lars Bak, John Duimovich, Jesse Fang, Scott Meyer, David M. Ungar
 OOPSLA4