This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Recovery of R-Trees
Jan. 2013 (vol. 25 no. 1)
pp. 145-157
Tuukka Haapasalo, Aalto University, Aalto
Ibrahim Jaluta, Aalto University, Aalto
Seppo Sippu, University of Helsinki, Helsinki
Eljas Soisalon-Soininen, Aalto University, Aalto
We consider the recoverability of traditional R-tree index structures under concurrent updating transactions, an important issue that is neglected or treated inadequately in many proposals of R-tree concurrency control. We present two solutions to ARIES-based recovery of transactions on R-trees. These assume a standard fine-grained single-version update model with physiological write-ahead logging and steal-and-no-force buffering where records with uncommitted updates by a transaction may migrate from their original page to another page due to structure modifications caused by other transactions. Both solutions guarantee that an R-tree will remain in a consistent and balanced state in the presence of any number of concurrent forward-rolling and (totally or partially) backward-rolling multiaction transactions and in the event of process failures and system crashes. One solution maintains the R-tree in a strictly consistent state in which the bounding rectangles of pages are as tight as possible, while in the other solution this requirement is relaxed. In both solutions only a small constant number of simultaneous exclusive latches (write latches) are needed, and in the solution that only maintains relaxed consistency also the number of simultaneous nonexclusive latches is similarly limited. In both solutions, deletions are handled uniformly with insertions, and a logarithmic insertion-path length is maintained under all circumstances.
Index Terms:
Indexes,Latches,Silicon,Vegetation,Spatial databases,Protocols,structure modification,Multidimensional index structure,spatial index,R-tree,transaction rollback,partial rollback,restart recovery,ARIES,concurrency control
Citation:
Tuukka Haapasalo, Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen, "On the Recovery of R-Trees," IEEE Transactions on Knowledge and Data Engineering, vol. 25, no. 1, pp. 145-157, Jan. 2013, doi:10.1109/TKDE.2011.182
Usage of this product signifies your acceptance of the Terms of Use.