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

DOI10.1016/0020-0190(90)90016-QzbMATH Open0695.68016OpenAlexW2055499419MaRDI QIDQ910190FDOQ910190

Oded Shmueli, Gabriel Matsliach

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

Recommendations

• Publication:4896251
• 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

zbMATH Keywords

distributed data structures\(B^+\)-treeloosely coupled environment

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Concurrent operations on \(B^ *\)-trees with overtaking

Cited In (2)

• Title not available (Why is that?)
• Distributed search trees: fault tolerance in an asynchronous environment

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)