Quaestor: Query Web Caching for Database-as-a-Service Providers

被引:7
|
作者
Gessert, Felix [1 ]
Schaarschmidt, Michael [2 ]
Wingerath, Wolfram [3 ]
Witt, Erik [1 ]
Yoneki, Eiko [2 ]
Ritter, Norbert [3 ]
机构
[1] Baqend, Hamburg, Germany
[2] Univ Cambridge, Cambridge, England
[3] Univ Hamburg, Hamburg, Germany
来源
PROCEEDINGS OF THE VLDB ENDOWMENT | 2017年 / 10卷 / 12期
基金
英国工程与自然科学研究理事会;
关键词
D O I
10.14778/3137765.3137773
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Today, web performance is primarily governed by round-trip latencies between end devices and cloud services. To improve performance, services need to minimize the delay of accessing data. In this paper, we propose a novel approach to low latency that relies on existing content delivery and web caching infrastructure. The main idea is to enable application-independent caching of query results and records with tunable consistency guarantees, in particular bounded staleness. QUAESTOR (Query Store) employs two key concepts to incorporate both expiration-based and invalidation-based web caches: (1) an Expiring Bloom Filter data structure to indicate potentially stale data, and (2) statistically derived cache expiration times to maximize cache hit rates. Through a distributed query invalidation pipeline, changes to cached query results are detected in real-time. The proposed caching algorithms offer a new means for data-centric cloud services to trade latency against staleness bounds, e.g. in a database-as-a-service. QUAESTOR is the core technology of the backend-as-a-service platform Baqend, a cloud service for low-latency websites. We provide empirical evidence for QUAESTOR's scalability and performance through both simulation and experiments. The results indicate that for read-heavy workloads, up to tenfold speed-ups can be achieved through QUAESTOR's caching.
引用
收藏
页码:1670 / 1681
页数:12
相关论文
共 50 条
  • [41] Query Fusion Based on the Deep Web Database
    Luo, Rong
    Gong, Yuxi
    [J]. IITAW: 2009 THIRD INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY APPLICATIONS WORKSHOPS, 2009, : 34 - 37
  • [42] Study on the Query based on Deep Web Database
    Luo, Rong
    Li, Chunguang
    Gong, Yuxi
    [J]. 2009 6TH INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1 AND 2, 2009, : 192 - 194
  • [43] Hash-based query caching method for distributed Web caching in wide area networks
    Asaka, T
    Miwa, H
    Tanaka, Y
    [J]. IEICE TRANSACTIONS ON COMMUNICATIONS, 1999, E82B (06) : 907 - 914
  • [44] A Study of Caching Strategies for Web Service Discovery
    Jacobs, Tobias
    Longo, Salvatore
    [J]. 2015 IEEE INTERNATIONAL CONFERENCE ON WEB SERVICES (ICWS), 2015, : 464 - 471
  • [45] A caching mechanism for semantic web service discovery
    Stollberg, Michael
    Hepp, Martin
    Hoffmann, Joerg
    [J]. SEMANTIC WEB, PROCEEDINGS, 2007, 4825 : 480 - +
  • [46] Practical Privacy-Preserving Spectrum Query Schemes for Database-Driven CRNs with Multiple Service Providers
    Xin, Jiajun
    Li, Ming
    Guo, Linke
    Li, Pan
    [J]. 2017 IEEE CONFERENCE ON COMMUNICATIONS AND NETWORK SECURITY (CNS), 2017, : 281 - 289
  • [47] Web marketing practices of service providers
    Deans, KR
    Gray, BJ
    Ibbotson, P
    Osborne, P
    Knightbridge, K
    [J]. SERVICE INDUSTRIES JOURNAL, 2003, 23 (03): : 82 - 102
  • [48] Optimizing performance of Web Service providers
    Dyachuk, Dmytro
    Deters, Ralph
    [J]. 21ST INTERNATIONAL CONFERENCE ON ADVANCED NETWORKING AND APPLICATIONS, PROCEEDINGS, 2007, : 46 - +
  • [49] Exploiting Query Term Correlation for List Caching in Web Search Engines
    Tong, Jiancong
    Wang, Gang
    Stones, Douglas S.
    Sun, Shizhao
    Liu, Xiaoguang
    Zhang, Fan
    [J]. PROCEEDINGS OF THE 22ND ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM'13), 2013, : 1817 - 1820
  • [50] CPU Sharing Techniques for Performance Isolation in Multi-tenant Relational Database-as-a-Service
    Das, Sudipto
    Narasayya, Vivek R.
    Li, Feng
    Syamala, Manoj
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2013, 7 (01): : 37 - 48