Search Results for "b-tree implementation"

x
Sort By:

Showing 1 open source project for "b-tree implementation"

View related business solutions
Algorithms JavaScript Clear Filters & Widen Search
  • $300 Free Credits to Build on Google Cloud Icon
    $300 Free Credits to Build on Google Cloud

    New customers can spin up VMs, build with AI, and query data at no cost.

    Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
    Start Free
  • Train ML Models With SQL You Already Know Icon
    Train ML Models With SQL You Already Know

    BigQuery automates data prep, analysis, and predictions with built-in AI assistance.

    Build and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
    Start Free
  • 1
    Flatbush

    Flatbush

    A very fast static spatial index for 2D points and rectangles in JS

    A really fast static spatial index for 2D points and rectangles in JavaScript. An efficient implementation of the packed Hilbert R-tree algorithm. Enables fast spatial queries on a very large number of objects (e.g. millions), which is very useful in maps, data visualizations and computational geometry algorithms.
    Downloads: 6 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next

Related Categories

MongoDB Logo MongoDB