With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your secuirty. Auth0 now, thank yourself later.
Try free now
Bright Data - All in One Platform for Proxies and Web Scraping
Say goodbye to blocks, restrictions, and CAPTCHAs
Bright Data offers the highest quality proxies with automated session management, IP rotation, and advanced web unlocking technology. Enjoy reliable, fast performance with easy integration, a user-friendly dashboard, and enterprise-grade scaling. Powered by ethically-sourced residential IPs for seamless web scraping.
100% Upwards compatible variant of SQLite. Provides win32/win64 versions of sqlite3.dll, which work better (smaller/faster/longer paths) than the dll's provided by sqlite.org.
The Java RTree project aims to maintain an Java version of the RTree spatial indexing algorithm. See http://jsi.sourceforge.net for more information, and http://github.com/aled/jsi for latest development code.
The R-tree Library aims to implement a generic, portable, easy-to-use collection of R-tree variants. Tested to work under Linux and Windows, using GNU, Intel and VC++ compilers, and also implementing many variants already, we are well underway.
Secure and customizable compute service that lets you create and run virtual machines on Google’s infrastructure.
Computing infrastructure in predefined or custom machine sizes to accelerate your cloud transformation. General purpose (E2, N1, N2, N2D) machines provide a good balance of price and performance. Compute optimized (C2) machines offer high-end vCPU performance for compute-intensive workloads. Memory optimized (M2) machines offer the highest memory and are great for in-memory databases. Accelerator optimized (A2) machines are based on the A100 GPU, for very demanding applications.
A disk based production quality RTree based upon Guttmans quadratic split algorithm having following features:
Buffering with dirty write,
Index joins,
Tree Seeding,
Window and NN queries,
Runtime STR Packing capability,
Completely Thread safe.
An extensible spatial index library in C++ that supports robust spatial indexing methods and many advanced features. Currently supports R-tree (Rtree, R*-tree) variants, Multi Version R-trees (MVR-tree) and TPR-trees. For more information please visit the project homepage.