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 EDBT 2026 / reviewers in the wild / expert

Victor Goodman

dblp:00/2383 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1976
—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.

Databases, data mining, and information retrieval
1 paper
Indexing and storage engines · 50% Query processing and optimization · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Indexing and storage engines
batched searching		 0.011976
Batched Searching of Sequential and Tree Structured Files · ACM Trans. Database Syst. 1976
Query processing and optimization › query execution
batch query processing		 0.011976
Batched Searching of Sequential and Tree Structured Files · ACM Trans. Database Syst. 1976
Performance modeling and evaluation
analytical modeling		 0.011976
Batched Searching of Sequential and Tree Structured Files · ACM Trans. Database Syst. 1976
Performance modeling and evaluation
simulation		 0.011976
Batched Searching of Sequential and Tree Structured Files · ACM Trans. Database Syst. 1976

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

numerical analysis · 0.0analytical modeling · 0.0
YearPublicationVenuePosition
1976 Batched Searching of Sequential and Tree Structured Files
abstract
The technique of batching searches has been ignored in the context of disk based online data retrieval systems. This paper suggests that batching be reconsidered for such systems since the potential reduction in processor demand may actually reduce response time. An analysis with sample numerical results and algorithms is presented.
Ben Shneiderman, Victor Goodman
 ACM Trans. Database Syst.2