Distributing a B^+-tree in a loosely coupled environment

DOI10.1016/0020-0190(90)90016-QMaRDI QIDQ910190zbMATH OpenOpenAlexFDO

Authors Gabriel Matsliach, Oded Shmueli

Publication date 1990

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(90)90016-q

zbMATH Keywords

\(B^+\)-treedistributed data structuresloosely coupled environment

Mathematics Subject Classification ID

Theory of operating systems (68N25) Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 936823
• Distributed Sorting
• Balanced distributed search trees do not exist
• Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time.
• Memory management for B-trees

Cites work

• Concurrent operations on \(B^ *\)-trees with overtaking
• scientific article; zbMATH DE number 3890770 (Why is no real title available?)
• scientific article; zbMATH DE number 3653523 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)

Cited in

(2)

• Distributed search trees: fault tolerance in an asynchronous environment
• scientific article; zbMATH DE number 936823 (Why is no real title available?)

This page was built for publication: Distributing a \(B^+\)-tree in a loosely coupled environment

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