Automatic Partitioning of Database Applications

被引:25
|
作者
Cheung, Alvin [1 ]
Madden, Samuel [1 ]
Arden, Owen [2 ]
Myers, Andrew C. [2 ]
机构
[1] MIT, CSAIL, Cambridge, MA 02139 USA
[2] Cornell Univ, Dept Comp Sci, Ithaca, NY 14853 USA
来源
PROCEEDINGS OF THE VLDB ENDOWMENT | 2012年 / 5卷 / 11期
基金
美国国家科学基金会;
关键词
D O I
10.14778/2350229.2350262
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Database-backed applications are nearly ubiquitous in our daily lives. Applications that make many small accesses to the database create two challenges for developers: increased latency and wasted resources from numerous network round trips. A well-known technique to improve transactional database application performance is to convert part of the application into stored procedures that are executed on the database server. Unfortunately, this conversion is often difficult. In this paper we describe Pyxis, a system that takes database-backed applications and automatically partitions their code into two pieces, one of which is executed on the application server and the other on the database server. Pyxis profiles the application and server loads, statically analyzes the code's dependencies, and produces a partitioning that minimizes the number of control transfers as well as the amount of data sent during each transfer. Our experiments using TPC-C and TPC-W show that Pyxis is able to generate partitions with up to 3x reduction in latency and 1.7x improvement in throughput when compared to a traditional non-partitioned implementation and has comparable performance to that of a custom stored procedure implementation.
引用
收藏
页码:1471 / 1482
页数:12
相关论文
共 50 条
  • [31] BIAM, an automatic drug database
    Aractingi, S
    ANNALES DE DERMATOLOGIE ET DE VENEREOLOGIE, 1999, 126 (04): : 375 - 375
  • [32] Vertical partitioning for flash and HDD database systems
    Clementsen, Davur S.
    He, Zhen
    JOURNAL OF SYSTEMS AND SOFTWARE, 2010, 83 (11) : 2237 - 2250
  • [33] ALGORITHMS FOR VERTICAL PARTITIONING IN DATABASE PHYSICAL DESIGN
    CHENG, CH
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1994, 22 (03): : 291 - 303
  • [34] VERTICAL PARTITIONING FOR DATABASE DESIGN - A GRAPHICAL ALGORITHM
    NAVATHE, SB
    RA, MY
    PROCEEDINGS OF THE 1989 ACM SIGMOD INTERNATIONAL CONFERENCE ON THE MANAGEMENT OF DATA, 1989, 18 : 440 - 450
  • [35] Enhanced adaptive partitioning in a distributed graph database
    Svitakova, Lucie
    Valenta, Michal
    Pokorny, Jaroslav
    JOURNAL OF INFORMATION AND TELECOMMUNICATION, 2021, 5 (01) : 104 - 120
  • [36] An Optimized Scheme for Vertical Partitioning of a Distributed Database
    Abuelyaman, Eltayeb Salih
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2008, 8 (01): : 310 - 316
  • [37] Relax and Let the Database Do the Partitioning Online
    Jindal, Alekh
    Dittrich, Jens
    ENABLING REAL-TIME BUSINESS INTELLIGENCE, BIRTE 2011, 2012, 126 : 65 - 80
  • [38] Simulated annealing for vertically partitioning an OO database
    Chinchwadkar, GS
    Goh, A
    Lim, EP
    ICICS - PROCEEDINGS OF 1997 INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATIONS AND SIGNAL PROCESSING, VOLS 1-3: THEME: TRENDS IN INFORMATION SYSTEMS ENGINEERING AND WIRELESS MULTIMEDIA COMMUNICATIONS, 1997, : 800 - 804
  • [39] PARTITIONING CONCEPTS FOR PLACEMENT AND APPLICATIONS
    PATEL, AM
    COMPUTER-AIDED DESIGN, 1986, 18 (07) : 395 - 395
  • [40] Dynamic Partitioning for Enterprise Applications
    Grund, Martin
    Krueger, Jens
    Mueller, Juergen
    Zeier, Alexander
    Plattner, Hasso
    2011 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2011, : 1010 - 1015