HyperDex: A distributed, searchable key-value store

SIGCOMM'12 - Proceedings of the ACM SIGCOMM 2012 Conference Applications, Technologies, Architectures, and Protocols for Computer Communication

Volumn , Issue , 2012, Pages 25-36

  Escriva, Robert ^a   Wong, Bernard ^b   Sirer, Emin Gün ^a  

^a Cornell University ^*  (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

fault tolerance; key value store; nosql; performance; strong consistency

Indexed keywords

COMPUTING APPLICATIONS; EFFICIENT IMPLEMENTATION; KEY-VALUE STORE; MULTIPLE ATTRIBUTES; NOSQL; OBJECT RETRIEVAL; PERFORMANCE; PRIMARY KEYS; RANGE QUERY; STANDARD COMPONENTS; STRONG CONSISTENCY;

COMMUNICATION; COMPUTER ARCHITECTURE; FAULT TOLERANCE; WEB SERVICES;

NETWORK ARCHITECTURE;

EID: 84866497184     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2342356.2342360     Document Type: Conference Paper

References (58)

1. M. K. Aguilera, W. M. Golab, and M. A. Shah. A Practical Scalable Distributed B-Tree. In PVLDB, 1(1), 2008.
2. D. Altinbüken and E. G. Sirer. Commodifying Replicated State Machines with OpenReplica. Computing and Information Science, Cornell University, Technical Report 1813-29009, 2012.
3. S. Anand. http: //www.infoq.com/presentations/NoSQL-Netflix/.
4. D. G. Andersen, J. Franklin, M. Kaminsky, A. Phanishayee, L. Tan, and V. Vasudevan. FAWN: A Fast Array of Wimpy Nodes. In Proc. of SOSP, Big Sky, MT, Oct. 2009.
5. R. Bayer. The Universal B-Tree for Multidimensional Indexing: General Concepts. In Proc. of WWCA, Tsukuba, Japan, Mar. 1997.
6. R. E. Bellman. Dynamic Programming. Princeton University Press, 1957.
7. J. L. Bentley. Multidimensional Binary Search Trees Used for Associative Searching. In CACM, 18(9), 1975.
8. A. R. Bharambe, M. Agrawal, and S. Seshan. Mercury: Supporting Scalable Multi-Attribute Range Queries. In Proc. of SIGCOMM, Portland, OR, Aug. 2004.
9. M. Burrows. The Chubby Lock Service for Loosely-Coupled Distributed Systems. In Proc. of OSDI, Seattle, WA, Nov. 2006.
10. M. Cai, M. R. Frank, J. Chen, and P. A. Szekely. MAAN: A Multi-Attribute Addressable Network for Grid Information Services. In Proc. of GRID Workshop, Phoenix, AZ, Nov. 2003.
11. F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Chandra, A. Fikes, and R. Gruber. BigTable: A Distributed Storage System for Structured Data. In Proc. of OSDI, Seattle, WA, Nov. 2006.
12. J. Cipar, G. R. Ganger, K. Keeton, C. B. M. III, C. A. N. Soules, and A. C. Veitch. LazyBase: Trading Freshness for Performance in a Scalable Database. In Proc. of EuroSys, Bern, Switzerland, Apr. 2012.
13. A. T. Clements, D. R. K. Ports, and D. R. Karger. Arpeggio: Metadata Searching and Content Sharing with Chord. In Proc. of IPTPS Workshop, La Jolla, CA, Feb. 2005.
14. B. F. Cooper, R. Ramakrishnan, U. Srivastava, A. Silberstein, P. Bohannon, H.-A. Jacobsen, N. Puz, D. Weaver, and R. Yerneni. PNUTS: Yahoo!'s Hosted Data Serving Platform. In PVLDB, 1(2), 2008.
15. B. F. Cooper, A. Silberstein, E. Tam, R. Ramakrishnan, and R. Sears. Benchmarking Cloud Serving Systems with YCSB. In Proc. of SoCC, Indianapolis, IN, June 2010.
16. CouchDB. http://couchdb.apache.org/.
17. A. Crainiceanu, P. Linga, J. Gehrke, and J. Shanmugasundaram. Querying Peer-to-Peer Networks Using P-Trees. In Proc. of WebDB Workshop, Paris, France, June 2004.
18. J. Dean. Designs, Lessons, and Advice from Building Large Distributed Systems. Keynote. In Proc. of LADIS, Big Sky, MT, Oct. 2009.
19. G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels. Dynamo: Amazon's Highly Available Key-Value Store. In Proc. of SOSP, Stevenson, WA, Oct. 2007.
20. R. Escriva, B. Wong, and E. G. Sirer. Hyperdex. http://hyperdex.org/.
21. P. Ganesan, B. Yang, and H. Garcia-Molina. One Torus to Rule Them All: Multidimensional Queries in P2P Systems. In Proc. of WebDB Workshop, Paris, France, June 2004.
22. S. Gilbert and N. A. Lynch. Brewer's Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web Services. In SIGACT News, 33(2), 2002.
23. S. D. Gribble. A Design Framework and a Scalable Storage Platform to Simplify Internet Service Construction. U.C. Berkeley, 2000.
24. A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. In Proc. of SIGMOD, 1984.
25. HBase. http://hbase.apache.org/.
26. M. Herlihy and J. M. Wing. Linearizability: A Correctness Condition for Concurrent Objects. In ACM ToPLaS, 12(3), 1990.
27. P. Hunt, M. Konar, F. P. Junqueira, and B. Reed. ZooKeeper: Wait-Free Coordination for Internet-Scale Systems. In Proc. of USENIX, Boston, MA, June 2010.
28. Hypertable. http://http://hypertable.org/.
29. D. R. Karger, E. Lehman, F. T. Leighton, R. Panigrahy, M. S. Levine, and D. Lewin. Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. In Proc. of STOC, El Paso, TX, May 1997.
30. F. B. Kashani and C. Shahabi. SWAM: A Family of Access Methods for Similarity-Search in Peer-to-Peer Data Networks. In Proc. of CIKM, Washington, D.C., Nov. 2004.
31. A. Klinger. Patterns and Search Statistics. In Optimizing Methods in Statistics, Academic Press, 1971.
32. A. Lakshman and P. Malik. Cassandra: A Decentralized Structured Storage System. In Proc. of LADIS, Big Sky, MT, Oct. 2009.
33. H. Lim, B. Fan, D. G. Andersen, and M. Kaminsky. SILT: A Memory-Efficient, High-Performance Key-Value Store. In Proc. of SOSP, Cascais, Portugal, Oct. 2011.
34. W. Lloyd, M. J. Freedman, M. Kaminsky, and D. G. Andersen. Don't Settle for Eventual: Scalable Causal Consistency for Wide-Area Storage with COPS. In Proc. of SOSP, Cascais, Portugal, Oct. 2011.
35. Y. Mao, E. Kohler, and R. T. Morris. Cache Craftiness for Fast Multicore Key-Value Storage. In Proc. of EuroSys, Bern, Switzerland, Apr. 2012.
36. Memcached. http://memcached.org/.
37. MongoDB. http://www.mongodb.org/.
38. Neo4j. http://neo4j.org/.
39. J. Nievergelt, H. Hinterberger, and K. C. Sevcik. The Grid File: An Adaptable, Symmetric Multikey File Structure. In ACM ToDS, 9(1), 1984.
40. D. Ongaro, S. M. Rumble, R. Stutsman, J. K. Ousterhout, and M. Rosenblum. Fast Crash Recovery in RAMCloud. In Proc. of SOSP, Cascais, Portugal, Oct. 2011.
41. J. A. Orenstein and T. H. Merrett. A Class of Data Structures for Associative Searching. In Proc. of PODS, 1984.
42. L. Peterson, A. Bavier, and S. Bhatia. VICCI: A Programmable Cloud-Computing Research Testbed. Princeton, Technical Report TR-912-11, 2011.
43. D. R. K. Ports, A. T. Clements, I. Zhang, S. Madden, and B. Liskov. Transactional Consistency and Automatic Management in an Application Data Cache. In Proc. of OSDI, Vancouver, Canada, Oct. 2010.
44. D. Pritchett. BASE: An ACID Alternative. In ACM Queue, 6(3), 2008.
45. Project Voldemort. http://project-voldemort.com/.
46. J. Rao, E. J. Shekita, and S. Tata. Using Paxos to Build a Scalable, Consistent, and Highly Available Datastore. In PVLDB, 4(4), 2011.
47. S. Ratnasamy, P. Francis, M. Handley, R. M. Karp, and S. Shenker. A Scalable Content-Addressable Network. In Proc. of SIGCOMM, San Diego, CA, Aug. 2001.
48. Redis. http://redis.io/.
49. Riak. http://basho.com/.
50. A. I. T. Rowstron and P. Druschel. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In Proc. of ICDSP, volume 2218, 2001.
51. H. Samet. Spatial Data Structures. In Modern Database Systems: The Object Model, Interoperability, and Beyond, Addison Wesley/ACM Press, 1995.
52. C. Schmidt and M. Parashar. Enabling Flexible Queries with Guarantees in P2P Systems. In Internet Computing Journal, 2004.
53. Y. Shu, B. C. Ooi, K.-L. Tan, and A. Zhou. Supporting Multi-Dimensional Range Queries in Peer-to-Peer Systems. In Proc. of IEEE International Conference on Peer-to-Peer Computing, Konstanz, Germany, Aug. 2005.
54. R. P. Spillane, P. J. Shetty, E. Zadok, S. Dixit, and S. Archak. An Efficient Multi-Tier Tablet Server Storage Architecture. In Proc. of SoCC, 2011.
55. I. Stoica, R. Morris, D. R. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In Proc. of SIGCOMM, San Diego, CA, Aug. 2001.
56. D. B. Terry, M. Theimer, K. Petersen, A. J. Demers, M. Spreitzer, and C. Hauser. Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System. In Proc. of SOSP, Copper Mountain, CO, Dec. 1995.
57. R. van Renesse and F. B. Schneider. Chain Replication for Supporting High Throughput and Availability. In Proc. of OSDI, San Francisco, CA, Dec. 2004.
58. C. Zhang, A. Krishnamurthy, and R. Y. Wang. SkipIndex: Towards a Scalable Peer-to-Peer Index Service for High Dimensional Data. Princeton, Technical Report TR-703-04, 2004.