Skip to main content
SpringerLink
Log in

Database Index Debug Techniques: A Case Study

  • Conference paper
  • First Online:
Beyond Databases, Architectures and Structures. Advanced Technologies for Data Mining and Knowledge Discovery (BDAS 2015, BDAS 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 613))

Abstract

The index corruption may lead to serious problems ranging from the temporary system outage to the loss of sensitive data. In this article we discuss the techniques that we found helpful in assuring the data index consistency during the development of specific indexing algorithms for a multidimensional BI system featuring both OLAP and OLTP aspects. The use of the techniques described in this article from the very beginning of the project development helped to save sufficient resources during the development and debugging.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aksyonov, K., Bykov, E., Aksyonova, O., Antonova, A.: Development of real-time simulation models: integration with enterprise information systems. In: Proceedings of ICCGI, pp. 45–50 (2014)

    Google Scholar 

  2. Bayer, R.: Symmetric binary B-trees: data structure and maintenance algorithms. Acta informatica 1(4), 290–306 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  3. Beck, K.: Test-Driven Development: by Example. Addison-Wesley Professional, Boston (2003)

    Google Scholar 

  4. Becker, B., Gschwind, S., Ohler, T., Seeger, B., Widmayer, P.: An asymptotically optimal multiversion B-tree. VLDB J. Int. J. Very Large Data Bases 5(4), 264–275 (1996)

    Article  Google Scholar 

  5. Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles, vol. 19, no. 2. ACM (1990)

    Google Scholar 

  6. Bloch, J.: Extra, extra-read all about it: nearly all binary searches and mergesorts are broken. Official Google Research Blog Date. Accessed 2 June 2006

    Google Scholar 

  7. Borodin, A.M., Mirvoda, S.G., Porshnev, S.V.: High dimensional data analysis: data access problems and possible solutions. St. Petersburg State Polytechnical University J. Comput. Sci. Telecommun. Control Syst. 6, 59–66 (2013)

    Google Scholar 

  8. Borodin, A.: [proposal] improvement of gist page layout. http://www.postgresql.org/message-id/CAJEAwVE0rrr+OBT-P0gDCtXbVDkBBG_WcXwCBK=GHo4fewu3Yg@mail.gmail.com

  9. Borodin, A., Kiselev, Y., Mirvoda, S., Porshnev, S.: On design of domain-specific query language for the metallurgical industry. In: BeyondDatabases, Architectures and Structures, pp. 505–515. Springer (2015)

    Google Scholar 

  10. Codd, E.F.: The Relational Model for Database Management: Version 2. Addison-Wesley Longman Publishing Co. Inc, Boston (1990)

    MATH  Google Scholar 

  11. Codd, E.F., Codd, S.B., Salley, C.T.: Providing OLAP (On-Line Analytical Processing) to User-Analysts: an it Mandate, vol. 32. Codd and Date, Reading (1993)

    Google Scholar 

  12. Gaede, V., Günther, O.: Multidimensional access methods. ACM Comput. Surv. (CSUR) 30(2), 170–231 (1998)

    Article  Google Scholar 

  13. Garcia-Molina, H., Ullman, J.D., Widom, J.: Database System Implementation, vol. 654. Prentice Hall, Upper Saddle River (2000)

    Google Scholar 

  14. Kamp, P.H.: The most expensive one-byte mistake. Commun. ACM 54(9), 42–44 (2011)

    Article  Google Scholar 

  15. Korotkov, A.: Fast gist index build. https://wiki.postgresql.org/images/0/07/Fast_GiST_index_build.pdf

  16. Korotkov, A.: A new double sorting-based node splitting algorithm for r-tree. In: Proceedings of Spring/Summer Young Researchers Colloquium Software Engineering, vol. 5 (2011)

    Google Scholar 

  17. Korotkov, A., at al.: Next generation of gin. http://www.sai.msu.su/~megera/postgres/talks/Next20GIN.pdf

  18. LeBlanc, T.J., Mellor-Crummey, J.M.: Debugging parallel programs with instant replay. IEEE Trans. Comput. 100(4), 471–482 (1987)

    Article  Google Scholar 

  19. Leray, J.: Effects of atmospheric neutrons on devices, at sea level and in avionics embedded systems. Microelectron. Reliab. 47(9), 1827–1835 (2007)

    Article  Google Scholar 

  20. Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A.N., Theodoridis, Y.: R-trees: Theory and Applications. Springer Science Business Media, Berlin (2010)

    MATH  Google Scholar 

  21. Mrozek, D., Małysiak-Mrozek, B., Mikołajczyk, J., Kozielski, S.: Database under pressure - testing performance of database systems using universal multi-agent platform. In: Gruca, A., Czachórski, T., Kozielski, S. (eds.) Man-Machine Interactions 3. AISC, vol. 242, pp. 637–648. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  22. Rahman, M.: CLR memory model. C# Deconstructed, pp. 61–86. Springer, Heidelberg (2014)

    Google Scholar 

  23. Shapiro, E.Y.: Algorithmic Program Debugging. MIT Press, Cambridge (1983)

    MATH  Google Scholar 

  24. Smirnov, K., Chernishev, G., Fedotovsky, P., Erokhin, G., Cherednik, K.: R-tree re-evaluation effort: a report. Technical report (2014)

    Google Scholar 

  25. Zeller, A.: Why Programs Fail: a Guide to Systematic Debugging. Elsevier, Philadelphia (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Radio Electronics for Information Systems, Ural Federal University, Yekaterinburg, Russia

    Andrey Borodin, Sergey Mirvoda & Sergey Porshnev

Authors
  1. Andrey Borodin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergey Mirvoda
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sergey Porshnev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrey Borodin .

Editor information

Editors and Affiliations

  1. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Stanisław Kozielski

  2. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Dariusz Mrozek

  3. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Paweł Kasprowski

  4. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Bożena Małysiak-Mrozek

  5. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Daniel Kostrzewa

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Borodin, A., Mirvoda, S., Porshnev, S. (2016). Database Index Debug Techniques: A Case Study. In: Kozielski, S., Mrozek, D., Kasprowski, P., Małysiak-Mrozek, B., Kostrzewa, D. (eds) Beyond Databases, Architectures and Structures. Advanced Technologies for Data Mining and Knowledge Discovery. BDAS BDAS 2015 2016. Communications in Computer and Information Science, vol 613. Springer, Cham. https://doi.org/10.1007/978-3-319-34099-9_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-34099-9_50

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-34098-2

  • Online ISBN: 978-3-319-34099-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation