L-Store Database with QueCC concurency control to manage parrallelism

This is a python implementation of the L-Store database oultined in the research paper below. The project was undertaken by 5 students at the University of California Davis in an undergraduate databse class. The L-Store database is also capable of all operations in parallel due to the implementation of the data structure outlined in the following research paper.

Name		Name	Last commit message	Last commit date
Latest commit History 112 Commits
.gitignore		.gitignore
README.md		README.md
__init__.py		__init__.py
__main__.py		__main__.py
bufferpool.py		bufferpool.py
column.py		column.py
config.py		config.py
db.py		db.py
index.py		index.py
index_tester.py		index_tester.py
logger.py		logger.py
m1_testing.py		m1_testing.py
m2_tester_part1.py		m2_tester_part1.py
m2_tester_part2.py		m2_tester_part2.py
page.py		page.py
query.py		query.py
range.py		range.py
record.py		record.py
requirements.txt		requirements.txt
table.py		table.py

daygodavy/BCDHK-LStoreDB

Folders and files

Latest commit

History

Repository files navigation

L-Store Database with QueCC concurency control to manage parrallelism

L-Store: https://www.researchgate.net/publication/324150481_L-Store_A_Real-time_OLTP_and_OLAP_System

QueCC: https://www.researchgate.net/publication/329625027_QueCC_A_Queue-oriented_Control-free_Concurrency_Architecture

About

Resources

Stars

Watchers

Forks

Languages