garibiDB: A Memory-Efficient Vector-Graph Database for Resource-Constrained Environments
Abstract Resource-constrained environments, such as edge devices and low-tier servers, require database systems that efficiently support both vector similarity search over embeddings and complex graph traversals over interconnected data. Current vector or graph databases and their hybrid integrations are often memory-intensive, precluding their deployment under strict RAM limits, specifically those below one hundred megabytes. This paper presents the architectural design and theoretical framework for garibiDB, a proposed vector-graph database explicitly optimized for operation within such tight memory constraints while maintaining transactional consistency.