Efficient Processing SAPE Queries Using the Dynamic Labelling Structural Indexes

  • Attila Kiss
  • Vu Le Anh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4152)


There are a variety of structural indexes which have been proposed to speed up path expression queries over XML data. They usually work by partitioning nodes in the data graph into equivalence classes and storing equivalence classes as index nodes. In most of current structural indexes, the nodes in the same partition have the same label. They are not flexible with queries containing the wild- or alternation cards, and sometimes their size is bigger than the necessity.

In this paper, we introduce the dynamic labelling structural indexes. These structural indexes only support a set of frequently used simple alternation path expressions (SAPE for short), where expressions may contain wild- or alternation cards. The labels of data nodes in the same partition may be different. The dynamic labelling not only decreases the size of the structural index, but also supports SAPE’s better. Every static labelling structural index can be improved by using dynamic labelling. Because of the limitation, in this paper we just study the DL-1-index improved from the 1-index, and the DL-A*(k)-index improved from the A(k)-index. The construction and refinement of these indexes are based on our results from the properties of partitions and the split operation. Our experiments show that the size of the improved dynamic labelling structural indexes is smaller and the query processing on these indexes is more efficient comparing to the naive ones.


Query Processing Data Graph Query Evaluation Data Node Index Node 
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.
    Buneman, P., Fernandez, M., Suciu, D.: UNQL: A query language and algebra for semi-structured data based on structural recursion. VLDB J. 9(1), 76–110 (2000)CrossRefGoogle Scholar
  2. 2.
    McHugh, J., Abiteboul, S., Goldman, R., Quass, D., Widom, J.: The Lorel query language for semi-structured data. International Journal on Digital Libraries, 68–88 (1997)Google Scholar
  3. 3.
    Deutsch, A., Fernandez, M., Florescu, D., Levy, A., Suciu, D.: A query language for XML. In: Proceedings of the Eights International World Wide Web Conference (WWW8), Toronto (1999)Google Scholar
  4. 4.
    Berglund, A., Boag, S., Chamberlin, D., Fernandez, M.F., Kay, M., Robie, J., Simeon, J.: XML path language (xpath) 2.0 (August 2002),
  5. 5.
    Milo, T.: Index Structures for Path Expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 277–295. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  6. 6.
    Kaushik, R., Shenoy, P., Bohannon, P., Gudes, E.: Exploiting Local Similarity for Efficient Indexing of Paths in Graph Structured Data. In: ICDE 2002 (2002)Google Scholar
  7. 7.
    Chen, Q., Lim, A., Ong, K.W.: D(K)-Index: An Adaptive structural Summary for Graph-Structured Data. In: ACM SIGMOD 2003 (June 9-12, 2003)Google Scholar
  8. 8.
    He, H., Yang, J.: Multiresolution Indexing of XML for Frequent Queries. In: Proceedings of the 20th International Conference on Data Engineering (2004)Google Scholar
  9. 9.
    Wu, H., Wang, Q., Yu, J.X., Zhou, A., Zhou, S.: UD(k,l)-index: An efficient approximate index for XML data. In: Dong, G., Tang, C., Wang, W. (eds.) WAIM 2003. LNCS, vol. 2762, pp. 68–79. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  10. 10.
    Chung, C., Min, J., Shim, K.: Apex: An adaptive path index for XML data. In: Proc. of the 2002 ACM SIGMOD Intl. Conf. on Management of Data, (June 2002)Google Scholar
  11. 11.
    Paige, R., Tarjan, R.: Three Partition Refinement Algorithms. SIAM Journal of Computing 16, 973–988 (1987)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Buneman, P., Davidson, S.B., Fernandez, M.F., Suciu, D.: Adding Structure to Unstructured Data. In: Proceedings of the 6th International Conference on Database Theory, pp. 336–350 (1997)Google Scholar
  13. 13.
    XMark: The XML benchmark project,
  14. 14.
  15. 15.
    The apache XML project - Xerces Java Parsers,
  16. 16.
    The Extended Version of this paper (extend version),

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Attila Kiss
    • 1
  • Vu Le Anh
    • 1
  1. 1.Department of Information SystemsEötvös Loránd UniversityHungary

Personalised recommendations