Skip to main content
Article thumbnail
Location of Repository

Supporting Spatial Index Structures as Access Methods in a Database System

By Kaushik Chakrabarti

Abstract

this paper. Toevaluate the performance of the protocol, we also implemented the pure predicate locking protocol #referred to as the PL protocol# to serve as the baseline case. In PL, each search operation checks its predicate against the objects of the insert#delete#update operations of all currently executing transactions. If there is any con#ict, it blocks on that transaction by requesting an S lock on that transaction ID, assuming that every transaction acquires an X lock on its own ID when it starts up. Otherwise it proceeds with the search. Similarly, each insert #delete#update operation checks its object against the predicates of the search operations of all currently executing transactions and in case of a con#ict, blocks on the con#icting transaction

Year: 1999
OAI identifier: oai:CiteSeerX.psu:10.1.1.36.5557
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www-db.ics.uci.edu/page... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.