Order-preserving key transformations
ACM Transactions on Database Systems (TODS)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Flexible Information Discovery in Decentralized Distributed Systems
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Simple efficient load balancing algorithms for peer-to-peer systems
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
One torus to rule them all: multi-dimensional queries in P2P systems
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
A case study in building layered DHT applications
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Stable High-Capacity One-Hop Distributed Hash Tables
ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
Efficient routing for peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Availability of multi-object operations
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Bigtable: a distributed storage system for structured data
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
Alternative Algorithm for Hilbert's Space-Filling Curve
IEEE Transactions on Computers
Why we twitter: understanding microblogging usage and communities
Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis
Proceedings of the first workshop on Online social networks
Correlation-Aware Object Placement for Multi-Object Operations
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
ProtoPeer: From Simulation to Live Deployment in One Step
P2P '08 Proceedings of the 2008 Eighth International Conference on Peer-to-Peer Computing
PNUTS: Yahoo!'s hosted data serving platform
Proceedings of the VLDB Endowment
Simulation of main memory database parallel recovery
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Tweet, Tweet, Retweet: Conversational Aspects of Retweeting on Twitter
HICSS '10 Proceedings of the 2010 43rd Hawaii International Conference on System Sciences
On the expressiveness and trade-offs of large scale tuple stores
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems: Part II
Hi-index | 0.00 |
Key-value stores hold the unprecedented bulk of the data produced by applications such as social networks. Their scalability and availability requirements often outweigh sacrificing richer data and processing models, and even elementary data consistency. Moreover, existing key-value stores have only random or order based placement strategies. In this paper we exploit arbitrary data relations easily expressed by the application to foster data locality and improve the performance of complex queries common in social network read-intensive workloads. We present a novel data placement strategy, supporting dynamic tags, based on multidimensional locality-preserving mappings. We compare our data placement strategy with the ones used in existing key-value stores under the workload of a typical social network application and show that the proposed correlation-aware data placement strategy offers a major improvement on the system's overall response time and network requirements.