TY - JOUR
TI - View serializable updates of concurrent index structures
AU - Cosmadakis, S.
AU - Ioannidou, K.
AU - Stergiou, S.
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PY - 2002
VL - 2397
TODO - null
SP - 247-262
PB - Springer-Verlag
SN - null
TODO - 10.1007/3-540-46093-4_15
TODO - Forestry, Binary search trees;  Index structure;  Serializability, Binary trees
TODO - We present new algorithms for concurrent reading and updating of B*-trees and binary search trees. Our algorithms are based on the well-known link technique, and improve previously proposed solutions in several respects. We prove formally that our algorithms are correct. We show that they satisfy a view serializability criterion, which fails for previous solutions. This stronger serializability criterion is central to the proof that several subtle (but essential) optimizations incorporated in our algorithms are correct. © Springer-Verlag Berlin Heidelberg 2002.
ER -