• Publications
  • Influence
The R*-tree: an efficient and robust access method for points and rectangles
The R-tree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments inExpand
  • 2,975
  • 225
  • Open Access
Progressive skyline computation in database systems
The skyline of a d-dimensional dataset contains the points that are not dominated by any other point on all dimensions. Skyline computation has recently received considerable attention in theExpand
  • 837
  • 115
  • Open Access
An optimal and progressive algorithm for skyline queries
The skyline of a set of d-dimensional points contains the points that are not dominated by any other point on all dimensions. Skyline computation has recently received considerable attention in theExpand
  • 786
  • 80
  • Open Access
Efficient processing of spatial joins using R-trees
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 timeExpand
  • 639
  • 61
  • Open Access
An asymptotically optimal multiversion B-tree
Abstract.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 structuresExpand
  • 399
  • 50
  • Open Access
Efficient Computation of Reverse Skyline Queries
In this paper, for the first time, we introduce the concept of Reverse Skyline Queries. At first, we consider for a multidimensional data set P the problem of dynamic skyline queries according to aExpand
  • 268
  • 41
  • Open Access
Fast Indexing and Visualization of Metric Data Sets using Slim-Trees
Many recent database applications need to deal with similarity queries. For such applications, it is important to measure the similarity between two objects using the distance between them. FocusingExpand
  • 200
  • 21
  • Open Access
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
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 ofExpand
  • 293
  • 16
  • Open Access
Progressive Merge Join: A Generic and Non-blocking Sort-based Join Algorithm
This chapter presents a generic technique called progressive merge join (PMJ) that eliminates the blocking behavior of sort-based join algorithms. The basic idea behind PMJ is to have the joinExpand
  • 110
  • 12
  • Open Access
Multi-disk B-trees
In this paper, Dept. of Computer Science, University of Waterloo Waterloo, Ontario, Canada, N2L 3G1 we consider how to exploit multiple disks to improve the performance of B-tree structured files.Expand
  • 60
  • 11
  • Open Access