Cited in
(48)- Towards effective social network system implementation
- The weakest failure detector for eventual consistency
- Mathematics of big data. Spreadsheets, databases, matrices, and graphs. With a foreword by Charles E. Leiserson
- Social network path analysis based on HBase
- Proving properties of the Chord protocol using the ASM formalism
- Weighted Moore-Penrose generalized matrix inverse: MySQL vs. Cassandra database storage system
- Scalable eventually consistent counters over unreliable networks
- Merging ring-structured overlay indices: toward network-data transparency
- Chord
- BlobSeer
- HBase
- CouchDB
- OpenNebula
- Hector
- TestNG
- INGRES
- JGroups
- MySQL
- MongoDB
- D4M
- Accumulo
- UnQL
- AsterixDB
- ICSD
- Plutus
- SiRiUS
- Bigtable
- CryptDB
- moleculaRnetworks
- P3S
- SNOBOL
- Dynamo
- VisiCalc
- VoltDB
- Bloom
- Modeling message queueing services with reliability guarantee in cloud computing environment using colored Petri nets
- Improvement of path analysis algorithm in social networks based on HBase
- A survey on the distributed computing stack
- Replicated data types that unify eventual consistency and observable atomic consistency
- Data-driven mixed-integer linear programming-based optimisation for efficient failure detection in large-scale distributed systems
- A class of bounded functions, a database language and an extended lambda calculus
- Computing \(k\)-atomicity in polynomial time
- A formal study of collaborative access control in distributed Datalog
- Multiparty testing preorders
- Reliability and availability of cloud computing.
- Enabling compressed encryption for cloud based big data stores
- Non-uniform replication
- Hardening Cassandra against Byzantine failures
This page was built for software: Cassandra
