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

Marek Piwowarski

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

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 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Indexing and storage engines
batched searching		 0.011985
Comments on Batched Searching of Sequential and Tree-Structured Files · ACM Trans. Database Syst. 1985
Indexing and storage engines
file organization		 0.011985
Comments on Batched Searching of Sequential and Tree-Structured Files · ACM Trans. Database Syst. 1985

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

analytical cost modeling · 0.0
YearPublicationVenuePosition
1985 Comments on Batched Searching of Sequential and Tree-Structured Files
abstract
Exact formulas for the expected cost savings from batching requests against two types of j-ary trees are given. Approximate expressions are also presented.
Marek Piwowarski
 ACM Trans. Database Syst.1