Multiattribute hashing using Gray codes
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
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
ACM Transactions on Computer Systems (TOCS)
Cassandra: a decentralized structured storage system
ACM SIGOPS Operating Systems Review
Benchmarking cloud serving systems with YCSB
Proceedings of the 1st ACM symposium on Cloud computing
Scalable SQL and NoSQL data stores
ACM SIGMOD Record
| Hi-index | 0.00 |
Nowadays, large scale workloads of typical Web 2.0 applications are well supported by NoSQL systems. The most efficient query that NoSQL systems have provided us is the key-lookup, but it is not quite efficient for some kinds of complex queries. One of these kinds of queries, which we name as Group-Scope Query, is very common in practical applications. In this paper, we explore an access method for group-scope queries. In this method, data are partitioned into groups, and a multi-dimensional primary index is built for each group. Meanwhile, we avoid establishing secondary indexes which are known to require additional expenses. YCSB is used to evaluate the performance of our approach, and the results show that our access method is scalable and efficient.