Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations
From MaRDI portal
Publication:1857041
DOI10.1016/S0020-0255(02)00261-XzbMath1033.68553MaRDI QIDQ1857041
Publication date: 11 February 2003
Published in: Information Sciences (Search for Journal in Brave)
68P10: Searching and sorting
68P15: Database theory
68U99: Computing methodologies and applications
68P05: Data structures
Cites Work