Index vs. Navigation in XPath Evaluation

  • Norman May
  • Matthias Brantner
  • Alexander Böhm
  • Carl-Christian Kanne
  • Guido Moerkotte
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4156)


A well-known rule of thumb claims, it is better to scan than to use an index when more than 10% of the data are accessed. This rule was formulated for relational databases. But is it still valid for XML queries? In this paper we develop similar rules of thumb for XML queries by experimentally comparing different execution strategies, e.g. using navigation or indices. These rules can be used immediately for heuristic optimization of XML queries, and in the long run, they may serve as a foundation for cost-based query optimization in XQuery.


Query Evaluation Candidate Node Structural Join XPath Query XPath Expression 
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.
    Brantner, M., Kanne, C.-C., Helmer, S., Moerkotte, G.: Full-fledged algebraic XPath processing in Natix. In: Proc. ICDE, pp. 705–716 (2005)Google Scholar
  2. 2.
    Chien, S., Vagena, Z., Zhang, D., Tsotras, V.J., Zaniolo, C.: Efficient structural joins on indexed XML documents. In: Proc. VLDB, pp. 263–274 (2002)Google Scholar
  3. 3.
    Cohen, E., Kaplan, H., Milo, T.: Labeling dynamic XML trees. In: Proc. of the ACM PODS, pp. 271–281 (2002)Google Scholar
  4. 4.
    Deutsch, A., Fernandez, M., Suciu, D.: Storing semistructured data with STORED. In: Proc. of the ACM SIGMOD, pp. 431–442 (1999)Google Scholar
  5. 5.
    Halverson, A., et al.: Mixed mode XML query processing. In: Proc. VLDB, pp. 225–236 (2003)Google Scholar
  6. 6.
    Srivastava, D., et al.: Structural joins: A primitive for efficient XML query pattern matching. In: Proc. ICDE, pp. 141–152 (2002)Google Scholar
  7. 7.
    Ozcan, F., et al.: System RX: One part relational, one part XML. In: Proc. of the ACM SIGMOD, pp. 347–358 (2005)Google Scholar
  8. 8.
    Jagadish, H., et al.: Timber: A native XML database. VLDB Journal 11(4), 274–291 (2002)MATHCrossRefGoogle Scholar
  9. 9.
    O’Neil, P.E., et al.: ORDPATHs: Insert-friendly XML node labels. In: Proc. of the ACM SIGMOD, pp. 903–908 (2004)Google Scholar
  10. 10.
    Pal, S., et al.: XQuery implementation in a relational database system. In: Proc. VLDB, pp. 1175–1186 (2005)Google Scholar
  11. 11.
    Fiebig, T., et al.: Anatomy of a native XML base management system. VLDB Journal 11(4), 292–314 (2002), Available at: MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Goldman, R., Widom, J.: DataGuides: Enabling query formulation and optimization in semistructured databases. In: Proc. VLDB, pp. 436–445 (1997)Google Scholar
  13. 13.
    Graefe, G.: Query evaluation techniques for large databases. ACM Computing Surveys 25(2), 73–170 (1993)CrossRefGoogle Scholar
  14. 14.
    Gray, J., Graefe, G.: The five-minute rule ten years later, and other computer storage rules of thumb. SIGMOD Record 26(4), 63–68 (1997)CrossRefGoogle Scholar
  15. 15.
    Grust, T.: Accelerating XPath location steps. In: Proc. of the ACM SIGMOD, pp. 109–120 (2002)Google Scholar
  16. 16.
    Grust, T., van Keulen, M., Teubner, J.: Staircase join: Teach a relational DBMS to watch its (axis) steps. In: Proc. VLDB, pp. 524–525 (2003)Google Scholar
  17. 17.
    Helmer, S., Kanne, C.-C., Moerkotte, G.: Optimized translation of XPath expressions into algebraic expressions parameterized by programs containing navigational primitives. In: Proc. of WISE, pp. 215–224 (2002)Google Scholar
  18. 18.
    Hidders, J., Michiels, P.: Avoiding unnecessary ordering operations in XPath. In: Lausen, G., Suciu, D. (eds.) DBPL 2003. LNCS, vol. 2921, pp. 54–70. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  19. 19.
    Ioannidis, Y.E., Christodoulakis, S.: On the propagation of errors in the size of join results. In: Proc. of the ACM SIGMOD, pp. 268–277 (1991)Google Scholar
  20. 20.
    Jaluta, I., Sippu, S., Soisalon-Soininen, E.: Concurrency control and recovery for balanced B-link trees. VLDB Journal 14(2), 257–277 (2005)CrossRefGoogle Scholar
  21. 21.
    Li, Q., Moon, B.: Indexing and querying XML data for regular path expressions. In: Proc. VLDB, pp. 361–370 (2001)Google Scholar
  22. 22.
    May, N., Helmer, S., Kanne, C.-C., Moerkotte, G.: XQuery Processing in Natix with an Emphasis on Join Ordering. In: < XIME − P/ >, pp. 49–54 (2004)Google Scholar
  23. 23.
    Michiels, P., Mihăilă, G.A., Siméon, J.: Put a tree pattern in your algebra. Technical report, Univ. of Antwerp, TR-06-09, Belgium (2006)Google Scholar
  24. 24.
    Ono, K., Lohman, G.: Measuring the complexity of join enumeration in query optimization. In: Proc. VLDB, pp. 314–325 (1990)Google Scholar
  25. 25.
    Pellenkoft, A., Galindo-Legaria, C., Kersten, M.: The complexity of transformation-based join enumeration. In: Proc. VLDB, pp. 306–315 (1997)Google Scholar
  26. 26.
    Polyzotis, N., Garofalakis, M.: XCluster synopses for structured XML content. In: Proc. ICDE, pp. 406–507 (2006)Google Scholar
  27. 27.
    Re, C., Simeon, J., Fernandez, M.: A complete and efficient algebraic compiler for XQuery. In: Proc. ICDE, pp. 138–149 (2006)Google Scholar
  28. 28.
    Tian, F., DeWitt, D., Chen, J., Zhang, C.: The design and performance evaluation of alternative XML storage strategies. SIGMOD Record 31(1) (2002)Google Scholar
  29. 29.
    Wu, Y., Patel, J., Jagadish, H.: Structural join order selection for XML query optimization. In: Proc. ICDE, pp. 443–454 (2003)Google Scholar
  30. 30.
    Zhang, N., Özsu, T., Aboulnaga, A., Alyas, I.F.: XSeed: Accurate and fast cardinality estimation for XPath queries. In: Proc. ICDE, pp. 168–179 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Norman May
    • 1
  • Matthias Brantner
    • 1
  • Alexander Böhm
    • 1
  • Carl-Christian Kanne
    • 1
  • Guido Moerkotte
    • 1
  1. 1.University of MannheimMannheimGermany

Personalised recommendations