Applying update streams in a soft real-time database system
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
ACM Computing Surveys (CSUR)
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
ACM Transactions on Computer Systems (TOCS)
PNUTS: Yahoo!'s hosted data serving platform
Proceedings of the VLDB Endowment
Cassandra: structured storage system on a P2P network
Proceedings of the 28th ACM symposium on Principles of distributed computing
Analyzing consistency properties for fun and profit
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Data centric research at the University of Queensland
ACM SIGMOD Record
Hi-index | 0.00 |
Emerging NoSQL key-value data stores rely on data partitioning and replication to achieve higher levels of availability and scalability. Such design choices typically exhibit a tradeoff in which data freshness is sacrificed in favor of reduced access latencies. In this work, we argue that the same tradeoff is further manifested at a local-level (i.e., replica-level) and is primarily shaped by the resource allocation strategies deployed for managing the processing of user queries and replica updates. To this end, we study several strategies for efficiently allocating such recourses so that to strike a fine balance between both the quality of service (QoS) and quality of data (QoD) perceived by the end-user.