swMATH27060MaRDI QIDQ38779FDOQ38779
Author name not available (Why is that?)
Official website: https://dl.acm.org/citation.cfm?id=1365816
Cited In (51)
- An effective and efficient MapReduce algorithm for computing BFS-based traversals of large-scale RDF graphs
- Comparing consensus Monte Carlo strategies for distributed Bayesian computation
- Mathematics of big data. Spreadsheets, databases, matrices, and graphs. With a foreword by Charles E. Leiserson
- The weakest failure detector for eventual consistency
- \textsc{Ramos}: concurrent writing and reconfiguration for collaborative systems
- Proving properties of the Chord protocol using the ASM formalism
- The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell
- Logoot
- Consensus in Data Management: From Distributed Commit to Blockchain
- Security and privacy aspects in MapReduce on clouds: a survey
- MapReduce
- G-Hadoop
- Dryad
- ScalaBLAST
- Chord
- Cassandra
- HBase
- Pastry
- XtremWeb
- INGRES
- Autopilot
- MongoDB
- D4M
- Accumulo
- SAPPER
- parallelMCMCcombine
- AsterixDB
- DynamoDB
- DryadLINQ
- Google Maps API
- Hive
- Apache Pig
- MonetDB
- CryptDB
- moleculaRnetworks
- P3S
- Dynamo
- VisiCalc
- Vertica
- VoltDB
- Amazon EC2
- AWS Elastic Beanstalk
- LZ77
- Improvement of path analysis algorithm in social networks based on HBase
- A new analysis of the false positive rate of a Bloom filter
- ASP.NET
- ADO.NET
- Abstract state machines for data-parallel computing
- Bicriteria data compression
- On optimally partitioning a text to improve its compression
- Hardening Cassandra against Byzantine failures
This page was built for software: Bigtable
