Skip to main content
SpringerLink
Log in

NSM-Tree: Efficient Indexing on Top of NoSQL Databases

  • Conference paper
  • First Online:
Algorithmic Aspects of Cloud Computing (ALGOCLOUD 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10230))

Included in the following conference series:

Abstract

During the last years, there is a huge proliferation in the usage of location-based services (LBSs), mostly through a multitude of mobile devices (GPS, smartphones, mapping devices, etc.). The volume of the data derived by such services, grows exponentially and conventional databases tend to be ineffective in storing and indexing them efficiently. Ultimately, we need to turn to scalable solutions and methods using the NoSQL database model. Quite a few indexing methods exist in literature that work on top of NoSQL database. In this spirit, we deploy a new distributed indexing structure based on M-tree and perform a thorough experimental analysis to display its benefits.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Notes

  1. 1.

    Map and GIS Data By US State: http://libremap.org/data/.

References

  1. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-Tree: an efficient and robust access method for points and rectangles. In: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, pp. 322–331. ACM, New York (1990)

    Google Scholar 

  2. Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18, 509–517 (1975)

    Article  MATH  Google Scholar 

  3. Capriolo, E., Wampler, D., Rutherglen, J.: Programming Hive Data Warehouse and Query Language for Hadoop. O’Reilly Media, Sebastopol (2012)

    Google Scholar 

  4. Ciaccia, P., Patella, M., Zezula, P.: M-Tree: an efficient access method for similarity search in metric spaces. In: Proceedings of the 23rd International Conference on Very Large Data Bases, pp. 426–435. Morgan Kaufmann Publishers Inc., San Francisco (1997)

    Google Scholar 

  5. Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. In: Proceedings of the 6th Symposium on Operating Systems Design and Implementation, pp. 137–150. USENIX Association, Berkeley (2004)

    Google Scholar 

  6. Berg, M.D., Cheong, O., Van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008)

    Book  MATH  Google Scholar 

  7. George, L.: HBase: The Definitive Guide. O’Reilly Media, Sebastopol (2011)

    Google Scholar 

  8. Guttman, A.: R-Trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, pp. 47–57. ACM, New York (1984)

    Google Scholar 

  9. Kaplanis, A., Kendea, M., Sioutas, S., Makris, C., Tzimas, G.: HB+Tree: Use Hadoop and HBase even your data isn’t that big. In: Proceedings of the 30th Annual ACM Symposium on Applied Computing, pp. 973–980. ACM, New York (2015)

    Google Scholar 

  10. McCreadie, R., McDonald, C., Ounis, I.: Comparing distributed indexing: to mapreduce or not? In: Proceedings of the 7th Workshop on Large-Scale Distributed Systems for Information Retrieval, pp. 41–48. CEUR Workshop Proceedings (2009)

    Google Scholar 

  11. Nishimura, S., Das, S., Agrawal, D., Abbadi, A.E.: MD-HBase: a scalable multi-dimensional data infrastructure for location aware services. In: Proceedings of the IEEE 12th International Conference on Mobile Data Management, vol. 1, pp. 7–16. IEEE Computer Society, Washington, DC (2011)

    Google Scholar 

  12. Samet, H., Webber, E.R.: Storing a collection of polygons using quadtrees. ACM Trans. Graph. 4, 182–222 (1985)

    Article  Google Scholar 

  13. The Apache Software Foundation: Hadoop homepage. http://hadoop.apache.org/

  14. The Apache Software Foundation: HBase homepage. http://hbase.apache.org/

  15. The Apache Software Foundation: Hive homepage. http://hive.apache.org/

  16. Sellis, K.T., Roussopoulos, N., Faloutsos, C.: The R+-Tree: a dynamic index for multi-dimensional objects. In: Proceedings of the 13th International Conference on Very Large Data Bases, pp. 507–518. Morgan Kaufmann Publishers Inc., San Francisco (1987)

    Google Scholar 

  17. Sfakianakis, G., Patlakas, I., Ntarmos, N., Triantafillou, P.: Interval indexing and querying on key-value cloud stores. In: Proceedings of the 29th IEEE International Conference on Data Engineering, pp. 805–816 (2013)

    Google Scholar 

  18. White, T.: Hadoop: The Definitive Guide, 3rd edn. O’Reilly Media/Yahoo Press (2012)

    Google Scholar 

  19. Zheng, C., Shen, G., Li, S., Shenker, S.: Distributed segment tree: support of range query and cover query over DHT. In: Proceedings of the 5th International Workshop on Peer-To-Peer Systems (2006)

    Google Scholar 

Download references

Acknowledgements

This research was kindly supported by the C. Carathéodory Research Program at University of Patras, Greece.

Author information

Authors and Affiliations

  1. Computer Engineering and Informatics Department, University of Patras, 26504, Patras, Greece

    Ioannis Kokotinis, Marios Kendea, Nikolaos Nodarakis, Angeliki Rapti & Athanasios K. Tsakalidis

  2. Department of Informatics, Ionian University, 49100, Corfu, Greece

    Spyros Sioutas

  3. Department of Cultural Heritage, Management and New Technologies, University of Patras, 26504, Patras, Greece

    Dimitrios Tsolis

  4. Centre of Excellence for International Courts, University of Copenhagen, 1455, Copenhagen, Denmark

    Yannis Panagis

Authors
  1. Ioannis Kokotinis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marios Kendea
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nikolaos Nodarakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Angeliki Rapti
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Spyros Sioutas
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Athanasios K. Tsakalidis
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Dimitrios Tsolis
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. Yannis Panagis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nikolaos Nodarakis .

Editor information

Editors and Affiliations

  1. Computer Science and Software Engineering, Swinburne University of Technology, Hawthorn, Victoria, Australia

    Timos Sellis

  2. Informatics, Ionian University, Kerkyra, Greece

    Konstantinos Oikonomou

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Kokotinis, I. et al. (2017). NSM-Tree: Efficient Indexing on Top of NoSQL Databases. In: Sellis, T., Oikonomou, K. (eds) Algorithmic Aspects of Cloud Computing. ALGOCLOUD 2016. Lecture Notes in Computer Science(), vol 10230. Springer, Cham. https://doi.org/10.1007/978-3-319-57045-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-57045-7_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-57044-0

  • Online ISBN: 978-3-319-57045-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation