Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

More modern b-tree techniques

From MaRDI portal
Publication:6599130
Jump to:navigation, search

DOI10.1561/1900000070zbMATH Open1547.68159MaRDI QIDQ6599130FDOQ6599130


Authors: Goetz Graefe Edit this on Wikidata


Publication date: 5 September 2024

Published in: Foundations and Trends in Databases (Search for Journal in Brave)





Recommendations

  • The log-structured merge-tree (LSM-tree)
  • \(B\)-trees with lazy parent split
  • Modeling B-tree insertion activity
  • Belga B-trees
  • scientific article; zbMATH DE number 3843183


zbMATH Keywords

recoveryconcurrency controlstoragedatabase designtransaction managementaccess method: indexing


Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05) Database theory (68P15)


Cites Work

  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • Efficient locking for concurrent operations on B-trees
  • The SB-tree: An index-sequential structure for high-performance sequential access
  • Duplicate record elimination in large data files
  • The log-structured merge-tree (LSM-tree)






This page was built for publication: More modern b-tree techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599130)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6599130&oldid=40149160"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 18:17. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki