A methodology for coupling fragments of XPath with structural indexes for XML documents

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4797 LNCS, Issue , 2007, Pages 48-65

  Fletcher, George H L ^a   Van Gucht, Dirk ^b   Wu, Yuqing ^b   Gyssens, Marc ^c   Brenes, Sofía ^b   Paredaens, Jan ^d  

^a WASHINGTON STATE UNIVERSITY   (United States)

^b INDIANA UNIVERSITY   (United States)

^c HASSELT UNIVERSITY   (Belgium)

^d UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38449088515     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75987-4_4     Document Type: Conference Paper

References (18)

1. Al-Khalifa, S., et al.: Structural joins: A primitive for efficient XML query pattern matching. In: ICDE (2002)
2. Bruno, N., et al.: Holistic twig joins: optimal XML pattern matching. In: SIGMOD (2002)
3. Clark, J., DeRose, S. (eds.): XML path language (XPath) version 1.0. http://www.w3.org/TR/XPATH
4. Comer, D.: The Ubiquitous B-Tree. ACM Comput. Surv. 11(2), 121-137 (1979)
5. Goldman, R., Widom, J.: Dataguides: Enabling query formulation and optimization in semistructured databases. In: VLDB, pp. 436-445 (1997)
6. Gottlob, G., Koch, C., Pichler, R.: Efficient Algorithms for Processing XPath Queries. ACM Trans. Database Syst. 30(2), 444-491 (2005)
7. Gyssens, M., et al: Structural Characterizations of the Semantics of XPath as Navigation Tool on a Document. In: ACM PODS, pp. 318-327. ACM Press, New York (2006)
8. He, H., Yang, J.: Multiresolution indexing of XML for frequent queries. In: IEEE ICDE, IEEE Computer Society Press, Los Alamitos (2004)
9. Kaushik, R., et al.: Covering indexes for branching path queries. In: SIGMOD (2002) [10] Kaushik, R., et al.: Exploiting local similarity for efficient indexing of paths in graph structured data. In: IEEE ICDE, IEEE Computer Society Press, Los Alamitos (2002)
10. Kaushik, R., et al.: On the integration of structure indexes and inverted lists. In: ACM SIGMOD, ACM Press, New York (2004)
11. Koch, C.: Processing queries on tree-structured data efficiently. In: ACM PODS, pp. 213-224. ACM Press, New York (2006)
12. Milo, T., Suciu, D.: Index structures for path expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 277-295. Springer, Heidelberg (1998)
13. Moro, M.M., et al.: Tree-pattern queries on a lightweight XML processor. In: VLDB (2005)
14. Qun, C., Lim, A., Ong, K.W.: D(k)-index: An adaptive structural summary for graph-structured data. In: SIGMOD (2003)
15. Ramanan, P.: Covering indexes for XML queries: Bisimulation - simulation = negation. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) Databases, Information Systems, and Peer-to-Peer Computing. LNCS, vol. 2944, Springer, Heidelberg (2004)
16. Runapongsa, K., Patel, J.M., Bordawekar, R., Padmanabhan, S.: XIST: An XML index selection tool. In: Bellahsène, Z., Milo, T., Rys, M., Suciu, D., Unland, R. (eds.) XSym 2004. LNCS, vol. 3186, pp. 219-234. Springer, Heidelberg (2004)
17. Yi, K., He, H., Stanoi, I., Yang, J.: Incremental maintenence of XML structural indexes. In: ACM SIGMOD, pp. 491-502. ACM Press, New York (2004)
18. Zhang, C., et al.: On supporting containment queries in relational database management systems. In: SIGMOD (2001)