Indexing for progressive skyline computation

Data and Knowledge Engineering

Volumn 46, Issue 2, 2003, Pages 169-201

  Eng, Pin Kwang ^a   Ooi, Beng Chin ^a   Tan, Kian Lee ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

B+ tree index; Bitmap; Dominate; Progressive; Skyline

Indexed keywords

ALGORITHMS; QUERY LANGUAGES; RESPONSE TIME (COMPUTER SYSTEMS);

BITMAP STRUCTURE;

INDEXING (OF INFORMATION);

EID: 0038356892     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0169-023X(02)00208-2     Document Type: Article

References (19)

1. R. Agrawal, E. Wimmers, A framework for expressing and combining preferences, in: Proceedings of the 2000 ACM-SIGMOD International Conference on Management of Data, Dallas, Texas, May 2000, pp. 297-306.
2. Kung H.T., Luccio F., Preparata F.P. On finding the maxima of a set of vectors. Journal of the ACM. 22(4):1975;469-476.
3. S. Borzsonyi, D. Kossmann, K. Stocker, The skyline operator, in: Proceedings of the 17th International Conference on Data Engineering, Heidelberg, Germany, April 2001.
4. M. Carey, D. Kossmann, On saying "enough already!" in sql, in: Proceedings of the 1997 ACM-SIGMOD International Conference on Management of Data, Tucson, Arizona, June 1997, pp. 219-230.
5. Comer D. The ubiquitous b-tree. ACM Computing Surveys. 11(2):1979;121-137.
6. V. Hristidis, N. Koudas, Y. Papakonstantinou, Prefer: a system for the efficient execution of multi-parametric ranked queries, in: Proceedings of the 2001 ACM-SIGMOD International Conference on Management of Data, Santa Barbara, CA, May 2001.
7. n Information Processing Letters. 38(5):1991;277-278.
8. McLain D.H. Drawing contours from arbitrary data points. The Computer Journal. 17(4):1974.
9. P.E. O'Neil, D. Quass, Improved query performance with variant indexes, in: Proceedings of the 1997 ACM-SIGMOD International Conference on Management of Data, Tucson, Arizona, USA, May 1997, pp. 38-49.
10. B.C. Ooi, K.L. Tan, C. Yu, S. Bressan, Indexing the edge: a simple and yet efficient approach to high-dimensional indexing, in: Proceedings of the 18th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2000, pp. 166-174.
11. C.H. Papadimitriou, M. Yannakakis, Multiobjective query optimization, in: Proceedings of the Twenteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Santa Barbara, California, USA, May 2001.
12. Preparata F.P., Shamos M.I. Computational Geometry: An Introduction. 1985;Springer-Verlag.
13. Ramakrishnan R., Gehrke J. Database Management Systems. 1999;McGraw-Hill.
14. Rhee C., Dhall S.K., Lakshmivarahan S. The minimum weight dominating set problem for permutation graphs is in nc. Journal of Parallel and Distributed Computing. 28(2):1995;109-112.
15. D. Rinfret, P.E. O'Neil, E.J. O'Neil, Bit-sliced index arithmetic, in: Proceedings of the 2001 ACM-SIGMOD International Conference on Management of Data, Santa Barbara, California, USA, May 2001.
16. N. Roussopoulos, S. Kelley, F. Vincent, Nearest neighbor queries, in: Proceedings of the 1995 ACM-SIGMOD International Conference on Management of Data, San Jose, CA, USA, May 1995.
17. Stojmenovic I., Miyakawa M. An optimal parallel algorithm for solving the maximal elements problem in the plane. Parallel Computing. 7(2):1988;249-251.
18. K.L. Tan, P.K. Eng, B.C. Ooi, Efficient progressive skyline computation, in: Proceedings of the 27th International Conference on Very Large Data Bases, Rome, Italy, September 2001.
19. C. Yu, High Dimensional Indexing, Ph.D. Thesis, Department of Computer Science, National University of Singapore, July 2001.