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

Christian Rich

dblp:05/684 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1993
—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 · 100%
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 › storage model
complex object storage		 0.011993
An Evaluation of Physical Disk I/Os for Complex Object Processing · ICDE 1993
Indexing and storage engines › storage management
storage structures		 0.011993
An Evaluation of Physical Disk I/Os for Complex Object Processing · ICDE 1993
Performance modeling and evaluation
benchmarking		 0.011993
An Evaluation of Physical Disk I/Os for Complex Object Processing · ICDE 1993
Performance modeling and evaluation › benchmarking
storage benchmarking		 0.011993
An Evaluation of Physical Disk I/Os for Complex Object Processing · ICDE 1993

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

cost model · 0.0benchmark · 0.0
YearPublicationVenuePosition
1993 An Evaluation of Physical Disk I/Os for Complex Object Processing
abstract
In order to obtain the performance required for nonstandard database environments, a hierarchical complex object model with object references is used as a storage structure for complex objects. Several storage models for these complex objects, as well as a benchmark to evaluate their performance, are described. A cost model for analytical performance evaluation is developed, and the analytical results are validated by means of measurements on the DASDBS, complex object storage system. The results show which storage structures for complex objects are the most efficient under which circumstances.>
Wouter B. Teeuw, Christian Rich, Marc H. Scholl, Henk M. Blanken
 ICDE2