Fluree database library
The SQLite R*Tree Module
An R-Tree is a special index that is designed for doing range queries. R-Trees are most commonly used in geospatial systems where each entry is a rectangle with minimum and maximum X and Y coordinates. Given a query rectangle, an R-Tree is able to quickly find all entries that are contained within the query rectangle or which overlap the query rectangle. This idea is easily extended to three dimensions for use in CAD systems. R-Trees also find use in time-domain range look-ups. For example, suppose a database records the starting and ending times for a large number of events. A R-Tree is able to quickly find all events that were active at any time during a given time interval, or all events that started during a particular time interval, or all events that both started and ended within a given time interval. And so forth.
Relational foundations for functorial data migration | Proceedings of the 15th Symposium on Database Programming Languages
In this paper we present a simple database definition language: that of categories and functors. A database schema is a small category and an instance is a set-valued functor on it. We show that morphisms of schemas induce three ''data migration ...
🚀 Announcing readwise-vector-db: Supercharge Your Readwise Library with Local, Semantic Search
dialog-db/rust/dialog-ucan at main · dialog-db/dialog-db
Dialog is an embeddable database designed for local-first software. - dialog-db/dialog-db
ParadeDB — Search without a second system
One Postgres for your application data, full-text search, vector retrieval, and aggregations. Home of the pg_search extension.
The Magic of Small Databases
Notes on personal libraries, collections and small indexes on the web
Anna’s Archive: LibGen (Library Genesis), Sci-Hub, Z-Library in one place - Anna’s Archive
The world’s largest open-source open-data library. Mirrors Sci-Hub, Library Genesis, Z-Library, and more.
GitHub - clarisma/geodesk: Fast and storage-efficient spatial database engine for OpenStreetMap data
Fast and storage-efficient spatial database engine for OpenStreetMap data - clarisma/geodesk
Functorial data migration
In this paper we present a simple database definition language: that of categories and functors. A database schema is a small category and an instance is a set-valued functor on it. We show that morphisms of schemas induce three “data migration functors”, which translate instances from one schema to the other in canonical ways. These functors parameterize projections, unions, and joins over all tables simultaneously and can be used in place of conjunctive and disjunctive queries. We also show how to connect a database and a functional programming language by introducing a functorial connection between the schema and the category of types for that language. We begin the paper with a multitude of examples to motivate the definitions, and near the end we provide a dictionary whereby one can translate database concepts into category-theoretic concepts and vice versa.
Mastering PostGIS
PostGIS is open source extension onf PostgreSQL object-relational database system that allows GIS objects to be stored and allows querying for information and location services. The aim of this book is to help you master the functionalities offered by PostGIS- from data creation, analysis and output, to ETL and live edits. The book begins with an overview of the key concepts related to spatial database systems and how it applies to Spatial RMDS. You will learn to load different formats into your Postgres instance, investigate the spatial nature of your raster data, and finally export it using built-in functionalities or 3th party tools for backup or representational purposes. Through the course of this book, you will be presented with many examples on how to interact with the database using JavaScript and Node.js. Sample web-based applications interacting with backend PostGIS will also be presented throughout the book, so you can get comfortable with the modern ways of consuming and modifying your spatial data.
WillSearch – GuardianDB. A peer-to-peer database for the Decentralized Web.
A High-performance, local-first decentralized database built on Rust and Iroh
A Graph-Based Firebase
This essay covers the design behind Instant. If the schleps we face as UI engineers are actually database problems in disguise, would a database-looking solution solve them?
surrealdb/surrealdb
A scalable, distributed, collaborative, document-graph database, for the realtime web
