Query optimization in the presence of limited access patterns
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Concurrency control in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Guaranteeing correctness and availability in P2P range indices
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Range Queries in Trie-Structured Overlays
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Bigtable: a distributed storage system for structured data
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
The end of an architectural era: (it's time for a complete rewrite)
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Supporting table partitioning by reference in oracle
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Queue - Scalable Web Services
Asynchronous view maintenance for VLSD databases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
The case for PIQL: a performance insightful query language
Proceedings of the 1st ACM symposium on Cloud computing
CloudDB: One Size Fits All Revived
SERVICES '10 Proceedings of the 2010 6th World Congress on Services
ElasTraS: an elastic transactional data store in the cloud
HotCloud'09 Proceedings of the 2009 conference on Hot topics in cloud computing
The case for determinism in database systems
Proceedings of the VLDB Endowment
Load Balancing and Range Queries in P2P Systems Using P-Ring
ACM Transactions on Internet Technology (TOIT)
Partiqle: an elastic SQL engine over key-value stores
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.00 |
The paper proposes microsharding, a relational alternative for the recent procedural approaches with large-scale data stores to support OLTP workloads elastically. It employs a declarative specification, called transaction classes, of constraints applied on the transactions in a workload. The declarative specification enables a principled approach to design and analyze OLTP workloads. We discuss the current framework as well as identify research directions.