Advertisement

Multiversion Concurrency Control for Multidimensional Index Structures

  • Walter Binder
  • Samuel Spycher
  • Ion Constantinescu
  • Boi Faltings
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4653)

Abstract

Prevailing concurrency control mechanisms for multidimensional index structures, such as the Generalized Search Tree (GiST), are based on locking techniques. These approaches may cause significant overhead in settings where the indexed data is rarely updated and read access is highly concurrent. In this paper we present the Multiversion-GiST (MVGiST), which extends the GiST with Multiversion Concurrency Control. Beyond enabling lock-free read access, our approach provides readers a consistent view of the whole index structure, which is achieved through the creation of lightweight, read-only versions of the GiST that share unchanging nodes amongst themselves. Our evaluation confirms that for low update rates, the MVGiST significantly improves scalability w.r.t. the number of concurrent accesses when compared to a traditional, locking-based concurrency control mechanism.

Keywords

Child Node Index Structure Concurrency Control Read Operation Read Session 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chaudhuri, S., Dayal, U.: An overview of data warehousing and olap technology. SIGMOD Rec. 26(1), 65–74 (1997)CrossRefGoogle Scholar
  2. 2.
    Bernstein, P.A., Goodman, N.: Multiversion concurrency control – theory and algorithms. TODS 8(4), 465–483 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Hellerstein, J.M., Naughton, J.F., Pfeffer, A.: Generalized search trees for database systems. In: Dayal, U., Gray, P.M.D., Nishio, S. (eds.) Proc. 21st Int. Conf. Very Large Data Bases, VLDB, pp. 562–573. Morgan Kaufmann, San Francisco (1995)Google Scholar
  4. 4.
    Binder, W., Spycher, S., Constantinescu, I., Faltings, B.: An evaluation of multiversion concurrency control for web service directories. In: 2007 IEEE International Conference on Web Services (ICWS-2007), Salt Lake City (2007)Google Scholar
  5. 5.
    Kornacker, M., Mohan, C., Hellerstein, J.M.: Concurrency and recovery in generalized search trees. In: Peckman, J.M. (ed.) Proceedings, ACM SIGMOD International Conference on Management of Data: SIGMOD 1997. May 13–15, 1997, Tucson, Arizona, pp. 13–15. USA (1997)Google Scholar
  6. 6.
    Kanth, K., Serena, D., Singh, A.: Improved concurrency control techniques for multi-dimensional index structures. In: IPPS 1998: Proceedings of the 12th. International Parallel Processing Symposium, pp. 580–586. IEEE Computer Society, Washington (1998)Google Scholar
  7. 7.
    Chakrabarti, K., Mehrotra, S.: Efficient concurrency control in multidimensional access methods. In: SIGMOD 1999: Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data, pp. 25–36. ACM Press, New York (1999)CrossRefGoogle Scholar
  8. 8.
    Song, S.I., Kim, Y.H., Yoo, J.S.: An enhanced concurrency control scheme for multidimensional index structures. IEEE Transactions on Knowledge and Data Engineering 16(1), 97–111 (2004)CrossRefMathSciNetGoogle Scholar
  9. 9.
    American National Standards Institute: ANSI X3.135-1992: Information Systems – Database Language – SQL (1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Walter Binder
    • 1
  • Samuel Spycher
    • 2
  • Ion Constantinescu
    • 2
  • Boi Faltings
    • 2
  1. 1.University of Lugano, CH–6900 LuganoSwitzerland
  2. 2.Ecole Polytechnique Fédérale de Lausanne (EPFL), CH–1015 LausanneSwitzerland

Personalised recommendations