The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
OceanStore: an architecture for global-scale persistent storage
Open accessAbstract
OceanStore is a utility infrastructure designed to span the globe and provide continuous access to persistent information. Since this infrastructure is comprised of untrusted servers, data is protected through redundancy and cryptographic techniques. To improve performance, data is allowed to be cached anywhere, anytime. Additionally, monitoring of usage patterns allows adaptation to regional outages and denial of service attacks; monitoring also enhances performance through pro-active movement of data. A prototype implementation is currently under development.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
System architecture directions for networked sensors
Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D., & Pister, K. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.356998 · Cited by 3,084
The Computer for the Twenty-First Century
Weiser, M. (1991) · Scientific American · Cited by 2,113
Decentralized Trust Management
Blaze, M., Feigenbaum, J., & Lacy, J. (1996) · Cited by 1,870
System architecture directions for networked sensors
Hill, J. L., Szewczyk, R., Woo, A., Hollar, S., Culler, D., & Pister, K. S. J. (2000) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/378993.379006 · Cited by 1,756
On optimistic methods for concurrency control
Kung, H. T., & Robinson, J. T. (1981) · ACM Transactions on Database Systems · doi:10.1145/319566.319567 · Cited by 1,439
Scale and performance in a distributed file system
Howard, J. H., Kazar, M. L., Menees, S. G., Nichols, D. A., Satyanarayanan, M., Sidebotham, R. N., & West, M. J. (1988) · ACM Transactions on Computer Systems · doi:10.1145/35037.35059 · Cited by 1,403
Norman, D. A. (1998) · The MIT Press eBooks · Cited by 1,121
Disconnected operation in the Coda File System
Kistler, J. J., & Satyanarayanan, M. (1992) · ACM Transactions on Computer Systems · doi:10.1145/146941.146942 · Cited by 1,065
The dangers of replication and a solution
Gray, J., Helland, P., O'Neil, P., & Shasha, D. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233330 · Cited by 1,019
Ellison, C., Frantz, B., Lampson, B., Rivest, R., Thomas, B., & Ylonen, T. (1999) · doi:10.17487/rfc2693 · Cited by 762
Accessing nearby copies of replicated objects in a distributed environment
Plaxton, C. G., Rajaraman, R., & Richa, A. W. (1997) · Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA '97 · doi:10.1145/258492.258523 · Cited by 760
Design and implementation of the Sun network filesystem
Sandberg, R., Golgberg, D., Kleiman, S. R., Walsh, D., & Lyon, B. (1988) · Artech House, Inc. eBooks · Cited by 730
A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems
Plank, J. S. (1997) · Software: Practice and Experience · doi:10.1002/(sici)1097-024x(199709)27:9<995::aid-spe111>3.0.co;2-6 · Cited by 525
Caching in the Sprite network file system
Nelson, M. N., Welch, B. B., & Ousterhout, J. K. (1988) · ACM Transactions on Computer Systems · doi:10.1145/35037.42183 · Cited by 500
Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs
Bolosky, W. J., Douceur, J. R., Ely, D., & Theimer, M. (2000) · Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/339331.339345 · Cited by 484
SDSI - A Simple Distributed Security Infrastructure
Lampson, B., & Rivest, R. L. (1996) · Cited by 480
Summary cache: a scalable wide-area Web cache sharing protocol
Fan, L., Cao, P., Almeida, J., & Broder, A. Z. (1998) · Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/285237.285287 · Cited by 422
A cryptographic file system for UNIX
Blaze, M. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168590 · Cited by 413
The dangers of replication and a solution
Gray, J., Helland, P., O'Neil, P., & Shasha, D. (1996) · ACM SIGMOD Record · doi:10.1145/235968.233330 · Cited by 393
Separating key management from file system security
Mazières, D., Kaminsky, M., Kaashoek, M. F., & Witchel, E. (1999) · Proceedings of the seventeenth ACM symposium on Operating systems principles · doi:10.1145/319151.319160 · Cited by 332
Deciding when to forget in the Elephant file system
Santry, D. S., Feeley, M. J., Hutchinson, N. C., Veitch, A., Carton, R. W., & Ofir, J. (1999) · doi:10.1145/319151.319159 · Cited by 277
The Design of the POSTGRES Storage System
Stonebraker, M. R. (1987) · doi:10.21236/ada187244 · Cited by 255
AutoAdmin “what-if” index analysis utility
Chaudhuri, S., & Narasayya, V. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276337 · Cited by 255
Distributed file systems: concepts and examples
Levy, E., & Silberschatz, A. (1990) · ACM Computing Surveys · doi:10.1145/98163.98169 · Cited by 217
Improving the performance of log-structured file systems with adaptive methods
Matthews, J. N., Roselli, D., Costello, A. M., Wang, R. Y., & Anderson, T. E. (1997) · Proceedings of the sixteenth ACM symposium on Operating systems principles · doi:10.1145/268998.266700 · Cited by 164
Replicated document management in a group communication system
Kawell, L., Beckhardt, S., Halvorsen, T., Ozzie, R., & Greif, I. (1988) · ACM Conference on Computer Supported Cooperative Work (CSCW) · doi:10.1145/62266.1024798 · Cited by 136
Towards an archival Intermemory
Goldberg, A. V., & Yianilos, P. N. (2002) · doi:10.1109/adl.1998.670389 · Cited by 108
Self-monitoring and self-adapting operating systems
Seltzer, M., & Small, C. (2002) · Workshop on Hot Topics in Operating Systems · doi:10.1109/hotos.1997.595194 · Cited by 92
Cited by
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Rowstron, A., & Druschel, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45518-3_18 · Cited by 7,276
A scalable content-addressable network
Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383072 · Cited by 6,372
Jacobson, V., Smetters, D. K., Thornton, J. D., Plass, M. F., Briggs, N. H., & Braynard, R. L. (2009) · Proceedings of the 5th international conference on Emerging networking experiments and technologies · doi:10.1145/1658939.1658941 · Cited by 4,031
(2007) · doi:10.1145/1294261.1294281 · Cited by 3,447
Metadata
- Authors
- Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., & Zhao, B.
- Venue
- ACM SIGPLAN Notices
- Published
- 2000-11
- Volume
- 35
- Issue
- 11
- Pages
- 190-201
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W2104210894
- Cited by
- 2,002
- References
- 31
- FWCI
- 148.19
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.