Selecting stars: The k most representative skyline operator

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2007, Pages 86-95

  Lin, Xuemin ^a   Yuan, Yidong ^a   Zhang, Qing ^b   Zhang, Ying ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION MAKING; DYNAMIC PROGRAMMING; MATHEMATICAL OPERATORS; PROBABILITY; PROBLEM SOLVING;

2D-SPACE; MULTI-CRITERIA DECISION MAKING; RANDOMIZED ALGORITHM; SKYLINE COMPUTATION;

COMPUTATION THEORY;

EID: 34548740177     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2007.367854     Document Type: Conference Paper

References (37)

1. W.-T. Balke, U. Güntzer, and J. X. Zheng. Efficient distributed sky lining for web information systems. In EDBT 2004.
2. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. In SIGMOD 1990.
3. J. L. Bentley, H. T. Kung, M. Schkolnick, and C. D. Thompson. On the average number of maxima in a set of vectors and applications. JACM, 25(4):536-543, 1978.
4. S. Börzsönyi, D. Kossmann, and K. Stocker. The skyline operator. In ICDE 2001.
5. T. Brinkhoff, H.-P. Kriegel, and B. Seeger. Efficient processing of spatial joins using r-trees. In SIGMOD 1993.
6. C. Y. Chan, P.-K. Eng, and K.-L. Tan. Stratified computation of skylines with partially-ordered domains. In SIGMOD 2005.
7. C. Y. Chan, H. V. Jagadish, K.-L. Tan, A. K. Tung, and Z. Zhang. Finding k-dominant skylines in high dimensional space. In SIGMOD 2006.
8. C. Y. Chan, H. V. Jagadish, K.-L. Tan, A. K. Tung, and Z. Zhang. On high dimensional skylines. In EDBT 2006.
9. J. Chomicki, P. Godfrey, J. Gryz, and D. Liang. Skyline with presorting. In ICDE 2003.
10. K. Deng, X. Zhou, and H. T. Shen. Multi-source skyline query processing in road networks. In ICDE 2007.
11. W. Feller. An Introduction to Probability Theory and Its Applications. John Wiley & Sons, Inc., 1966.
12. P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31(2):182-209, 1985.
13. P. Godfrey, R. Shipley, and J. Gryz. Maximal vector computation in large data sets. In VLDB 2005.
14. A. Guttman. R-trees: A dynamic index structure for spatial searching. In SIGMOD 1984.
15. G. R. Hialtason and H. Samet. Distance browsing in spatial databases. TODS, 24(2):265-318, 1999.
16. D. S. Hochbaum. Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing, 11(3):555-556, 1982.
17. Y.-W. Huang, N. Jing, and E. A. Rundensteiner. Spatial joins using R-trees: Breadth-first traversal with global optimizations. In VLDB 1997.
18. Z. Huang, C. S. Jensen, H. Li, and B. C. Ooi. Skyline queries against mobile lightweight devices in MANETs. In ICDE 2006.
19. H. V. Jagadish, N. Koudas, S. Muthukrishnan, V. Poosala, K. C. Sevcik, and T. Suel. Optimal histograms with quality guarantees. In VLDB 1998.
20. S. Kapoor. Dynamic maintenance of maxima of 2-d point sets. SIAM Journal on Computing, 29(6):1858-1877, 2000.
21. V. Koltun and C. H. Papadimitriou. Approximately dominating representatives. In ICDT 2005.
22. D. Kossmann, F. Ramsak, and S. Rost. Shooting stars in the sky: An online algorithm for skyline queries. In VLDB 2002.
23. H. T. Kung, F. Luccio, and F. P. Preparata. On finding the maxima of a set of vectors. JACM, 22(4):469-476, 1975.
24. C. Li, B. C. Ooi, A. K. Tung, and S. Wang. DATA: A data cube for dominant relationship analysis. In SIGMOD 2006.
25. X. Lin, Q. Liu, Y. Yuan, X. Zhou, and H. Lu. Summarizing level-two topological relations in large spatial datasets. TODS, 31(2):584-630, 2006.
26. X. Lin, Y Yuan, W. Wang, and H. Lu. Stabbing the sky: Efficient skyline computation over sliding windows. In ICDE 2005.
27. Massive Data Analysis Lab. http://www.cs.rutgers.edu/~muthu./massdal. html.
28. D. Papadlas, N. Mamoulis, and Y. Theodoridis. Processing and optimization of multiway spatial joins using R-trees. In PODS 1999.
29. D. Papadias, Y Tao, G. Fu, and B. Seeger. An optimal and progressive algorithm, for skyline queries. In SIGMOD 2003.
30. J. Pei, W Jin, M. Ester, and Y. Tao. Catching the best views of skyline: A semantic approach based on decisive subspaces. In VLDB 2005.
31. P. Rigaux, M. Scholl, and A. Voisard. Introduction to Spatial Databases: Applications to GIS. 2000.
32. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In SIGMOD 1995.
33. K.-L. Tan, P.-K. Eng, and B. C. Ooi. Efficient progressive skyline computation. In VLDB 2001.
34. Y. Tao and D. Papadias. Maintaining sliding window skylines on data streams. TKDE, 18(2):377-391, 2006.
35. Y Tao, X. Xiao, and J. Pei. SUB S KY: Efficient computation of skylines in subspaces. In ICDE 2006.
36. T. Xia and D. Zhang. Refreshing the sky: The compressed skycube with efficient support for frequent updates. In SIGMOD 2006.
37. Y. Yuan, X. Lin, Q. Liu, W. Wang, J. X. Yu, and Q. Zhang. Efficient computation of the skyline cube. In VLDB 2005.