Towards Differential Query Services in Cost-Efficient Clouds

被引:17
|
作者
Liu, Qin [1 ,2 ]
Tan, Chiu C. [3 ]
Wu, Jie [3 ]
Wang, Guojun [1 ]
机构
[1] Cent South Univ, Sch Informat Sci & Engn, Changsha 410083, Hunan, Peoples R China
[2] Hunan Univ, Coll Informat Sci & Engn, Changsha 410082, Hunan, Peoples R China
[3] Temple Univ, Dept Comp & Informat Sci, Philadelphia, PA 19122 USA
关键词
Cloud computing; cost efficiency; differential query services; privacy;
D O I
10.1109/TPDS.2013.132
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Cloud computing as an emerging technology trend is expected to reshape the advances in information technology. In a cost-efficient cloud environment, a user can tolerate a certain degree of delay while retrieving information from the cloud to reduce costs. In this paper, we address two fundamental issues in such an environment: privacy and efficiency. We first review a private keyword-based file retrieval scheme that was originally proposed by Ostrovsky. Their scheme allows a user to retrieve files of interest from an untrusted server without leaking any information. The main drawback is that it will cause a heavy querying overhead incurred on the cloud and thus goes against the original intention of cost efficiency. In this paper, we present three efficient information retrieval for ranked query (EIRQ) schemes to reduce querying overhead incurred on the cloud. In EIRQ, queries are classified into multiple ranks, where a higher ranked query can retrieve a higher percentage of matched files. A user can retrieve files on demand by choosing queries of different ranks. This feature is useful when there are a large number of matched files, but the user only needs a small subset of them. Under different parameter settings, extensive evaluations have been conducted on both analytical models and on a real cloud environment, in order to examine the effectiveness of our schemes.
引用
收藏
页码:1648 / 1658
页数:11
相关论文
共 50 条
  • [21] Cost-Efficient Tasks and Data Co-Scheduling with AffordHadoop
    Ehsan, Moussa
    Chandrasekaran, Karthiek
    Chen, Yao
    Sion, Radu
    IEEE TRANSACTIONS ON CLOUD COMPUTING, 2019, 7 (03) : 719 - 732
  • [22] Cost-Efficient VNF Placement and Scheduling in Public Cloud Networks
    Gao, Tao
    Li, Xin
    Wu, Yu
    Zou, Weixia
    Huang, Shanguo
    Tornatore, Massimo
    Mukherjee, Biswanath
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (08) : 4946 - 4959
  • [23] Supporting Cost-Efficient Multi-tenant Database Services with Service Level Objectives (SLOs)
    Luo, Yifeng
    Guo, Junshi
    Zhu, Jiaye
    Guan, Jihong
    Zhou, Shuigeng
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS (DASFAA 2017), PT I, 2017, 10177 : 592 - 606
  • [24] Cost-efficient enactment of stream processing topologies
    Hochreiner, Christoph
    Voegler, Michael
    Schulte, Stefan
    Dustdar, Schahram
    PEERJ COMPUTER SCIENCE, 2017,
  • [25] Cost-efficient Datacentre Consolidation for Cloud Federations
    Kecskemeti, Gabor
    Markus, Andras
    Kertesz, Attila
    CLOSER: PROCEEDINGS OF THE 8TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND SERVICES SCIENCE, 2018, : 213 - 220
  • [26] Cost-efficient Workflow as a Service using Containers
    Karmakar, Kamalesh
    Tarafdar, Anurina
    Das, Rajib K.
    Khatua, Sunirmal
    JOURNAL OF GRID COMPUTING, 2024, 22 (01)
  • [27] Cost-Efficient Partitioning of Spatial Data on Cloud
    Akdogan, Afsin
    Indrakanti, Saratchandra
    Demiryurek, Ugur
    Shahabi, Cyrus
    PROCEEDINGS 2015 IEEE INTERNATIONAL CONFERENCE ON BIG DATA, 2015, : 501 - 506
  • [28] Cost-efficient contingent claims with market frictions
    Ghossoub, Mario
    MATHEMATICS AND FINANCIAL ECONOMICS, 2016, 10 (01) : 87 - 111
  • [29] Cost-efficient contingent claims with market frictions
    Mario Ghossoub
    Mathematics and Financial Economics, 2016, 10 : 87 - 111
  • [30] Heterogeneous and Customized Cost-Efficient Reversible Image Degradation for Green IoT
    Zhao, Ruoyu
    Zhang, Yushu
    Lan, Rushi
    Hua, Zhongyun
    Xiang, Yong
    IEEE INTERNET OF THINGS JOURNAL, 2023, 10 (03) : 2630 - 2645