High performance nearest neighbor data structures (KDTree and BallTree) and algorithms for Julia.

Octree/Quadtree/N-dimensional linear tree

A Python implementation of Priority R-Tree, an alternative to RTree.

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

AngularJS functionality to query the server for events either from the user's current location using HTML5 Geolocation or the user's city preference's coordinates. Remove event if the distance between it and the user's location is bigger than the specified range of miles.

Master's thesis titled "MAKING LARGE TRANSFERS FAST FOR IN-MEMORY DATABASES IN MODERN NETWORKS". Style files forked off from the sample thesis from @fishcorn. To compile go to "thesis" folder and run `make`.

Implemented B+ Tree for executing range queries on large SQL records

my solution to interview bit problem

database design + database implemntaiton too;Bases de Datos Relacionales

Search and clustering vectors in C++

📐 This project implements various computational geometry algorithms, focusing on convex hulls, linear programming, Delaunay triangulation, and geometric search. The code is organized into multiple modules, each solving specific geometry-related problems and demonstrating core computational methods.