Concurrency Control in the Interpolation-Based Grid File
The problem of supporting concurrent operations in Interpolation-Based Grid Files is studied. A systematic method for detecting conflict between processes is defined based on the organizational properties of this type of files. One important characteristic of these structures is the dynamic partitioning of the data space into regions and assignment of a unique identifier to each region. This identifier acts then as a surrogate for the region and its spatial properties. High process throughput is achieved by optimizing the number of locked regions. We show that only one or two locks are required in general and the probability that three locks become necessary is negligible. Algorithms to search for, to insert and delete data elements are presented and shown to be correct, deadlock free, and non-preemptive based on the restrictions imposed on the locking order and the reachability mechanism. Furthermore, we present a compression procedure that provides storage maintenance of the data structure. In our scheme, all processes readers, inserters, deleters and compressors can overtake each other.
KeywordsDatabase System Data Space Physical Address Garbage Collector Split Operation
Unable to display preview. Download preview PDF.
- W. Burkhard. Interpolation-based index maintenance. In Proc. 2nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 76-85, 1983. Atlanta, Ga.Google Scholar
- W. de Jonge and A. Schiff. Concurrent access to b-trees. In Parbase, 1990. Florida.Google Scholar
- M. Freeston. The bang file: A new kind of grid file. In PROC. ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, pages 260-269, 1987.Google Scholar
- K. Hinrichs. The grid file system: implementation and case studies of applications. PhD thesis, ETH Zurich, 1985. Doctoral Thesis Nr. 7734.Google Scholar
- T. Johnson and D. Shasha. Utilization of b-trees with inserts, deletes and searches. In Proc. 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. Atlantic City, NJ, Mar 89.Google Scholar
- C. Mohan and F. Levine. Aries/im: An efficient and high concurrency index management method using write-ahead logging. Technical report, IBM Almaden Research Center, 1989. IBM Research Report RJ6846.Google Scholar
- J. Orenstein. Multidimensional tries used for associative searching. In Proc. 9th International Conference on Very Large Data Bases, Aug. 1983. Florence, Italy.Google Scholar
- M. Ouksel and O. Mayer. The interpolation-based grid file revisited: A theoretical and an empirical evaluation. Technical report, The University of Illinois at Chicago, 1990.Google Scholar
- M. A. Ouksel. The interpolation-based grid file. In Proc. 4th ACMSIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 20-27, Mar. 1985. Portland, OR.Google Scholar
- V. Srinivasan and M. J. Carey. Performance of b-tree concurrency control algorithms. In PROC. ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 1991. Denver.Google Scholar