Lookup Tables: Fine-Grained Partitioning for Distributed Databases
The standard way to get linear scaling in a distributed OLTP DBMS is to horizontally partition data across several nodes. Ideally, this partitioning will result in each query being executed at just one node, to avoid the overheads of distributed transactions and allow nodes to be added without incre...
Main Authors: | Tatarowicz, Aubrey L., Curino, Carlo, Jones, Evan P.C., Madden, Sam |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2021
|
Online Access: | https://hdl.handle.net/1721.1/137764 |
Similar Items
-
Look-up tables : the benefit of enabling fine-grained routing and load balancing
by: Tatarowicz, Aubrey Lynn
Published: (2011) -
Schism: a Workload-Driven Approach to Database Replication and Partitioning
by: Curino, Carlo, et al.
Published: (2012) -
Partitioning Techniques for Fine-grained Indexing
by: Wu, Eugene, et al.
Published: (2011) -
Relational Cloud: The Case for a Database Service
by: Wu, Eugene, et al.
Published: (2010) -
Workload-Aware Database Monitoring and Consolidation
by: Curino, Carlo, et al.
Published: (2012)