Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Bigtable: a distributed storage system for structured data
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Cassandra: structured storage system on a P2P network
Proceedings of the 28th ACM symposium on Principles of distributed computing
MapReduce and parallel DBMSs: friends or foes?
Communications of the ACM - Amir Pnueli: Ahead of His Time
| Hi-index | 0.00 |
In recent years more and more computer users are getting connected to the Internet. The explosive growth not only provides a wealth of opportunities for building online services, but also poses significant challenges. Handling an ever increasing number of users imposes a careful design of the system. Giving them real-time access to the data complicates even further the implementation of such a service. In this paper a real-time data storage architecture is presented that scales with ease to accommodate an increasing number of clients. The proposed architecture can handle not only predominant read operations, such as when using a traditional database with a caching layer, but also when most of the operations are write operations. By also prioritizing the access to data with respect to the user interactions with the system, the real-time performance of the system is enhanced.