1 repositorio
Recuperación de filas de una tabla utilizando claves ordenadas para lograr una complejidad temporal logarítmica.
Diferente de las interfaces de búsqueda por clave: Ninguno de los candidatos cubre la creación de subconjuntos mediante búsqueda binaria en tablas en memoria; la mayoría son para almacenes K-V o Tries.
Explore 1 awesome GitHub repository matching data & databases · Subconjuntos mediante búsqueda binaria basada en claves. Refine with filters or upvote what's useful.
This project is a high-performance tabular data processing framework for R, designed to handle massive datasets with memory efficiency and speed. It provides an enhanced data structure that utilizes reference semantics and in-place modification to perform complex transformations without the overhead of unnecessary object copying. The library distinguishes itself through its low-level architectural optimizations, including multi-threaded parallel processing, radix-based sorting, and memory-mapped file parsing. By offloading critical data manipulation and aggregation routines to compiled C code
Enables high-performance binary search subsetting by setting columns as keys to physically reorder data.