Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Bayer and M. Schlcolnick. Concurrency of operations on B-Trees. Acta Inf., 9: 1–21, 1977.
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.
W. de Jonge and A. Schiff. Concurrent access to b-trees. In Parbase, 1990. Florida.
C. S. Ellis. Concurrency in linear hashing. ACM Transcations on Database Systems, 12(2):195–217, 1987.
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.
K. Hinrichs. The grid file system: implementation and case studies of applications. PhD thesis, ETH Zurich, 1985. Doctoral Thesis Nr. 7734.
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.
P. L. Lehman and S. Yao. Efficient locking for concurrent operations on B-Tree. ACM Transcations on Database Systems, 6(4):650–670, 1981.
U. Manber and R. E. Ladner. Concurrency control in a dynamic search structure. ACM Transcations on Database Systems, 9(3):212–223, 1984.
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.
J. Nievergelt, H. Hinterberger, and K. Sevcik. The grid file: An adaptable, symmetric multikey file structure. ACM Tran-scations on Database Systems, 9(1):38–71, 1984.
J. Orenstein. Multidimensional tries used for associative searching. In Proc. 9th International Conference on Very Large Data Bases, Aug. 1983. Florence, Italy.
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.
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.
Y. Sagiv. Concurrent operations on B*-Trees with overtaking. J. Comput. Syst. Sci., 33(2):275–296, 1986.
B. Salzberg. Grid file concurrency. Inf. Syst. J., 11(3):235–244, 1986.
D. Shasha and N. Goodman. Concurrent search structure algorithms. ACM Transcations on Database Systems, 13(1): 53–90, 1988.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag/Wien
About this paper
Cite this paper
Aris Ouksel, M., Ghazal, A., Mayer, O. (1992). Concurrency Control in the Interpolation-Based Grid File. In: Tjoa, A., Ramos, I. (eds) Database and Expert Systems Applications. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7557-6_41
Download citation
DOI: https://doi.org/10.1007/978-3-7091-7557-6_41
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82400-9
Online ISBN: 978-3-7091-7557-6
eBook Packages: Springer Book Archive