[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Efficient Distributed Multi-dimensional Index for Big Data Management

  • Conference paper
Web-Age Information Management (WAIM 2013)

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

Included in the following conference series:

Abstract

With the advent of the era for big data, demands of various applications equipped with distributed multi-dimensional indexes become increasingly significant and indispensable. To cope with growing demands, numerous researchers demonstrate interests in this domain. Obviously, designing an efficient, scalable and flexible distributed multi-dimensional index has been confronted with new challenges. Therefore, we present a brand-new distributed multi-dimensional index method—EDMI. In detail, EDMI has two layers: the global layer employs K-d tree to partition entire space into many subspaces and the local layer contains a group of Z-order prefix R-trees related to one subspace respectively. Z-order prefix R-Tree (ZPR-tree) is a new variant of R-tree leveraging Z-order prefix to avoid the overlap of MBRs for R-tree nodes with multi-dimensional point data. In addition, ZPR-tree has the equivalent construction speed of Packed R-trees and obtains better query performance than other Packed R-trees and R*-tree. EDMI efficiently supports many kinds of multi-dimensional queries. We experimentally evaluated prototype implementation for EDMI based on HBase. Experimental results reveal that EDMI has better performance on point, range and KNN query than state-of-art indexing techniques based on HBase. Moreover, we verify that Z-order prefix R-Tree gets better overall performance than other R-Tree variants through further experiments. In general, EDMI serves as an efficient, scalable and flexible distributed multi-dimensional index framework.

This work is supported by Postgraduate Scientific Research Fund of RUC, No. 13XNH214.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • 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.

Similar content being viewed by others

References

  1. Wu, S., Wu, K.-L.: An indexing framework for efficient retrieval on the cloud. IEEE Data Eng. Bull., 75–82 (2009)

    Google Scholar 

  2. Wang, J., Wu, S., Gao, H., Li, J., Ooi, B.C.: Indexing multi-dimensional data in a cloud system. In: SIGMOD Conference 2010, pp. 591–602 (2010)

    Google Scholar 

  3. Ratnasamy, S., Francis, P., Handley, M., Karp, R.M., Shenker, S.: A scalable content-addressable network. In: SIGCOMM 2001, pp. 161–172 (2001)

    Google Scholar 

  4. Ding, L., Qiao, B., Wang, G., Chen, C.: An efficient quad-tree based index structure for cloud data management. In: Wang, H., Li, S., Oyama, S., Hu, X., Qian, T. (eds.) WAIM 2011. LNCS, vol. 6897, pp. 238–250. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  5. Zhang, X., Ai, J., Wang, Z., Lu, J., Meng, X.: An efficient multi-dimensional index for cloud data management. In: CloudDB 2009, pp. 17–24 (2009)

    Google Scholar 

  6. Nishimura, S., Das, S., Agrawal, D., Abbadi, A.E.: MD-HBase: A scalable multi-dimensional data infrastructure for location aware services. In: Mobile Data Management (1) 2011, pp. 7–16 (2011)

    Google Scholar 

  7. Dean, J., Ghemawat, S.: MapReduce: Simplified data processing on large clusters. In: Proceedings of the 6th Conference on Symposium on Operating Systems Design & Implementation, vol. 6, p. 10 (December 2004)

    Google Scholar 

  8. Cary, A., Sun, Z., Hristidis, V., Rishe, N.: Experiences on Processing Spatial Data with MapReduce. In: Winslett, M. (ed.) SSDBM 2009. LNCS, vol. 5566, pp. 302–319. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Theodoridis, Y., Stefanakis, E., Sellis, T.: Efficient Cost Models for Spatial Queries using R-trees. IEEE Transactions on Knowledge and Data Engineering 12(1) (2000)

    Google Scholar 

  10. Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: ACM SIGMOD Conf., pp. 322–331 (1990)

    Google Scholar 

  11. Kamel, I., Faloutsos, C.: Parallel R-Trees. In: Proc. of ACM SIGMOD Conf., pp. 195–204 (1992)

    Google Scholar 

  12. Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: ACM SIGMOD Conf., pp. 47–57 (1984)

    Google Scholar 

  13. Friedman, J.H., Bentley, J.L., Finkel, R.A.: An Algorithm for Finding Best Matches in Logarithmic Expected Time. ACM TOMS 3(3), 209–226 (1977)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhou, X., Zhang, X., Wang, Y., Li, R., Wang, S. (2013). Efficient Distributed Multi-dimensional Index for Big Data Management. In: Wang, J., Xiong, H., Ishikawa, Y., Xu, J., Zhou, J. (eds) Web-Age Information Management. WAIM 2013. Lecture Notes in Computer Science, vol 7923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38562-9_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38562-9_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38561-2

  • Online ISBN: 978-3-642-38562-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics