Bernhard Seeger

Learn More
The skyline of a <i>d</i>-dimensional dataset contains the points that are not dominated by any other point on all dimensions. Skyline computation has recently received considerable attention in the database community, especially for progressive methods that can quickly return the initial results without reading the entire database. All the existing(More)
The skyline of a set of <i>d</i>-dimensional points contains the points that are not dominated by any other point on all dimensions. Skyline computation has recently received considerable attention in the database community, especially for progressive (or online) algorithms that can quickly return the first skyline points without having to read the entire(More)
In a variety of applications, we need to keep track of the development of a data set over time. For maintaining and querying these multiversion data efficiently, external storage structures are an absolute necessity. We propose a multiversion B-tree that supports insertions and deletions of data items at the current version and range queries and exact match(More)
Spatial joins are one of the most important operations for combining spatial objects of several relations. The efficient processing of a spatial join is extremely important since its execution time is superlinear in the number of spatial objects of the participating relations, and this number of objects may be very high. In this paper, we present a first(More)
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the “fat-factor” which provides a simple way to quantify the degree of overlap between the nodes in a metric tree. It is well-known that the degree of overlap directly affects the query performance of index structures. There are(More)
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended spatial objects in two-dimensional data space. We present an approach for spatial join processing that is based on three steps. First, a spatial join is performed on the minimum(More)
!"#$%&'$B2"&C 3(4(&$ '"$"D"#( "EE.*4"$*0&# 8-#$ '(". F*$@ #*8*."3*$C G-(3*(#= !03 #-4@ "EE.*4"$*0&#> *$ *# *8E03$"&$ $0 8("#-3( $@( #*8*."3*$C D($F((& $F0 0DH(4$# -#*&+ $@( '*#$"&4( D($F((& $@(8= !04-#*&+ 0& $@*# E30D.(8> $@*# E"E(3 E30E0#(# $@( 6.*89$3((> " &(F 'C&"8*4 $3(( 103 03+"&*/*&+ 8($3*4 '"$" #($# *& E"+(# 01 1*)(' #*/(= :@( 6.*89$3(( -#(# $@((More)
A temporal aggregation query is an important but costly operation for applications that maintain time-evolving data (data warehouses, temporal databases, etc.). Due to the large volume of such data, performance improvements for temporal aggregation queries are critical. In this paper we examine techniques to compute temporal aggregates that include(More)
Recently there has been an increasing interest in supporting bulk operations on multidimensional index structures. Bulk loading refers to the process of creating an initial index structure for a presumably very large data set. In this paper, we present a generic algorithm for bulk loading which is applicable to a broad class of index structures. Our(More)