Advertisement

Group-Scope Query and Its Access Method

  • Yi Wang
  • Fan Xia
  • Aoying Zhou
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7235)

Abstract

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.

Keywords

Range Query Access Method Gray Code Region Query Secondary Index 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cattell, R.: Scalable sql and nosql data stores. ACM SIGMOD Record 39(4), 12–27 (2011)CrossRefGoogle Scholar
  2. 2.
    Faloutsos, C.: Multiattribute hashing using gray codes. In: ACM SIGMOD Record, vol. 15, pp. 227–238. ACM (1986)Google Scholar
  3. 3.
    Cooper, B.F., Silberstein, A., Tam, E., Ramakrishnan, R., Sears, R.: Benchmarking cloud serving systems with ycsb. In: Proceedings of the 1st ACM Symposium on Cloud Computing, pp. 143–154. ACM (2010)Google Scholar
  4. 4.
    Chang, F., Dean, J., Ghemawat, S., Hsieh, W.C., Wallach, D.A., Burrows, M., Chandra, T., Fikes, A., Gruber, R.E.: Bigtable: A distributed storage system for structured data. ACM Transactions on Computer Systems (TOCS) 26(2), 1–26 (2008)zbMATHCrossRefGoogle Scholar
  5. 5.
    Hastorun, D., Jampani, M., Kakulapati, G., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: amazons highly available key-value store. In: Proc. SOSP. Citeseer (2007)Google Scholar
  6. 6.
    Tropf, H., Herzog, H.: Multidimensional range search in dynamically balanced trees. Angewandte Info., 71–77 (1981)Google Scholar
  7. 7.
    Karnaugh, M.: The map method for synthesis of combinational logic circuits. Trans. AIEE. pt. I 72(9), 593–599 (1953)MathSciNetGoogle Scholar
  8. 8.
    Lakshman, A., Malik, P.: Cassandra: a decentralized structured storage system. ACM SIGOPS Operating Systems Review 44(2), 35–40 (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Yi Wang
    • 1
  • Fan Xia
    • 1
  • Aoying Zhou
    • 1
  1. 1.Software Engineering InstituteEast China Normal UniversityChina

Personalised recommendations