Skip to main content

Group-Scope Query and Its Access Method

  • Conference paper
Web Technologies and Applications (APWeb 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7235))

Included in the following conference series:

  • 2142 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cattell, R.: Scalable sql and nosql data stores. ACM SIGMOD Record 39(4), 12–27 (2011)

    Article  Google Scholar 

  2. Faloutsos, C.: Multiattribute hashing using gray codes. In: ACM SIGMOD Record, vol. 15, pp. 227–238. ACM (1986)

    Google Scholar 

  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. 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)

    Article  MATH  Google Scholar 

  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. Tropf, H., Herzog, H.: Multidimensional range search in dynamically balanced trees. Angewandte Info., 71–77 (1981)

    Google Scholar 

  7. Karnaugh, M.: The map method for synthesis of combinational logic circuits. Trans. AIEE. pt. I 72(9), 593–599 (1953)

    MathSciNet  Google Scholar 

  8. Lakshman, A., Malik, P.: Cassandra: a decentralized structured storage system. ACM SIGOPS Operating Systems Review 44(2), 35–40 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Y., Xia, F., Zhou, A. (2012). Group-Scope Query and Its Access Method. In: Sheng, Q.Z., Wang, G., Jensen, C.S., Xu, G. (eds) Web Technologies and Applications. APWeb 2012. Lecture Notes in Computer Science, vol 7235. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29253-8_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29253-8_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29252-1

  • Online ISBN: 978-3-642-29253-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics