SkyTree: Scalable skyline computation for sensor data

Proceedings of the 3rd International Workshop on Knowledge Discovery from Sensor Data, SensorKDD'09 in Conjunction with the 15th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD-09

Volumn , Issue , 2009, Pages 114-123

  Jongwuk, Lee ^a   Hwang, Seung Won ^a  

^a Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ATTRIBUTE VALUES; COMMUNICATION COST; COMMUNICATION OVERHEADS; COMPUTATION ALGORITHM; DOMINANCE REGIONS; DYNAMIC LATTICES; EVALUATION RESULTS; GREEDY APPROXIMATION; INDEX ALGORITHMS; INDEX STRUCTURE; K POINTS; LARGE-SCALE DATASETS; MULTI CRITERIA ANALYSIS; PIVOT POINT; RESPONSE TIME; SENSOR DATA; SKYLINE QUERY;

APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL EFFICIENCY; COST REDUCTION; SENSORS;

COMPUTATION THEORY;

EID: 70450066956     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1601966.1601985     Document Type: Conference Paper

References (20)

1. W. Balke, U. Güntzer, and J. X. Zheng. Efficient distributed skylining for web information systems. In EDBT, 2004.
2. I. Bartolini, P. Ciaccia, and M. Patella. Efficient sort-based skyline evaluation. ACM TODS, 2008.
3. J. Bentley, H. Kung, M. Schkolnick, and C. Thompson. On the average number of maxima in a set of vectors and applications. In JACM, 1978.
4. J. L. Bentley, K. L. Clarkson, and D. B. Levine. Fast linear expected-time algorithms for computing maxima and convex hulls. In SODA, 1991.
5. S. Börzsönyi, D. Kossmann, and K. Stocker. The skyline operator. In ICDE, 2001.
6. S. Chaudhuri, N. Dalvi, and R. Kaushik. Robust cardinality and cost estimation for skyline operator. In ICDE, 2006.
7. J. Chomicki, P. Godfery, J. Gryz, and D. Liang. Skyline with presorting. In ICDE, 2003.
8. J. Chomicki, P. Godfrey, J. Gryz, and D. Liang. Skyline with presorting: Theory and optimizations. In Intelligent Information Systems, 2005.
9. P. Godfrey. Skyline cardinality for relational processing. In Foundations of Information and Knowledge Systems, 2004.
10. P. Godfrey, R. Shipley, and J. Gryz. Maximal vector computation in large data sets. In VLDB, 2005.
11. K. Hose, C. Lemke, and K. Sattler. Processing relaxed skylines in pdms using distributed data summaries. In CIKM, 2006.
12. D. Kossmann, F. Ramsak, and S. Rost. Shooting stars in the sky: An online algorithm for skyline queries. In VLDB, 2002.
13. H. T. Kung, F. Luccio, and F. Preparata. On finding the maxima of a set of vectors. JACM, 1975.
14. K. C. Lee, B. Zheng, H. Li, and W.-C. Lee. Approaching the skyline in Z order. In VLDB, 2007.
15. X. Lin, Y. Yuan, Q. Zhang, and Y. Zhang. Selecting stars: The k most representative skyline operator. In ICDE, 2007.
16. E. Lo, K. Y. Yip, K.-I. Lin, and D. W. Cheung. Progressive skylining over web-accessible database. Data & Knowledge Enginnering, 2006.
17. M. Morse, J. M. Patel, and H. Jagadish. Efficient skyline computation over low-cardinailty domains. In VLDB, 2007.
18. D. Papadias, Y. Tao, G. Fu, and B. Seeger. An optimal and progessive algorithm for skyline queries. In SIGMOD, 2003.
19. S. Park, T. Kim, J. Park, J. Kim, and H. Im. Parallel skyline computation on multicore architectures. In ICDE, 2009.
20. K. Tan, P. Eng, and B. C. Ooi. Efficient progressive skyline computation. In VLDB, 2001.