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)
In a variety of applications, we n e e d t o k eep track of the development of a data set over time. For maintaining and querying these multiversion data eeciently, external storage structures are an absolute necessity. We propose a multiversion B-tree that supports insertions and deletions of data items at the current v ersion, and range queries and exact(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)
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)
ÐMany recent database applications must deal with similarity queries. For such applications, it is important to measure the similarity between two objects using the distance between them. Focusing on this problem, this paper proposes the Slim-tree, a new dynamic tree for organizing metric data sets in pages of fixed size. The Slim-tree uses the triangle(More)
Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation, DARPA, or other funding parties. Abstract. In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree(More)
In this paper, we consider how to exploit multiple disks to improve the performance of B-tree structured files. Attention is paid both to the response time of individual operations and to the throughput of the system in a multiuser environment. We begin with a survey of three different approaches to designing multi-disk B-trees: distributing records among(More)
We propose an asymptotically optimal multiversion B-tree. In our setting, insertions and deletions of data items are allowed only for the present version, whereas range queries and exact match queries are allowed for any version, present or past. The technique we present for transforming a (usual single version) B-tree into a multiversion B-tree is more(More)