Optimistic Concurrency Control for Inverted Files in Text Databases

M. Marín (Chile)


Information Retrieval, Text Databases, Para llel Computing, Concurrency Control, BSP Computing, Synchronization Protocols.


Inverted files are frequently used as index data struc tures for very large text databases. Most applications of this data structure are for read-only query operations. However, the problem of introducing update operations has deserved little attention so far and yet it has important applications. In this paper we propose an optimistic concurrency control algorithm devised to handle mixes of update operations and read-only queries efficiently. We work on top of the BSP model of parallel computing and take advantage of a BSP Time Warp realization to formulate the proposed algorithm. We present a comparison with the traditional lock-based approach and the results show that optimism is particularly efficient in this case.

Important Links:

Go Back