Sloth: Being Lazy is a Virtue (When Issuing Database Queries)

被引:19
|
作者
Cheung, Alvin [1 ]
Madden, Samuel [1 ]
Solar-Lezama, Armando [1 ]
机构
[1] MIT CSAIL, Cambridge, MA 02139 USA
来源
SIGMOD'14: PROCEEDINGS OF THE 2014 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA | 2014年
关键词
D O I
10.1145/2588555.2593672
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Many web applications store persistent data in databases. During execution, such applications spend a significant amount of time communicating with the database for retrieval and storing of persistent data over the network. These network round trips represent a significant fraction of the overall execution time for many applications and as a result increase their latency. While there has been prior work that aims to eliminate round trips by batching queries, they are limited by 1) a requirement that developers manually identify batching opportunities, or 2) the fact that they employ static program analysis techniques that cannot exploit many opportunities for batching. In this paper, we present Sloth, a new system that extends traditional lazy evaluation to expose query batching opportunities during application execution, even across loops, branches, and method boundaries. We evaluated Sloth using over 100 benchmarks from two large-scale open-source applications, and achieved up to a 3 x reduction in page load time by delaying computation.
引用
收藏
页码:931 / 942
页数:12
相关论文
共 7 条
  • [1] Sloth: Being Lazy Is a Virtue (When Issuing Database Queries)
    Cheung, Alvin
    Madden, Samuel
    Solar-Lezama, Armando
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2016, 41 (02):
  • [2] When Being Thin Is Not a Virtue
    Knopman, David S.
    JOURNAL OF THE AMERICAN GERIATRICS SOCIETY, 2008, 56 (12) : 2349 - 2350
  • [3] The Unexpected Virtue of Problem Reductions or How to Solve Problems Being Lazy but Wise
    Mathieson, Luke
    Moscato, Pablo
    2020 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2020, : 2381 - 2390
  • [4] When Database Queries Are Fourth Amendment Searches
    Berman, Emily
    MINNESOTA LAW REVIEW, 2018, 102 (02) : 577 - 638
  • [5] How the database update must affect the responses being produced by the active continuous queries
    Buza, A
    ICCC 2004: SECOND IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL CYBERNETICS, PROCEEDINGS, 2004, : 401 - 404
  • [6] Being Lazy When It Counts Practical Constant-Time Memory Management for Functional Programming
    Lam, Chun Kit
    Parreaux, Lionel
    FUNCTIONAL AND LOGIC PROGRAMMING, FLOPS 2024, 2024, 14659 : 188 - 216
  • [7] PERFORMANCE OF A 2-HEADED DISK SYSTEM WHEN SERVING DATABASE QUERIES UNDER THE SCAN POLICY
    MANOLOPOULOS, Y
    KOLLIAS, JG
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 1989, 14 (03): : 425 - 442