Scaling concurrent log-structured data stores
Authors:
Open Access
- 17 April 2015
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-14
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- HyperDex2012
- CassandraACM SIGOPS Operating Systems Review, 2010
- A practical concurrent binary search treeACM SIGPLAN Notices, 2010
- PNUTSProceedings of the VLDB Endowment, 2008
- Dynamo2007
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- Fractional cascading: I. A data structuring techniqueAlgorithmica, 1986
- Efficient locking for concurrent operations on B-treesACM Transactions on Database Systems, 1981
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970