? 云计算环境下有效地查询分组策略
Journal of Computer Science and Technology
Quick Search in JCST
 Advanced Search 
      Home | PrePrint | SiteMap | Contact Us | Help
 
Indexed by   SCIE, EI ...
Bimonthly    Since 1986
Journal of Computer Science and Technology 2017, Vol. 32 Issue (6) :1231-1249    DOI: 10.1007/s11390-017-1797-9
Regular Paper << Previous Articles | Next Articles >>
云计算环境下有效地查询分组策略
Qin Liu1,2, Member, CCF, Yuhong Guo3, Jie Wu4, Fellow, IEEE, Guojun Wang5,*, Distinguished Member, CCF, Member, ACM, IEEE
1 College of Computer Science and Electronic Engineering, Hunan University, Changsha 410082, China;
2 State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications Beijing 100876, China;
3 School of Computer Science, Carleton University, Ottawa, ON K155 B6, Ganada;
4 Department of Computer and Information Sciences, Temple University, Philadelphia, PA 19122, U.S.A.;
5 School of Computer Science and Educational Software, Guangzhou University, Guangzhou 510006, China
Effective Query Grouping Strategy in Clouds
Qin Liu1,2, Member, CCF, Yuhong Guo3, Jie Wu4, Fellow, IEEE, Guojun Wang5,*, Distinguished Member, CCF, Member, ACM, IEEE
1 College of Computer Science and Electronic Engineering, Hunan University, Changsha 410082, China;
2 State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications Beijing 100876, China;
3 School of Computer Science, Carleton University, Ottawa, ON K155 B6, Ganada;
4 Department of Computer and Information Sciences, Temple University, Philadelphia, PA 19122, U.S.A.;
5 School of Computer Science and Educational Software, Guangzhou University, Guangzhou 510006, China

摘要
参考文献
相关文章
Download: [PDF 746KB]  
摘要 随着对云计算需求的发展,越来越多的机构为了节约成本和服务灵活性把数据和查询服务外包到云中。假设在一个机构内有大量用户在查询云中数据,多个代理服务器被部署到机构内部来实现成本效率和负载均衡。假设有n个查询,每个查询由多个关键词组成,给定k个代理服务器,要解决的问题是如何将n个查询分成k组从而最小化每组之间的差距,同时最小化所有组中不同关键词的数目。由于该问题是NP-难题,可以通过数学方法和启发式方法进行求解。数学分组策略使用局部最优方法,而启发式分组策略基本思想是k-means。特别是,两种策略都提供了扩展方案:第一个扩展关注鲁棒性,即在一些代理服务器失效的情况下,每个用户仍然可以得到查询结果;第二个扩展关注效益,即每个用户可以尽可能多的取回自己可能感兴趣的文件。在合成数据集和真实数据集上进行了大量实验,验证了所提分组策略的有效性。
关键词成本效率   负载均衡   鲁棒性   效益     
Abstract: As the demand for the development of cloud computing grows, more and more organizations have outsourced their data and query services to the cloud for cost-saving and flexibility. Suppose an organization that has a great number of users querying the cloud-deployed multiple proxy servers to achieve cost efficiency and load balancing. Given n queries, each of which is expressed as several keywords, and k proxy servers, the problem to be solved is how to classify n queries into k groups, in order to minimize the difference between each group and the number of distinct keywords in all groups. Since this problem is NP-hard, it is solved in mathematic and heuristic ways. Mathematic grouping uses a local optimization method, and heuristic grouping is based on k-means. Specifically, two extensions are provided:the first one focuses on robustness, i.e., each user obtains search results even if some proxy servers fail; the second one focuses on benefit, i.e., each user can retrieve as many files as possible that may be of interest without increasing the sum. Extensive evaluations have been conducted on both a synthetic dataset and real query traces to verify the effectiveness of our strategies.
Keywordscloud computing   cost efficiency   load balancing   robustness   benefit     
Received 2016-05-18;
本文基金:

This research was supported in part by the National Science Foundation of USA under Grant Nos. CNS-1449860, CNS-1461932, CNS-460971, CNS-1439672, CNS-1301774, and ECCS-1231461, the National Natural Science Foundation of China under Grant Nos. 61632009, 61472451, 61402161, 61472131, 61272151, and 61272546, the Hunan Provincial Natural Science Foundation of China under Grant No. 2015JJ3046, and the Open Foundation of State Key Laboratory of Networking and Switching Technology (Beijing University of Posts and Telecommunications) under Grant No. SKLNST-2016-2-20.

通讯作者: Guojun Wang     Email: csgjwang@gmail.com
About author: Qin Liu received her B.S.degree in 2004 from Hunan Normal University,Changsha,and her M.S.degree in 2007 and Ph.D.degree in 2012 both from Central South University,Changsha,all in computer science.She was a visiting student at Temple University,Philadelphia.Her research interests include security and privacy issues in cloud computing.
引用本文:   
Qin Liu, Yuhong Guo, Jie Wu, Guojun Wang.云计算环境下有效地查询分组策略[J]  Journal of Computer Science and Technology , 2017,V32(6): 1231-1249
Qin Liu, Yuhong Guo, Jie Wu, Guojun Wang.Effective Query Grouping Strategy in Clouds[J]  Journal of Computer Science and Technology, 2017,V32(6): 1231-1249
链接本文:  
http://jcst.ict.ac.cn:8080/jcst/CN/10.1007/s11390-017-1797-9
Copyright 2010 by Journal of Computer Science and Technology