Publications

Hadoop Distributed File system

• Konstantin V. Shvachko.
  Apache Hadoop: the Scalability Update,
  ;login:, pp.7-13, June 2011.
• Robert Chansler, Hairong Kuang, Sanjay Radia,
  Konstantin Shvachko, and Suresh Srinivas.
  The Hadoop Distributed File System, Ch. 9, pp.121-134
  "The Architecture of Open Source Applications: Elegance, Evolution, and a Few Fearless Hacks", Amy Brown and Greg Wilson (eds.),
  ISBN 978-1-257-63801-7, 2011.
• Konstantin Shvachko, Hairong Kuang, Sanjay Radia, Robert Chansler.
  The Hadoop Distributed File System,
  In Proceedings of MSST2010, May 2010.
• K.V. Shvachko,
  Scalability of the Hadoop Distributed File System,
  YDN Blog, May, 2010.
• Konstantin V. Shvachko.
  HDFS Scalability: The limits to growth,
  ;login:, pp.6-16, April 2010.
• K.V. Shvachko, A.C. Murthy.
  Scaling Hadoop to 4000 nodes at Yahoo!
  YDN Blog, September 2008.

S-Trees

• Konstantin V. Shvachko.
  S(b)-Trees: An Optimal Balancing of Variable Length Keys.
  In Proceedings of MSV/AMCS'2004. pp.406-412, June 2004.
  slides
• Konstantin V. Shvachko.
  S(b)-Tree Library: an Efficient Way of Indexing Data.
  American Mathematical Society, External Memory Algorithms - DIMACS Series in Discrete Mathematics and Computer Science, vol. 50, pp.207-222, 1999.
• Konstantin V. Shvachko.
  Space Saving Generalization of B-Trees with 2/3 Utilization.
  Computers and Mathematics with Applications, vol.30, No.7, pp.47-66, 1995.
• Konstantin V. Shvachko.
  A Hierarchy of Weight Balanced Trees.
  In Proceedings of II International Conference on Mathematical Algorithms, N.Novgorod, Russia, 1995.
• Konstantin V. Shvachko.
  Optimal representation of dynamic dictionaries by balanced trees.
  In Proceedings of XI International Conference on Logic, Methodology, and Philosophy of Science, Obninsk, Russia, v.2, pp.181-186, 1995.
• Konstantin V. Shvachko.
  S(1)-Trees: Space Saving Generalization of B-Trees with 1/2 Utilization.
  Unpublished, 1994.
• Konstantin V. Shvachko.
  Space-Saving Modifications of B-Trees.
  In Proceedings of Symposium on Computer Systems and Applied Mathematics, St.Petersburg, Russia, p.214, 1993.
• A.P.Pinchuk, K.V.Shvachko,
  Maintaining Dictionaries: Space-Saving Modifications of B-Trees.
  In Proceedings of International Conference on Database Theory'92, Berlin. Lecture Notes in Computer Science, vol.646, pp.421-435, 1992.

Pointer Machines

• Konstantin V. Shvachko.
  Different Modifications of Pointer Machines and Their Computational Power.
  In Proceedings of MFCS'91, Warsaw, Poland, Lecture Notes in Computer Science, vol.520, pp.426-435, 1991.

Algorithmic Problems

• M.M.Gilula, A.P.Stolboushkin, G.F.Schwarz, K.V.Shvachko,
  Some algorithmic problems in the theory of relational databases.
  Voprosy Kibernetiki, v.125, pp.81-91, 1986.