There are 0 repository under range-queries topic.
Differentially private spatial decomposition of 2D data for range queries
Thread-safe .NET collections with built-in, monotonic timestamps and a unified API for fast range queries, pruning, and temporal analytics
This repository is a personal playground for practicing and implementing Data Structures and Algorithms.
Bounded Range Query
Implementing indexing and searching techniques for spatial data by creating an R-tree using Python.
Optimizing Range Queries with 2D Location Data using Google S2
This repository contains clean and efficient solutions to the CSES Problem Set, implemented in C++. Great for practicing algorithms and preparing for competitive programming.
This repository contains simple implementations of Segment Trees and Interval Trees, which were developed as part of a university project at the Computer Engineering and Informatics Department of the University of Patras. They include functions for range and stabbing queries.
Here we have implemented B-Plus Tree for data block indexing as a data system project
Online Maximum Independent Set of Hyperrectangles
A hybrid search system combining B+ Trees for range filtering and HNSW for approximate nearest neighbor (ANN) search. Features bulkloading for efficient tree construction, HNSWLib integration, and dynamic switching between brute-force and ANN search for optimal performance. Supports binary data processing and visualization with Graphviz.
Python implementation of Mo's Algorithm - a method for answering a series of range queries on the same array. The repository provides a general interface for Mos operations
Research publications in Algorithms Optimization and Machine Learning
cses problem set solution for competitive programming.