avl-tree

AVL-tree implementation, supporting insertion, key based search, and remove operations.

b-plus-tree

Memory-resident B+ tree implementation, supporting insertion, key based search, bound based search and range search operations.

block-chain-project

Proyecto para el curso de algoritmos y estructuras de datos

boids-collision-quad-tree

A simulation of animals that fly in flocks and collide with each other. Internally, it uses an implementation of a bucket-PR-quad-tree to manage searches for nearby neighbors.

byjuandiego

db2-project-1

A table indexing system

db2-project-2

Full-Text Search Engine

db2-project-3

Face Recognition

disk-avl-tree

Auto-balanced binary search tree implementation that works with secondary memory to store records. Supports insertion, key-based search, range-based search and remove.

disk-b-plus-tree

A disk-resident Clustered B+ tree implementation optimized for secondary memory storage for fixed-length records. This solution supports efficient insertion and range search operations, making it well-suited for managing datasets.

disk-static-hash

Fixed-size hash table implementation for data storage and retrieval. It offers customizability, file-based storage, and error handling for managing large datasets.

file-system

Mini file management system for fixed and variable length records

hash-table

Dynamic hash table implementation that uses chaining method. Supporting insertion, delete and equality search.

hex-game-project

Proyecto para el curso de programación III

hypergraph-based-image-retrieval-system

Image Retrieval System for the courses of Machine Learning and Advanced Data Structures.

isam-tree

Static k-ary tree constructed in disk files. His main operation is the key-based search, but it also supports range search

linear-regression

Linear regression prediction model for the Most Streamed Spotify Songs 2023 dataset

minigrep

random-file

Sorted index file that uses disk files and RAM to manage record insertions and searching

rust-data-structures

simple-multithreading-operations

software-task

ss-tree

The Similarity Search Tree is an efficient method for indexing high dimensional feature vectors. The main objective of this data structure is to obtain the nearest neighbors given a certain query vector in a reasonable amount of time. In this project, the k-NN algorithm was adapted for supporting image retrieval.

stack-machine-language-tokenizer

Academic implementation of a tokenizer for a simple stack machine language

string-simulator

A simple dynamic string simulator

to-do-app