Skip to main content

Advertisement

Springer Nature Link
Log in

Order Indexes: supporting highly dynamic hierarchical data in relational main-memory database systems

  • Special Issue Paper
  • Published:
The VLDB Journal Aims and scope Submit manuscript

Abstract

Maintaining and querying hierarchical data in a relational database system is an important task in many business applications. This task is especially challenging when considering dynamic use cases with a high rate of complex, possibly skewed structural updates. Labeling schemes are widely considered the indexing technique of choice for hierarchical data, and many different schemes have been proposed. However, they cannot handle dynamic use cases well due to various problems, which we investigate in this paper. We therefore propose Order Indexes—a dynamic representation of the nested intervals encoding—which offer competitive query performance, unprecedented update efficiency, and robustness for highly dynamic workloads.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27
Fig. 28
Fig. 29

Similar content being viewed by others

References

  1. Al-Khalifa, S., Agadish, H., Koudas, N., Patel, J.M., Srivastava, D., Wu, Y.: Structural joins: a primitive for efficient XML query pattern matching. In: ICDE, pp. 141–152 (2002)

  2. Amagasa, T., Yoshikawa, M., Uemura, S.: QRS: a robust numbering scheme for XML documents. In: ICDE, pp. 705–707 (2003)

  3. Berglund, A., Boag, S., Chamberlin, D., Fernández, M.F., Kay, M., Robie, J., Siméon, J.: XML Path Language (XPath) version 2.0. W3C Recommendation (2010)

  4. Boncz, P., Manegold, S., Rittinger J.: Updating the pre/post plane in MonetDB/XQuery. In: XIME-P (2005)

  5. Brunel, R., Finis, J., Franz, G., May, N., Kemper, A., Neumann, T., Faerber, F.: Supporting hierarchical data in SAP HANA. In: ICDE (2015)

  6. Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. In: SIGMOD, pp. 310–321 (2002)

  7. Cai, J., Poon, C.K.: OrdPathX: supporting two dimensions of node insertion in XML data. In: DEXA, pp. 903–908 (2009)

  8. Chawathe, S., Garcia-Molina, H.: Meaningful change detection in structured data. In: SIGMOD, pp. 26–37 (1997)

  9. Cohen, E., Kaplan, H., Milo, T.: Labeling dynamic XML trees. SIAM J. Comput. 39(5), 2048–2074 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  10. Finis, J., Brunel, R., Kemper, A., Neumann, T., Faerber, F., May, N.: DeltaNI: an efficient labeling scheme for versioned hierarchical data. In: SIGMOD, pp. 905–916 (2013)

  11. Finis, J., Brunel, R., Kemper, A., Neumann, T., May, N., Faerber, F.: Indexing highly dynamic hierarchical data. In: VLDB, pp. 986–997 (2015)

  12. Grust, T., van Keulen, M., Teubner, J.: Staircase join: teach a relational DBMS to watch its (axis) steps. In: VLDB, pp. 524–535 (2003)

  13. Halverson, A., Burger, J., Galanis, L., Kini, A., Krishnamurthy, R., Rao, A.N., Tian, F., Viglas, S., Wang, Y., Naughton, J., DeWitt, D.: Mixed mode XML query processing. In: VLDB, pp. 225–236 (2003)

  14. Haustein, M., Härder, T., Mathis, C., Wagner, M.: DeweyIDs—the key to fine-grained management of XML documents. In: SBBD, pp. 85–99 (2005)

  15. Jagadish, H., Al-Khalifa, S., Chapman, A., Lakshmanan, L., Nierman, A., Paparizos, S., Patel, J., Srivastava, D., Wiwatwattana, N., Wu, Y., Yu, C.: Timber: a native XML database. VLDB J. 11(4), 274–291 (2002)

    Article  MATH  Google Scholar 

  16. Li, C., Ling, T.W.: QED: a novel quaternary encoding to completely avoid re-labeling in XML updates. In: CIKM, pp. 501–508 (2005)

  17. Li, C., Ling, T.W., Hu, M.: Efficient processing of updates in dynamic XML data. In: ICDE (2006)

  18. Li, C., Ling, T.W., Hu, M.: Efficient updates in dynamic XML data: from binary string to quaternary string. VLDB J. 17(3), 573–601 (2008)

    Article  Google Scholar 

  19. Li, Q., Moon, B.: Indexing and querying XML data for regular path expressions. In: VLDB, pp. 361–370 (2001)

  20. Mehta, D.P., Sahni, S.: Handbook of Data structures and Applications. CRC Press, Boca Raton (2004)

    Book  MATH  Google Scholar 

  21. Min, J.-K., Lee, J., Chung, C.-W.: An efficient XML encoding and labeling method for query processing and updating on dynamic XML data. JSS 82(3), 503–515 (2009)

    Google Scholar 

  22. Neumann, T.: Efficiently compiling efficient query plans for modern hardware. In: VLDB, pp. 539–550 (2011)

  23. O’Neil, P., O’Neil, E., Pal, S., Cseri, I., Schaller, G., Westbury, N.: ORDPATHs: insert-friendly XML node labels. In: SIGMOD, pp. 903–908 (2004)

  24. SAP SE: Solutions—data management—SAP HANA Vora, Dec 2015. http://go.sap.com/germany/product/data-mgmt/hana-vora-hadoop.html

  25. Sasaki, S., Araki, T.: Modularizing B\(^+\)-trees: three-level B\(^+\)-trees work fine. In: ADMS, pp. 46–57 (2013)

  26. Silberstein, A., He, H., Yi, K., Yang, J.: BOXes: efficient maintenance of order-based labeling for dynamic XML data. In: ICDE, pp. 285–296 (2005)

  27. Tatarinov, I., Viglas, S., Beyer, K., Shanmugasundaram, J., Shekita, E., Zhang, C.: Storing and querying ordered XML using a relational database system. In: SIGMOD, pp. 204–215 (2002)

  28. Xu, L., Ling, T.W., Wu, H., Bao, Z.: DDE: From Dewey to a fully dynamic XML labeling scheme. In: SIGMOD, pp. 719–730 (2009)

  29. Yun, J.-H., Chung, C.-W.: Dynamic interval-based labeling scheme for efficient XML query and update processing. JSS 81(1), 56–70 (2008)

    Google Scholar 

  30. Zezula, P., Mandreoli, F., Martoglia, R.: Tree signatures and unordered XML pattern matching. In: SOFSEM, pp. 122–139 (2004)

  31. Zhang, C., Naughton, J., DeWitt, D., Luo, Q., Lohman, G.: On supporting containment queries in relational database management systems. In: SIGMOD, pp. 425–436 (2001)

Download references

Author information

Authors and Affiliations

  1. Technical University of Munich, Garching, Germany

    Jan Finis, Robert Brunel, Alfons Kemper & Thomas Neumann

  2. SAP SE, Walldorf, Germany

    Norman May & Franz Faerber

Authors
  1. Jan Finis
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Robert Brunel
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Alfons Kemper
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Thomas Neumann
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Norman May
    View author publications

    You can also search for this author inPubMed Google Scholar

  6. Franz Faerber
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Jan Finis.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Finis, J., Brunel, R., Kemper, A. et al. Order Indexes: supporting highly dynamic hierarchical data in relational main-memory database systems. The VLDB Journal 26, 55–80 (2017). https://doi.org/10.1007/s00778-016-0436-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-016-0436-3

Keywords