Abstract
Recent growth of cloud data and cloud computing has been expediter and predecessor to the appearance of big data. Cloud computing has improved data storage by calculating and saving time with the means of identical and relevant technologies. While cloud computing provides important benefits over conventional physical deployments, its platform has also originated in numerous forms from time to time (Gog and Petri in Softw Pract Exp 44:1287–1314 [1]). In this proposed paper, the main data structure used in big data is tree. Quad tree is used for graphics and spatial data in the main memory. Traditional sub-linear algorithms that are used to handle Quad tree were inefficient. Also, SDS can be optimized for query handling and space. Optimized SDS can improve functionality of different SDS like rank and select, FM index (Blandford et al. in Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, pp 679–688, 2003 [2]). As geometric data, proteins database, Gnome data, DNA data are large databases for main memory, an efficient and simple representation is required in main memory of computer system. However, overall quantity of storing area is not a vital problem in recent times, considering the fact that external memory can store large quantity of data and may be inexpensive, time needed to get access to information is a vital blockage in numerous programs. Number of access for hitting outside of memory is conventionally lower than number of access for hitting into main memory which has caused examine of recent compressed demonstrations of information that might be capable to save identical data in a reduced area.
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
S. Gog, M. Petri, Optimized succinct data structures for massive data. Softw. Pract. Exp. 44(11), 1287–1314 (2003). https://doi.org/10.1002/spe.2198
D.K. Blandford, G.E. Blelloch, I.A. Kash, Compact representations of separable graphs, in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2003), pp. 679–688
S. Rajbhandari, A. Singh, Big data in healthcare, in International Conference on Innovative Computing and Communications (Springer, Berlin, 2019), p. 261. https://doi.org/10.1007/978-981-13-2354-6_28
A. Saxena, A. Chaurasia, N. Kaushik, Handling big data using map reduce over hybrid cloud, in International Conference on Innovative Computing and Communications (Springer, Berlin, 2019), p. 135. https://doi.org/10.1007/978-981-13-2354-6_16
D.K. Blandford, G.E. Blelloch, Compact representations of ordered sets, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, Jan 2004
G. Gottlob, T. Schwentick, Rewriting ontological queries into small non recursive data log programs, in KR (2012)
R. Raman, V. Raman, S.S. Rao, Succinct indexable dictionaries with applications to encoding kary trees and multisets, in SODA (2002), pp. 233–242
J.I. Munro, V. Raman, A.J. Storm. Representing dynamic binary trees succinctly, in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 7–9 Jan 2001 (ACM Press, New York), pp. 529–536
J.I. Munro, V. Raman, Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31(3), 762–776 (2002)
R. Raman, S.S. Rao, Succinct dynamic dictionaries and trees. in Annual International Colloquium on Automata, Languages and Programming (CALP), Lecture Notes in Computer Science, vol. 2719 (Springer, Berlin, 2003), pp. 357–368
S. Ladra, Algorithms and compressed data structures for information retrieval. Ph.D. thesis, University of A Coruña, 2011
P. Ferragina, G. Manzini, On compressing and indexing data. J. ACM 52(4), 552–581 (2005). (Also in IEEE FOCS 2000)
V. Kumar et al., Data representation in big data via succinct data structures. Int. J. Eng. Sci. Technol. (IJEST) 10(1), 21–28 (2018). ISSN 0975-5462. (UGC Approved Journal till 01/05/2018, ICI indexed)
V. Kumar, J. Shekhar, S. Kumar, Comparative study of sensible compendious data structures for massive data store, in Proceedings of International Conference on Research and Innovation in Engineering (ICRIE-2016), 12–13 Feb 2016, Gr. Noida, India, pp. 128–131. ISBN:978-93-5254-3
V. Kumar et al., Compendious and optimized data structures for big data store, in Proceedings of International Conference on IOT (ICIoTCT-2018), 26–27 Mar 2018, MNIT Jaipur, India, SSRN (Elsevier). (Scopus indexed)
R. Raman, V. Raman, S.S. Rao, Succinct indexable dictionaries with applications to encoding k-ary trees and multisets, in ACM—SIAM Symposium on Discrete Algorithms, (2002), pp. 233–242
Scott Aaronson, NP-complete problems and physical reality. SIGACT News 36(1), 30 (2005)
B. Chazelle, Who says you have to look at the input? The brave new world of sublinear computing, in Plenary talk at the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004) (2004)
R.F. Geary, R. Raman, V. Raman, Succinct ordinal trees with level-ancestor queries, in SODA’04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms (Society for Industrial and Applied Mathematics, 2004), p. 110
J.I. Munro, R. Raman, V. Raman, S.S Rao. Succinct representations of permutations. in Annual International Colloquium on Automata, Languages and Programming (CALP), Lecture Notes in Computer Science, vol. 2719 (Springer, Berlin, 2003), pp. 345–356
J.I. Munro, S.S. Rao, Succinct representations of functions, in Annual International Colloquium on Automata, Languages and Programming (CALP), Lecture Notes in Computer Science, vol. 3142 (Springer, Berlin, 2004), pp. 1006–1015
V. Kumar, J. Shekhar, Design of sensible compendious data structures for Top p completion in Massive data store, in Proceedings of National Conference on Research and Innovation in Engineering (RSCTA-2016), 12–13 Mar 2016, Ramanujan College University of Delhi, India, pp. 256–131. ISBN 978-93-5254-320
R. Grossi, A. Gupta, J.S. Vitter, High-order entropy-compressed text indexes, in SODA (2003), pp. 841–850
S. Muthukrishnan, Data streams: algorithms and applications, in Plenary Talk at the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003) (2003)
D. Benoit, E.D. Demaine, J.I. Munro, R. Raman, V. Raman, S. Rao, Representing trees of higher degree. Algorithmica 43(4), 275–292 (2005)
J.I. Munro, V. Raman, S.S. Rao, Space efficient suffix trees. J. Algorithms 39, 205–222 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Kumar, V., Singh, A.K., Singh, S.P. (2021). Compendious and Succinct Data Structures for Big Data. In: Gao, XZ., Tiwari, S., Trivedi, M., Mishra, K. (eds) Advances in Computational Intelligence and Communication Technology. Advances in Intelligent Systems and Computing, vol 1086. Springer, Singapore. https://doi.org/10.1007/978-981-15-1275-9_37
Download citation
DOI: https://doi.org/10.1007/978-981-15-1275-9_37
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-1274-2
Online ISBN: 978-981-15-1275-9
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)