Concurrency Control in the Interpolation-Based Grid File

  • M. Aris Ouksel
  • A. Ghazal
  • Otto Mayer
Conference paper


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.


Database System Data Space Physical Address Garbage Collector Split Operation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R. Bayer and M. Schlcolnick. Concurrency of operations on B-Trees. Acta Inf., 9: 1–21, 1977.MATHCrossRefGoogle Scholar
  2. [2]
    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
  3. [3]
    W. de Jonge and A. Schiff. Concurrent access to b-trees. In Parbase, 1990. Florida.Google Scholar
  4. [4]
    C. S. Ellis. Concurrency in linear hashing. ACM Transcations on Database Systems, 12(2):195–217, 1987.CrossRefGoogle Scholar
  5. [5]
    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
  6. [6]
    K. Hinrichs. The grid file system: implementation and case studies of applications. PhD thesis, ETH Zurich, 1985. Doctoral Thesis Nr. 7734.Google Scholar
  7. [7]
    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
  8. [8]
    P. L. Lehman and S. Yao. Efficient locking for concurrent operations on B-Tree. ACM Transcations on Database Systems, 6(4):650–670, 1981.MATHCrossRefGoogle Scholar
  9. [9]
    U. Manber and R. E. Ladner. Concurrency control in a dynamic search structure. ACM Transcations on Database Systems, 9(3):212–223, 1984.MathSciNetGoogle Scholar
  10. [10]
    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
  11. [11]
    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.CrossRefGoogle Scholar
  12. [12]
    J. Orenstein. Multidimensional tries used for associative searching. In Proc. 9th International Conference on Very Large Data Bases, Aug. 1983. Florence, Italy.Google Scholar
  13. [13]
    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
  14. [14]
    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
  15. [15]
    Y. Sagiv. Concurrent operations on B*-Trees with overtaking. J. Comput. Syst. Sci., 33(2):275–296, 1986.MathSciNetMATHCrossRefGoogle Scholar
  16. [16]
    B. Salzberg. Grid file concurrency. Inf. Syst. J., 11(3):235–244, 1986.MathSciNetCrossRefGoogle Scholar
  17. [17]
    D. Shasha and N. Goodman. Concurrent search structure algorithms. ACM Transcations on Database Systems, 13(1): 53–90, 1988.MATHCrossRefGoogle Scholar
  18. [18]
    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

Copyright information

© Springer-Verlag/Wien 1992

Authors and Affiliations

  • M. Aris Ouksel
    • 1
  • A. Ghazal
    • 1
  • Otto Mayer
    • 2
  1. 1.Dept. of Information and Decision Sciences(M/C 294)The University of Illinois at ChicagoChicagoUSA
  2. 2.Dept of Computer ScienceKaiserslautern UniversityKaiserslauternWest Germany

Personalised recommendations