Chakrabarti, K. & Mehrotra, S. (1997), "Approaches to concurrency control in R-trees", Technical Report, Department of Computer Science, University of Illinois, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Concurrency Control in R-trees - Chakrabarti, Mehrotra (1997) Self-citation (Chakrabarti Mehrotra) (Correct)
....locks on the new lock R tree. We next present the locking protocols followed by the transactions to insert an object and to scan a region in an R tree. Algorithms for UpdateScan, Read Single, Update Single and Delete operations are not presented due to space restrictions and can be found in (Chakrabarti and Mehrotra, 1997). The locking protocol for this approach requires an inserter to acquire IX locks on a minimal set of granules just sufficient to fully cover the object (followed by an X lock on the object itself) and a searcher to acquire S locks on all granules that overlap with the predicate being scanned. ....
....approach since lockable granules may dynamically grow and shrink due to insertions and deletions, the algorithms for insertion, readscan, updatescan and deletion operations become significantly more complex. We have not presented those algorithms here due to space limitations but can be found in (Chakrabarti and Mehrotra, 1997). ....
Chakrabarti, K. & Mehrotra, S. (1997), "Approaches to concurrency control in R-trees", Technical Report, Department of Computer Science, University of Illinois, 1997.
Concurrency Control in R-trees - Chakrabarti, Mehrotra (1997) Self-citation (Chakrabarti Mehrotra) (Correct)
....locks on the new lock R tree. We next present the locking protocols followed by the transactions to insert an object and to scan a region in an R tree. Algorithms for UpdateScan, Read Single, Update Single and Delete operations are not presented due to space restrictions and can be found in #Chakrabarti and Mehrotra, 1997#. The locking protocol for this approach requires an inserter to acquire IX locks on a minimal set of granules just su#cient to fully cover the object #followed byanXlock on the object itself# and a searcher to acquire S locks on all granules that overlap with the predicate being scanned. This ....
....approach since lockable granules may dynamically grow and shrink due to insertions and deletions, the algorithms for insertion, readscan, updatescan and deletion operations become signi#cantly more complex. Wehave not presented those algorithms here due to space limitations but can be found in #Chakrabarti and Mehrotra, 1997#. ....
Chakrabarti, K. & Mehrotra, S. #1997#, #Approaches to concurrency control in R-trees", Technical Report, Department of Computer Science, University of Illinois, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC