scholarly journals BST-MRPAS: Binary Search Tree based Multi Replica for Public Cloud Auditing System

2019 ◽  
Vol 182 (37) ◽  
pp. 45-49
Author(s):  
Savita Vishwakarma ◽  
Rudresh Shah
Keyword(s):  
Search Tree ◽  
Binary Search ◽  
Binary Search Tree ◽  
Public Cloud ◽  
Cloud Auditing

scholarly journals E-ART: A New Encryption Algorithm Based on the Reflection of Binary Search Tree

Cryptography ◽  
2021 ◽  
Vol 5 (1) ◽  
pp. 4
Author(s):  
Bayan Alabdullah ◽  
Natalia Beloff ◽  
Martin White
Keyword(s):  
Data Storage ◽  
Statistical Tests ◽  
Data Encryption ◽  
Search Tree ◽  
Binary Search ◽  
Binary Search Tree ◽  
Security Level ◽  
Avalanche Effect ◽  
High Security Level ◽  
Tree Data Structure

Data security has become crucial to most enterprise and government applications due to the increasing amount of data generated, collected, and analyzed. Many algorithms have been developed to secure data storage and transmission. However, most existing solutions require multi-round functions to prevent differential and linear attacks. This results in longer execution times and greater memory consumption, which are not suitable for large datasets or delay-sensitive systems. To address these issues, this work proposes a novel algorithm that uses, on one hand, the reflection property of a balanced binary search tree data structure to minimize the overhead, and on the other hand, a dynamic offset to achieve a high security level. The performance and security of the proposed algorithm were compared to Advanced Encryption Standard and Data Encryption Standard symmetric encryption algorithms. The proposed algorithm achieved the lowest running time with comparable memory usage and satisfied the avalanche effect criterion with 50.1%. Furthermore, the randomness of the dynamic offset passed a series of National Institute of Standards and Technology (NIST) statistical tests.

Improving the Red-Black tree delete algorithm

2021 ◽  
Author(s):  
ZEGOUR Djamel Eddine
Keyword(s):  
Data Structure ◽  
Search Tree ◽  
Binary Search ◽  
Binary Search Tree ◽  
Search Performance ◽  
Running Time ◽  
Standard Algorithm ◽  
Color Changes ◽  
Red Black Tree ◽  
Symbol Tables

Abstract Today, Red-Black trees are becoming a popular data structure typically used to implement dictionaries, associative arrays, symbol tables within some compilers (C++, Java …) and many other systems. In this paper, we present an improvement of the delete algorithm of this kind of binary search tree. The proposed algorithm is very promising since it colors differently the tree while reducing color changes by a factor of about 29%. Moreover, the maintenance operations re-establishing Red-Black tree balance properties are reduced by a factor of about 11%. As a consequence, the proposed algorithm saves about 4% on running time when insert and delete operations are used together while conserving search performance of the standard algorithm.

O(log logn)-Competitive Binary Search Tree

2015 ◽  
pp. 1-4
Author(s):  
Chengwen Chris Wang ◽  
Daniel Sleator
Keyword(s):  
Search Tree ◽  
Binary Search ◽  
Binary Search Tree

Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree

2021 ◽  
pp. 143-150
Author(s):  
Tomohiro I ◽  
Robert W. Irving ◽  
Dominik Köppl ◽  
Lorna Love
Keyword(s):  
Search Tree ◽  
Binary Search ◽  
Binary Search Tree ◽  
Common Prefix ◽  
Longest Common Prefix Array

High Performance CGM-based Parallel Algorithms for the Optimal Binary Search Tree Problem

2016 ◽  
Vol 8 (4) ◽  
pp. 55-77 ◽  
Author(s):  
Vianney Kengne Tchendji ◽  
Jean Frederic Myoupo ◽  
Gilles Dequen
Keyword(s):  
Parallel Algorithms ◽  
Execution Time ◽  
High Performance ◽  
Scheduling Algorithm ◽  
Search Tree ◽  
Binary Search ◽  
Coarse Grained ◽  
Binary Search Tree ◽  
Parameter Dependent ◽  
The Impact

In this paper, the authors highlight the existence of close relations between the execution time, efficiency and number of communication rounds in a family of CGM-based parallel algorithms for the optimal binary search tree problem (OBST). In this case, these three parameters cannot be simultaneously improved. The family of CGM (Coarse Grained Multicomputer) algorithms they derive is based on Knuth's sequential solution running in time and space, where n is the size of the problem. These CGM algorithms use p processors, each with local memory. In general, the authors show that each algorithms runs in with communications rounds. is the granularity of their model, and is a parameter that depends on and . The special case of yields a load-balanced CGM-based parallel algorithm with communication rounds and execution steps. Alternately, if , they obtain another algorithm with better execution time, say , the absence of any load-balancing and communication rounds, i.e., not better than the first algorithm. The authors show that the granularity has a crucial role in the different techniques they use to partition the problem to solve and study the impact of each scheduling algorithm. To the best of their knowledge, this is the first unified method to derive a set of parameter-dependent CGM-based parallel algorithms for the OBST problem.

Sign in / Sign up

Export Citation Format

Share Document