Journal Article10.1007/S41870-021-00685-Z
Efficient transitive operations using binary indexed trees
5
TL;DR: In this paper, the authors proposed a novel data structure and the algorithms to build, update and perform range query operations of transitive function, which 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.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE
Johannes Fischer,Volker Heun +1 more
TL;DR: In this paper, the authors present a linear preprocessing time and constant query time algorithm for the range minimum query problem without making use of any dynamic data structure, which consumes less than half of the space that is needed by the method by Berkman and Vishkin.
116
A scalable approach for index compression using wavelet tree and LZW
TL;DR: An algorithm to construct a wavelet tree for a text file and compress it using LZW (Lempel-Ziv-Welch)compression technique is proposed and it has been observed that the proposed algorithm outperforms other methods used for indexing large datasets in terms of space requirement without affecting other parameters.
4
An efficient framework for spatio-textual skyline querying and minimizing search space using R+ tree indexing technique
TL;DR: This paper presents a spatial-textual skyline querying process using the R + tree indexing technique for establishing a relation between the keywords given by the user and the geometric data of the user with an efficient sky R+pruning technique while considering the minimization of search space for the user’s query.
3
Spatial indexing and searching using parallel wavelet tree
Dharmendra Kumar,Divakar Singh Yadav,Diwakar Singh Yadav +2 more
TL;DR: Results show that the presented algorithm performs well in the scale-up of a large dataset with full utilization of cores and shows a good trade-off and is scalable for large input data sets.
1
References
•Book
Introduction to Algorithms
Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest +2 more
- 01 Jan 1990
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
24.8K
Introduction to Algorithms
Xin-She Yang
- 01 Jan 2014
TL;DR: This chapter provides an overview of the fundamentals of algorithms and their links to self-organization, exploration, and exploitation.
8.3K
Scaling and related techniques for geometry problems
Harold N. Gabow,Jon Louis Bentley,Robert E. Tarjan +2 more
- 01 Dec 1984
TL;DR: Three techniques in computational geometry are explored: scaling solves a problem by viewing it at increasing levels of numerical precision; activation is a restricted type of update operation, useful in sweep algorithms; the Cartesian tree is a data structure for problems involving maximums and minimums.
609
A new data structure for cumulative frequency tables
TL;DR: The binary indexed tree is faster, using more compact data and simpler code, and makes the new method particularly suitable for large symbol alphabets.
207
Theoretical and practical improvements on the RMQ-Problem, with applications to LCA and LCE
Johannes Fischer,Volker Heun +1 more
- 05 Jul 2006
TL;DR: This work presents a direct algorithm for the general RMQ-problem with linear preprocessing time and constant query time, without making use of any dynamic data structure, and consumes less than half of the space needed by the method by Berkman and Vishkin.
172
Related Papers (5)
Harald Bogeholz,Michael Brand,Radu-Alexandru Todor +2 more
- 01 Apr 2020
Junwei Sun,Bai Wang,Bin Wu +2 more
- 18 Jul 2021
Manjari Gupta,Rajwant Singh Rao,Anil Kumar Tripathi +2 more
- 01 Dec 2010