Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/progressive-skyline-computation-in-database-systems-L6nrtPzM3x
References (36)
-
Wolf-Tilo Balke, Ulrich Güntzer, J. Zheng (2004)
Efficient Distributed Skylining for Web Information Systems -
Y. Theodoridis, E. Stefanakis, T. Sellis (2000)
Efficient Cost Models for Spatial Queries Using R-TreesIEEE Trans. Knowl. Data Eng., 12
-
Yuan-Chi Chang, L. Bergman, Vittorio Castelli, Chung-Sheng Li, Ming-Ling Lo, John Smith (2000)
The onion technique: indexing for linear optimization queries -
J. Matoušek (1991)
Computing Dominances in E^nInf. Process. Lett., 38
-
A. Henrich (1994)
A Distance Scan Algorithm for Spatial Access Structures -
B. Salzberg, V. Tsotras, C. Jensen, Michael Ohlen, Renato Busatto, H. Gregersen, K. Torp, R. Snodgrass, Anindya Datta, Sudha Ram, C. Dyreson, K. Ryu, A. Steiner, E. Zurich, J. Wijsen, V. Brussel, Belgium
A Comparison of Access Methods for Temporal Data Title a Comparison of Access Methods for Temporal Data Individual Participants -
K. Tan, P. Eng, B. Ooi (2001)
Efficient Progressive Skyline Computation -
C. Böhm, H. Kriegel (2001)
Determining the Convex Hull in Large Multidimensional Databases -
Ronald Fagin, A. Lotem, M. Naor (2001)
Optimal aggregation algorithms for middlewareJ. Comput. Syst. Sci., 66
-
N. Roussopoulos, Stephen Kelley, F. Vincent (1995)
Nearest neighbor queries -
M. Muralikrishna, D. DeWitt (1988)
Equi-Depth Histograms For Estimating Selectivity Factors For Multi-Dimensional Queries -
A. Natsev, Yuan-Chi Chang, John Smith, Chung-Sheng Li, J. Vitter (2001)
Supporting Incremental Join Queries on Ranked Inputs -
S. Acharya, V. Poosala, S. Ramaswamy (1999)
Selectivity estimation in spatial databases -
H. Kung, F. Luccio, F. Preparata (1975)
On Finding the Maxima of a Set of VectorsJ. ACM, 22
-
C. Buchta (1989)
On the Average Number of Maxima in a Set of VectorsInf. Process. Lett., 33
-
Stefan Berchtold, D. Keim, H. Kriegel (2001)
The X-tree : An Index Structure for High-Dimensional Data -
B. Salzberg, V. Tsotras (1999)
Comparison of access methods for time-evolving dataACM Comput. Surv., 31
-
S. Deming (1991)
Multiple-criteria optimizationJournal of Chromatography A, 550
-
Gísli Hjaltason, H. Samet (1999)
Distance browsing in spatial databasesACM Trans. Database Syst., 24
-
Vagelis Hristidis, Nick Koudas, Y. Papakonstantinou (2001)
PREFER: a system for the efficient execution of multi-parametric ranked queries -
D. Papadias, Panos Kalnis, Jun Zhang, Yufei Tao (2001)
Efficient OLAP Operations in Spatial Data Warehouses -
A. Guttman (1984)
R-trees: a dynamic index structure for spatial searching -
Donald Kossmann, Frank Ramsak, S. Rost (2002)
Shooting Stars in the Sky: An Online Algorithm for Skyline Queries -
S. Börzsönyi, Donald Kossmann, K. Stocker (2001)
The Skyline operatorProceedings 17th International Conference on Data Engineering
-
(2003)
Received October -
N. Beckmann, H. Kriegel, R. Schneider, B. Seeger (1990)
The R*-tree: an efficient and robust access method for points and rectangles -
T. Sellis, N. Roussopoulos, C. Faloutsos (1987)
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects -
Dan Suciu, G. Weikum (2005)
ACM Transactions on Database SystemsACM Transactions on Database Systems, 30
-
Franco Preparata, M. Shamos (1985)
Computational Geometry -
D. Papadias, Yufei Tao, Greg Fu, B. Seeger (2003)
An optimal and progressive algorithm for skyline queries -
D. McLain (1974)
Drawing Contours from Arbitrary Data PointsComput. J., 17
-
J. Chomicki, P. Godfrey, Jarek Gryz, Dongmin Liang (2003)
Skyline with presortingProceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)
-
Yasushi Sakurai, Masatoshi Yoshikawa, Shunsuke Uemura, Haruhiko Kojima (2000)
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation -
H. Ferhatosmanoğlu, I. Stanoi, D. Agrawal, A. Abbadi (2001)
Constrained Nearest Neighbor Queries -
J. Hellerstein, Ron Avnur, Andy Chou, C. Hidber, Christopher Olston, Vijayshankar Raman, T. Roth, P. Haas (1999)
Interactive data Analysis: The Control ProjectComputer, 32
-
M. Muralikrishna, D. DeWitt (1988)
Equi-depth multidimensional histograms, 17
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2005 by ACM Inc.
- ISSN
- 0362-5915
- DOI
- 10.1145/1061318.1061320
- Publisher site
- See Article on Publisher Site
Abstract
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 the database community, especially for progressive methods that can quickly return the initial results without reading the entire database. All the existing algorithms, however, have some serious shortcomings which limit their applicability in practice. In this article we develop branch-and-bound skyline (BBS), an algorithm based on nearest-neighbor search, which is I/O optimal, that is, it performs a single access only to those nodes that may contain skyline points. BBS is simple to implement and supports all types of progressive processing (e.g., user preferences, arbitrary dimensionality, etc). Furthermore, we propose several interesting variations of skyline computation, and show how BBS can be applied for their efficient processing.
Journal
ACM Transactions on Database Systems (TODS) – Association for Computing Machinery
Published: Mar 1, 2005