Optimizing skyline queries in SPA distributed networks

被引：0
作者：
Huang, Zhen-Hua [1 ,2 ]
Xiang, Yang [1 ]
Sun, Sheng-Li [3 ]
Chen, Qian [1 ]
机构：
[1] Department of Computer and Technology, Tongji University
[2] Key Laboratory of Embedded System and Service Computing, Ministry of Education, Tongji University
[3] School of Software and Microelectronics, Peking University
来源：
Tien Tzu Hsueh Pao/Acta Electronica Sinica | 2013年 / 41卷 / 08期
关键词：
Information service; Query optimization; Skyline query; SUPER-PEER architecture;
D O I：
10.3969/j.issn.0372-2112.2013.08.010
中图分类号：
学科分类号：
摘要：
Skyline query has recently received a lot of attention in information service community. The TPAOSS (Three-Phase Algorithm for Optimizing Skyline Scalar) algorithm has two performance drawbacks: (1) in the third phase of TPAOSS, as the number of objects on net nodes increases, the length of bloom filter will increases exponentially, which will seriously influence the efficiency of obtaining replicated values and the occupation size of memory; (2) the TPAOSS algorithm does not consider the computation efficiency of local or global subspace skyline queries in each net node. Motivated by these facts, we propose EPSSQDN (Efficient Processing of Subspace Skyline Queries in Distributed Networks), an algorithm for efficient processing of subspace skyline queries in SPA distributed networks. Moreover, in order to further reduce the computation cost of subspace skyline queries and decrease the volume of data transferred, we present an efficient optimized techniques. Furthermore, we present extensive experiments that demonstrate our method is more advantageous than the TPAOSS algorithm.
引用
收藏
页码：1515 / 1520
页数：5
相关论文
共 12 条
  • [1] Borzsonyi S., Kossmann D., Stocker K., The skyline operator, Proc IEEE ICDE '01, pp. 421-430, (2001)
  • [2] Huang Z., Wang Z., Guo J., Wang W., Shi B., Efficient preprocessing of subspace skyline queries in P2P networks, Journal of Software, 20, 7, pp. 1825-1838, (2009)
  • [3] Wu P., Zhang C., Feng Y., Zhao B., Agrawal D., Abbadi A., Parallelizing skyline queries for scalable distribution, Proc EDBT'06, pp. 112-130, (2006)
  • [4] Li H., Tan Q., Lee W., Efficient progressive processing of skyline queries in peer-to-peer systems, Proc INFOSCALE'06, pp. 84-93, (2006)
  • [5] Wang S., Ooi B., Tung A., Xu L., Efficient skyline query processing on peer-to-peer networks, Proc ICDE'07, pp. 372-381, (2007)
  • [6] Banafaa K., Li R., Efficient algorithms for constrained subspace skyline query in structured peer-to-peer systems, Proc WAIM '12, pp. 334-345, (2012)
  • [7] Xue X., Zhang S., Zhang H., Wang X., Ge L., Yin Q., Content-based routing algorithms of the publish-subscribe systems, Acta Electronica Sinica, 36, 5, pp. 953-961, (2008)
  • [8] Parreira J., Michel S., Weikum G., P2P Dating: Real life inspired semantic overlay networks for web search, Information Processing and Management: An International Journal, 43, 3, pp. 643-664, (2007)
  • [9] Zhao K., Tao Y., Zhou S., Efficient top-k processing in large-scaled distributed environments, Data & Knowledge Engineering, 63, 2, pp. 315-335, (2007)
  • [10] Wu W., Wu Y., Zhao W., Chord-based semantic web service discovery, Acta Electronica Sinica, 35, Z2, pp. 152-155, (2007)
12