Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
-
Updated
Jul 3, 2021 - C
Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
concurrent KV-store with a B+-tree index
A simplified relational database management system with support for integer-only tables and matrices. Supports linear hash and B+ tree indices, two-phase merge sort, buffer management and aggregate queries.
This Java package implements a system which searches for some given words into a large number of text files, and returns all the locations where they are found.
Repository for the "SCC0215 - File Organization" course's project offered for Computer Science undergraduates at ICMC - USP, by professor Cristina Ciferri.
Duplicate Removal from Database Relation using B-Trees and Hashing
A disk-based B+ tree implementation that supports concurrency and transactions
Project for CS course structures of databases
Add a description, image, and links to the btree-index topic page so that developers can more easily learn about it.
To associate your repository with the btree-index topic, visit your repo's landing page and select "manage topics."