# differences

## Transactional Data Lakes Comparison

The interest in data lake has been increasing as more features are being added to the data lake frameworks and cloud services availability. In this article we will discuss the comparison between transactional data lakes - Apache Hudi, Delta Lake and Apache Iceberg and AWS Lake Formation.

Posted December 1, 2022 by Rohith ‐ **7 min read**

## B Tree vs B+ Tree

B-Tree is known as a self-balancing tree as its nodes are sorted in the inorder traversal. In B-tree, a node can have more than two children. B-tree has a height of logM N (Where â€˜Mâ€™ is the order of tree and N is the number of nodes). B+ tree eliminates the drawback B-tree used for indexing by storing data pointers only at the leaf nodes of the tree. Thus, the structure of leaf nodes of a B+ tree is quite different from the structure of internal nodes of the B tree.

## Selection Sort vs Bubble Sort

The selection sort algorithm generally is the first sorting algorithm that is taught to us. Here in every iteration of the inner loop, the smallest element is replaced with the starting element in each loop. The bubble sort algorithm might look a little bit confusing when we first study it. But here is the easy explanation of it. Here swapping is carried on in two ways. In every iteration of the outer loop, the largest element is found and swapped with the last element in the loop.

Posted September 12, 2022 by Rohith and Anusha ‐ **1 min read**

⌖ quick-references blog selection-sort bubble-sort differences

## Quick Sort vs Merge Sort

Quick sort is a comparison based sorting algorithm that follows the divide and conquer technique to sort the arrays. In quick sort, we usually use a pivot (key) element to compare and interchange the position of the element based on some condition. Merge sort is a most important sorting techniques that work on the divide and conquer strategies. It is the most popular sorting techniques used to sort data that is externally available in a file.

## BFS vs DFS

BFS i.e. Breadth-First Search, is a vertex-based technique for finding the shortest path in the graph. It uses a Queue data structure that follows first in first out. DFS i.e. Depth First Search, is an edge-based technique. It uses the Stack data structure and performs two stages, first visited vertices are pushed into the stack, and second if there are no vertices then visited vertices are popped.