Skip to main content
SpringerLink
Log in

Efficient transitive operations using binary indexed trees

  • Original Research
  • Published:
International Journal of Information Technology Aims and scope Submit manuscript

Abstract

In this paper, we propose a novel data structure and the algorithms to build, update and perform range query operations of transitive function. The update and query operation takes O(log(n)) time, and the space required for operating data is also O(cn), where c=3 proving it to be efficient than other data structures such as segment tree and sparse table. Experimental analysis shows the statistical evidence of proposed algorithm and conclude that it provides a good trade-off between space and time complexity in comparison to existent methods.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Haynal S, Haynal H (2013) Brute-force search of fast convolution algorithms. In: 2013 IEEE International Conference on Acoustics, Speech and Signal Processing, IEEE, pp 2586–2590

  2. Ibtehaz N, Kaykobad M, Sohel Rahman M (2021) Multidimensional segment trees can do range updates in poly-logarithmic time. Theor Comput Sci 854:30–43.https://doi.org/10.1016/j.tcs.2020.11.034

    Article  MathSciNet  MATH  Google Scholar 

  3. Iskandar S (2013) Segment tree for solving range minimum query problems segment tree for solving range minimum query problems. https://doi.org/10.13140/2.1.4279.2643

  4. Peter MF (1994) A new data structure for cumulative frequency tables. Softw Pract Exp 24(3):327–336

    Article  Google Scholar 

  5. Heuer T, Baumstark N, Gog S, Labeit J (2017) Practical range minimum queries revisited. 16 th International symposium on experimental algorithms (SEA 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Wadern

    Google Scholar 

  6. Lewenstein M, Amir A, Fischer J (2007) Two-dimensional range minimum queries. Annual symposium on combinatorial pattern matching. Springer, Berlin, pp 286–294

    Google Scholar 

  7. Hyvönen J, Saramäki J, Kaski K (2008) Efficient data structures for sparse network representation. Int J Comput Math 85(8):1219–1233

    Article  MathSciNet  Google Scholar 

  8. Ferrada H, Navarro G (2017) Improved range minimum queries. J Discret Algorithms 43:72–80

    Article  MathSciNet  Google Scholar 

  9. Ren F, Zhang C, Liu L, Wenyao X, Öwall V, Marković D (2014) A square-root-free matrix decomposition method for energy-efficient least square computation on embedded systems. IEEE Embed Syst Lett 6(4):73–76

    Article  Google Scholar 

  10. Zalaket J, Hajj-Boutros J (2011) Prime factorization using square root approximation. Comput Math Appl 61(9):2463–2467

    Article  MathSciNet  Google Scholar 

  11. Jansík B, Høst S, Jørgensen P, Olsen J, Helgaker T (2007) Linear-scaling symmetric square-root decomposition of the overlap matrix. J Chem Phys 126(12):124104

    Article  Google Scholar 

  12. Johannes F, Volker H (2006) Theoretical and practical improvements on the rmq-problem, with applications to lca and lce. Annual symposium on combinatorial pattern matching. Springer, Berlin, pp 36–48

    Google Scholar 

  13. Rivest RL, Cormen TH, Leiserson CE, Stein C (2001) Introduction to algorithms. MIT Press, London, p 13

    MATH  Google Scholar 

  14. Gerbessiotis Alexandros V (2006) An architecture independent study of parallel segment trees. J Discret Algorithms 4(1):1–24

    Article  MathSciNet  Google Scholar 

  15. Yadav A, Yadav D (2019) Wavelet tree based dual indexing technique for geographical search. Int Arab J Inf Technol 16(4):624–632

    Google Scholar 

  16. Tomasz MK, Grabowski S (2018) Faster range minimum queries. Softw Pract Exp 48(11):2043–2060

    Google Scholar 

  17. Arun KY, Divakar Y, Rajesh P (2016) Efficient textual web retrieval using wavelet tree. Int J Inform Retr Res (IJIRR) 6(4):16–29

    Google Scholar 

  18. Tarjan RE, Gabow HN, Bentley JL (1984) Scaling and related techniques for geometry problems. In Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, pp 135–143

  19. Elhabashy AM, Mohamed AB, Abou El NM (2009) An enhanced distributed system to improve the time complexity of binary indexed trees

  20. Dima M, Ceterchi R (2015) Efficient range minimum queries using binary indexed trees. Olymp Inform 9(1):39–44

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, National Institute of Technology, Hamirpur, India

    Kartikey Tewari, Abhijeet Shrivastava, Arun Kumar Yadav & Divakar Yadav

Authors
  1. Kartikey Tewari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abhijeet Shrivastava
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Arun Kumar Yadav
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Divakar Yadav
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Divakar Yadav.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tewari, K., Shrivastava, A., Yadav, A.K. et al. Efficient transitive operations using binary indexed trees. Int. j. inf. tecnol. 13, 1155–1163 (2021). https://doi.org/10.1007/s41870-021-00685-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s41870-021-00685-z

Keywords

Search

Navigation