
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Lin Zhu, Yufei Tao, Shuigeng Zhou, "Distributed Skyline Retrieval with Low Bandwidth Consumption," IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 3, pp. 384400, March, 2009.  
BibTex  x  
@article{ 10.1109/TKDE.2008.142, author = {Lin Zhu and Yufei Tao and Shuigeng Zhou}, title = {Distributed Skyline Retrieval with Low Bandwidth Consumption}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {21}, number = {3}, issn = {10414347}, year = {2009}, pages = {384400}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.142}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Distributed Skyline Retrieval with Low Bandwidth Consumption IS  3 SN  10414347 SP384 EP400 EPD  384400 A1  Lin Zhu, A1  Yufei Tao, A1  Shuigeng Zhou, PY  2009 KW  Distributed databases KW  Spatial databases VL  21 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] W.T. Balke, U. Guntzer, and J.X. Zheng, “Efficient Distributed Skylining for Web Information Systems,” Proc. Ninth Int'l Conf. Extending Database Technology (EDBT '04), pp. 256273, 2004.
[2] W.T. Balke, W. Nejdl, W. Siberski, and U. Thaden, “Progressive Distributed PeertoPeer Top$k$ Retrieval in PeertoPeer Networks,” Proc. 21st Int'l Conf. Data Eng. (ICDE '05), pp. 174185, 2005.
[3] J.L. Bentley, H.T. Kung, and M. Schkolnick, “On the Average Number of Maxima in a Set of Vectors and Applications,” J. ACM, vol. 25, no. 4, pp. 536543, 1978.
[4] S. Borzsonyi, D. Kossmann, and K. Stocker, “The Skyline Operator,” Proc. 17th Int'l Conf. Data Eng. (ICDE '01), pp. 421430, 2001.
[5] C.Y. Chan, P.K. Eng, and K.L. Tan, “Stratified Computation of Skylines with PartiallyOrdered Domains,” Proc. ACM SIGMOD '05, pp. 203214, 2005.
[6] C.Y. Chan, H.V. Jagadish, K.L. Tan, A.K.H. Tung, and Z. Zhang, “Finding $K$ Dominant Skylines in High Dimensional Space,” Proc. ACM SIGMOD '06, pp. 503514, 2006.
[7] C.Y. Chan, H.V. Jagadish, K.L. Tan, A.K.H. Tung, and Z. Zhang, “On High Dimensional Skylines,” Proc. 10th Int'l Conf. Extending Database Technology (EDBT '06), pp. 478495, 2006.
[8] S. Chaudhuri, N. Dalvi, and R. Kaushik, “Robust Cardinality and Cost Estimation for Skyline Operator,” Proc. 22nd Int'l Conf. Data Eng. (ICDE), 2006.
[9] S. Chaudhuri, G. Das, V. Hristidis, and G. Weikum, “Probabilistic Ranking of Database Query Results,” Proc. 30th Int'l Conf. Very Large Data Bases (VLDB '04), pp. 888899, 2004.
[10] J. Chomicki, P. Godfrey, and J. Gryz, “Skyline with Presorting,” Proc. 19th Int'l Conf. Data Eng. (ICDE '03), pp. 717816, 2003.
[11] E. Dellis and B. Seeger, “Efficient Computation of Reverse Skyline Queries,” Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB '07), pp. 291302, 2007.
[12] K. Deng, X. Zhou, and H.T. Shen, “MultiSource Skyline Query Processing in Road Networks,” Proc. 24th Int'l Conf. Data Eng. (ICDE '07), pp. 796805, 2007.
[13] R. Fagin, A. Lotem, and M. Naor, “Optimal Aggregation Algorithms for Middleware,” J. Computer and System Sciences, vol. 66, pp. 614656, 2003.
[14] P. Godfrey, “Skyline Cardinality for Relational Processing,” Proc. Third Int'l Symp. Foundations of Information and Knowledge Systems (FoIKS '04), pp. 7897, 2004.
[15] P. Godfrey, R. Shipley, and J. Gryz, “Maximal Vector Computation in Large Data Sets,” Proc. 31st Int'l Conf. Very Large Data Bases (VLDB '05), pp. 229240, 2005.
[16] Z. Huang, C.S. Jensen, H. Lu, and B.C. Ooi, “Skyline Queries against Mobile Lightweight Devices in Manets,” Proc. 22nd Int'l Conf. Data Eng. (ICDE), 2006.
[17] H.V. Jagadish, B.C. Ooi, and Q.H. Vu, “Baton: A Balanced Tree Structure for PeertoPeer Networks,” Proc. 31st Int'l Conf. Very Large Data Bases (VLDB '05), pp. 661672, 2005.
[18] D. Kossmann, F. Ramsak, and S. Rost, “Shooting Stars in the Sky: An Online Algorithm for Skyline Queries,” Proc. 28th Int'l Conf. Very Large Data Bases (VLDB '02), pp. 275286, 2002.
[19] H.T. Kung, F. Luccio, and F.P. Preparata, “On Finding the Maxima of a Set of Vectors,” J. ACM, vol. 22, no. 4, pp. 469476, 1975.
[20] K. Lee, B. Zheng, H. Li, and W.C. Lee, “Approaching the Skyline in $Z$ Order,” Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB '07), pp. 279290, 2007.
[21] C. Li, B.C. Ooi, A.K.H. Tung, and S. Wang, “Dada: A Data Cube for Dominant Relationship Analysis,” Proc. ACM SIGMOD '06, pp. 659670, 2006.
[22] X. Lin, Y. Yuan, W. Wang, and H. Lu, “Stabbing the Sky: Efficient Skyline Computation over Sliding Windows,” Proc. 21st Int'l Conf. Data Eng. (ICDE), 2005.
[23] X. Lin, Y. Yuan, Q. Zhang, and Y. Zhang, “Selecting Stars: The $K$ Most Representative Skyline Operator,” Proc. 23rd Int'l Conf. Data Eng. (ICDE '07), pp. 8695, 2007.
[24] M. Morse, J.M. Patel, and H.V. Jagadish, “Efficient Skyline Computation over LowCardinality Domains,” Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB '07), pp. 267278, 2007.
[25] D. Papadias, Y. Tao, G. Fu, and B. Seeger, “An Optimal and Progressive Algorithm for Skyline Queries,” Proc. ACM SIGMOD '03, pp. 467478, 2003.
[26] J. Pei, A.W.C. Fu, X. Lin, and H. Wang, “Computing Compressed Multidimensional Skyline Cubes Efficiently,” Proc. 23rd Int'l Conf. Data Eng. (ICDE '07), pp. 96105, 2007.
[27] J. Pei, B. Jiang, X. Lin, and Y. Yuan, “Probabilistic Skylines onUncertain Data,” Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB '07), pp. 1526, 2007.
[28] J. Pei, W. Jin, M. Ester, and Y. Tao, “Catching the Best Views of Skyline: A Semantic Approach Based on Decisive Subspaces,” Proc. 31st Int'l Conf. Very Large Data Bases (VLDB '05), pp. 253564, 2005.
[29] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker, “AScalable ContentAddressable Network,” Proc. ACM SIGCOMM'01, pp. 161172, 2001.
[30] M. Sharifzadeh and C. Shahabi, “The Spatial Skyline Query,” Proc. 32nd Int'l Conf. Very Large Data Bases (VLDB), 2006.
[31] K.L. Tan, P.K. Eng, and B.C. Ooi, “Efficient Progressive Skyline Computation,” Proc. 17th Int'l Conf. Data Eng. (ICDE '01), pp.301310, 2001.
[32] Y. Tao and D. Papadias, “Maintaining Sliding Window Skylines on Data Streams,” IEEE Trans. Knowledge and Data Eng., vol. 18, no. 2, pp. 377391, Feb. 2006.
[33] Y. Tao, X. Xiao, and J. Pei, “Subsky: Efficient Computation of Skylines in Subspaces,” Proc. 22nd Int'l Conf. Data Eng. (ICDE), 2006.
[34] M. Theobald, G. Weikum, and R. Schenkel, “Top$k$ Query Evaluation with Probabilistic Guarantees,” Proc. 30th Int'l Conf. Very Large Data Bases (VLDB '04), pp. 648659, 2004.
[35] A. Vlachou, C. Doulkeridis, Y. Kotidis, and M. Vazirgiannis, “Skypeer: Efficient Subspace Skyline Computation over Distributed Data,” Proc. 23rd Int'l Conf. Data Eng. (ICDE '07), pp. 416425, 2007.
[36] S. Wang, B.C. Ooi, A.K.H. Tung, and L. Xu, “Efficient Skyline Query Processing on PeertoPeer Networks,” Proc. 23rd Int'l Conf. Data Eng. (ICDE '07), pp. 11261135, 2007.
[37] P. Wu, D. Agrawal, Ö. Egecioglu, and A.E. Abbadi, “Deltasky: Optimal Maintenance of Skyline Deletions without Exclusive Dominance Region Generation,” Proc. 23rd Int'l Conf. Data Eng. (ICDE '07), pp. 486495, 2007.
[38] P. Wu, C. Zhang, and Y. Feng, “Parallelizing Skyline Queries forScalable Distribution,” Proc. Int'l Conf. Extending Database Technology (EDBT '05), pp. 112130, 2005.
[39] T. Xia and D. Zhang, “Refreshing the Sky: The Compressed Skycube with Efficient Support for Frequent Updates,” Proc. ACM SIGMOD '06, pp. 491502, 2006.
[40] H. Yu, H.G. Li, P. Wu, D. Agrawal, and A.E. Abbadi, “Efficient Processing of Distributed TopQueries,” Proc. 16th Int'l Conf. Database and Expert Systems Applications (DEXA '05), pp. 6574, 2005.
[41] Y. Yuan, X. Lin, Q. Liu, W. Wang, J.X. Yu, and Q. Zhang, “Efficient Computation of the Skyline Cube,” Proc. 31st Int'l Conf. Very Large Data Bases (VLDB '05), pp. 241252, 2005.
[42] K. Zhao, Y. Tao, and S. Zhou, “Efficient Top$k$ Processing in LargeScaled Distributed Environments,” Data and Knowledge Eng., vol. 63, no. 2, pp. 315335, 2007.