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

Holger Riedel

dblp:91/2981 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1996
—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
Data models and query languages · 61% Query processing and optimization · 30% Database theory · 9%

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

TopicWeightPapersLastEvidence papers
Data models and query languages › query algebra
object algebra		 0.011996
Evaluation and Optimization of the LIVING IN A LATTICE Rule Language · ICDE 1996
Data models and query languages › query language
object-oriented query language		 0.011996
Evaluation and Optimization of the LIVING IN A LATTICE Rule Language · ICDE 1996
Query processing and optimization › recursive query
recursive query evaluation		 0.011996
Evaluation and Optimization of the LIVING IN A LATTICE Rule Language · ICDE 1996

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

object algebra · 0.0
YearPublicationVenuePosition
1996 Evaluation and Optimization of the LIVING IN A LATTICE Rule Language
abstract
We introduce an evaluation technique for a declarative object-oriented database (OODB) query language. The query language is rule-based and can be evaluated and optimized using an appropriate object algebra. We introduce a new framework which uses concepts of the object-oriented data model to define adequate accesses to the database. Additionally, problems according to the evaluation of recursive queries are discussed.
Holger Riedel, Andreas Heuer 0001
 ICDE1