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

Ulrich Finke

dblp:43/5930 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1995
—ORCID · none

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

Databases, data management, data science and information retrieval · 1Theory of computation · 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.

Theoretical computer science
1 paper
Computational geometry · 67% Distributed computing theory · 33%
Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 56% Indexing and storage engines · 44%

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

TopicWeightPapersLastEvidence papers
Computational geometry
arrangement		 0.011995
Overlaying Simply Connected Planar Subdivisions in Linear Time · SCG 1995
Distributed computing theory › distributed systems
overlay networks		 0.011995
Overlaying Simply Connected Planar Subdivisions in Linear Time · SCG 1995
Computational geometry › geometric data structures
planar subdivision		 0.011995
Overlaying Simply Connected Planar Subdivisions in Linear Time · SCG 1995
Indexing and storage engines › multidimensional indexing
grid file		 0.011993
A New Algorithm for Computing Joins with Grid Files · ICDE 1993
Query processing and optimization
join processing		 0.011993
A New Algorithm for Computing Joins with Grid Files · ICDE 1993
Query processing and optimization
cost model		 0.011993
A New Algorithm for Computing Joins with Grid Files · ICDE 1993

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

linear-time algorithm · 0.0inner join · 0.0cost model · 0.0BR2-directory · 0.0
YearPublicationVenuePosition
1995 Overlaying Simply Connected Planar Subdivisions in Linear Time
abstract
We present an algorithm which computes the overlay Hb r+ rIg of two Simply connected planar subdivisions ~b and Hg; we assume that ~b (resp.~) and all its components are colored in blue (resp.green).The algorithm runs in O(n + k) time and space, where n denotes the total nuruber of edges of ~b and IIg and k the number of intersections between blue and green edges.
Ulrich Finke, Klaus H. Hinrichs
 SCG1
1993 A New Algorithm for Computing Joins with Grid Files
abstract
The BR/sup 2/-directory representation, a directory structure for grid files, and a join algorithm for the evaluation of general n-ary joins on grid files are presented. It is shown that the CPU cost of the join algorithm is successfully reduced by introducing an inner join. A comparison with the hash join algorithm and a join algorithm on k-d trees for equijoins is based on a cost model developed for query processing with grid files. The join algorithm outperforms the hash join, a specialized join method for equijoins, and the join algorithm on k-d trees for equijoins.>
Ludger Becker, Klaus H. Hinrichs, Ulrich Finke
 ICDE3