Abstract
In this work, we survey state of the art hierarchical distributed data structures for the efficient handling of big data, in scenarios where the dominant operation is range queries which have to be answered in real-time. Our main focus is on structures that exhibit stable scalability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aspnes, J., Shah, G.: Skip graphs. In: Proceedings 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, MD, pp. 384–393 (2003)
Barkai, D.: Technologies for sharing and collaborating on the net. In: 1st International Conference on Peer-to-Peer Computing (P2P 2001), 27–29 August 2001, Linköping, Sweden, pp. 13–28 (2001)
Brodal, G.S., Sioutas, S., Tsichlas, K., Zaroliagis, C.: D2-tree: a new overlay with deterministic bounds. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6507, pp. 1–12. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-17514-5_1
Crainiceanu, A., Linga, P., Machanavajjhala, A., Gehrke, J., Shanmugasundaram, J.: Load balancing and range queries in P2P systems using P-Ring. ACM Trans. Internet Technol. 10(4), 1–30 (2011)
Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. Commun. ACM 51(1), 107–113 (2008)
Ding, G., Wang, L., Wu, Q.: Big data analytics in future internet of things. CoRR, abs/1311.4112 (2013)
Ganesan, P., Bawa, M., Garcia-Molina, H.: Online balancing of range-partitioned data with applications to peer-to-peer systems. In: (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB 2004, Toronto, Canada, 31 August–3 September 2004, pp. 444–455 (2004)
Jagadish, H.V., Ooi, B.C., Tan, K.-L., Vu, Q.H., Zhang, R.: Speeding up search in peer-to-peer networks with a multi-way tree structure. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Chicago, Illinois, USA, 27–29 June 2006, pp. 1–12 (2006)
Jagadish, H.V., Ooi, B.C., Vu, Q.H.: BATON: a balanced tree structure for peer-to-peer networks. In: Proceedings of the 31st Conference on Very Large Databases (VLDB 2005), Trondheim, Norway, pp. 661–672 (2005)
Kaporis, A.C., Makris, C., Sioutas, S., Tsakalidis, A.K., Tsichlas, K., Zaroliagis, C.D.: Improved bounds for finger search on a RAM. Algorithmica 66(2), 249–286 (2013)
Knuth, D.E.: The Art of Computer Programming, vol. III, 2nd edn. Addison-Wesley, Redwood City (1998)
Liau, C.Y., Ng, W.S., Shu, Y., Tan, K.-L., Bressan, S.: Efficient range queries and fast lookup services for scalable P2P networks. In: Ng, W.S., Ooi, B.-C., Ouksel, A.M., Sartori, C. (eds.) DBISP2P 2004. LNCS, vol. 3367, pp. 93–106. Springer, Heidelberg (2005). https://doi.org/10.1007/978-3-540-31838-5_7
Mehlhorn, K., Tsakalidis, A.K.: Dynamic interpolation search. In: Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece, 15–19 July 1985, Proceedings, pp. 424–434 (1985)
Papadopoulos, A.N., Sioutas, S., Zacharatos, S., Zaroliagis, C.: Efficient distributed range query processing in apache spark. In: Proceedings of 19th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing - CCGRID 2019, pp. 569–575. IEEE Computer Society (2019)
Ratnasamy, S., Francis, P., Handley, M., Karp, R.M., Shenker, S.: A scalable content-addressable network. In: SIGCOMM, pp. 161–172 (2001)
Sioutas, S., Sourla, E., Tsichlas, K., Zaroliagis, C.: D3-tree: a dynamic deterministic decentralized structure. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 989–1000. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48350-3_82
Sioutas, S., Sourla, E., Tsichlas, K., Zaroliagis, C.: ART\(^+\): a fault-tolerant decentralized tree structure with ultimate sub-logarithmic efficiency. In: Karydis, I., Sioutas, S., Triantafillou, P., Tsoumakos, D. (eds.) ALGOCLOUD 2015. LNCS, vol. 9511, pp. 126–137. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-29919-8_10
Sioutas, S., Triantafillou, P., Papaloukopoulos, G., Sakkopoulos, E., Tsichlas, K.: Art: Sub-logarithmic decentralized range query processing with probabilistic guarantees. J. Distrib. Parallel Databases (DAPD) 31(1), 71–109 (2012)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. SIGCOMM Comput. Commun. Rev. 31(4), 149–160 (2001)
White, T.: Hadoop: The Definitive Guide. O’Reilly (2015)
Zaharia, M., et al.: Apache spark: a unified engine for big data processing. Commun. ACM 59(11), 56–65 (2016)
Zhang, Y., Liu, L., Li, D., Liu, F., Lu, X.: DHT-based range query processing for web service discovery. In: Proceedings of the IEEE International Conference on Web Services (ICWS 2009), Los Angeles, CA, pp. 477–484, IEEE, July 2009
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Sioutas, S., Vonitsanos, G., Zacharatos, N., Zaroliagis, C. (2020). Scalable and Hierarchical Distributed Data Structures for Efficient Big Data Management. In: Brandic, I., Genez, T., Pietri, I., Sakellariou, R. (eds) Algorithmic Aspects of Cloud Computing. ALGOCLOUD 2019. Lecture Notes in Computer Science(), vol 12041. Springer, Cham. https://doi.org/10.1007/978-3-030-58628-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-58628-7_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-58627-0
Online ISBN: 978-3-030-58628-7
eBook Packages: Computer ScienceComputer Science (R0)