Structural query optimization in native XML databases: A hybrid approach

Journal of Applied Sciences

Volumn 7, Issue 20, 2007, Pages 2934-2946

  Haw, Su Cheng ^a   Lee, Chien Sing ^a  

^a MULTIMEDIA UNIVERSITY   (Malaysia)

Author keywords

Hybrid approach; Query optimization; Query processing; Twig query; XML

Indexed keywords

ELECTRONIC DATA INTERCHANGE; QUERY LANGUAGES; QUERY PROCESSING; STRUCTURAL OPTIMIZATION;

HYBRID APPROACH; LABELING SCHEME; NATIVE XML DATABASE; PATH EXPRESSIONS; QUERY OPTIMIZATION; STRUCTURAL QUERY; STRUCTURAL RELATIONSHIP; TWIG QUERIES;

XML;

EID: 36849083453     PISSN: 18125654     EISSN: 18125662     Source Type: Journal    
DOI: 10.3923/jas.2007.2934.2946     Document Type: Article

References (50)

1. Abiteboul, S., D. Quass, J. McHugh, J. Widom and J. Wiener, 1997. The lorel query language for semistructed data. J. Digital Libraries, 1: 68-88.
2. Abraham, J., N.S. Chaudhari and E.C. Prakash, 2004. XML query algebra operators and strategies for their implementation. Proc. TENCON, IEEE, pp: 286-289.
3. Al-Khalifa, S., H.V. Jagadish, N. Koudas, J.M. Patel, D. Srivastava and Y. Wu, 2002. Structural joins: A primitive for efficient XML query pattern matching. Proc. ICDE, pp: 141-152.
4. Amer-Yahia, S., S. Cho, L.V.S. Lakshmanan and D. Srivastava, 2002. Tree pattern query minimization. VLDB J., 11: 315-331.
5. Anonymous, 2002. http://www.cs.washington.edu/research/xmldatasets/.
6. Anonymous, 2004. XPath, XML path language. http://www.w3.org/TR/xpath.
7. Anonymous, 2005. XML Query (XQuery). http://www.w3.org/XML/XQuery.
8. Brantner, M., S. Helmer, C.C. Kanne and G. Moerkotte, 2005. Full-fledged algebraic XPath processing in natix. Proc. ICDE, pp: 705-716.
9. Bruno, N., D. Srivastava and N. Koudas, 2002. Holistic twig joins: Optimal XML pattern matching. Proc. ACM. SIGMOD, pp: 310-321.
10. Chen, Q., A. Lim, K. Ong and J. Tang, 2003. D(k)-index: An adaptive structural summary for graph-structured data. Proc. SIGMOD, pp: 134-144.
11. Christophides, V., S. Cluet and J. Simeon, 2000. On wrapping query languages and efficient XML integration. Proc. ACM. SIGMOD., pp: 141-152.
12. Chung, C.W., J.K. Min and K. Shim, 2002. APEX: An adaptive path index for XML data. Proc. ACM. SIGMOD, pp: 121-132.
13. Cohen, E., H. Kaplan and T. Milo, 2002. Labeling dynamic XML trees. Proc. ACM SIGMOD-SIGACT-SIGART, pp: 272-281.
14. Cooper, B.F., N. Sample, M.J. Franklin, G.R. Hjaltason and M. Shadmon, 2001. A fast index for semistructured data. Proc. VLDB, pp: 341-350.
15. Dietz, P.F., 1982. Maintaining order in a linked list. Proceeding of ACM Symposium on Theory of Computing, pp: 122-127.
16. El-Sayed, M., K. Dimitrova and E.A. Rundensteiner, 2003. Efficiently supporting order in XML query processing. Proc. ACM SIGMOD, pp: 147-154.
17. Frasincar, F., G. Houben and C. Pau, 2002. XAL: An Algebra for XML Query Optimization. Proceeding of 13th Australasian Database Conference, pp: 49-56.
18. Galanis, L., E. Viglas, D.J. DeWitt, J.F. Naughton and D. Maier, 2002. Following the paths of XML Data: An algebraic framework for XML query evaluation. Technical Report, University of Wisconsin.
19. Goldman, R. and J. Widom, 1997. Data guides: Enabling query formulation and optimization in semistructured Databases. Proc. VLDB, pp: 436-445.
20. Haw, S.C. and G.S.V.R.K. Rao, 2005. Query optimization techniques for XML databases. Int. J. Inform. Technol., 2: 97-104.
21. Haw, S.C. and G.S.V.R.K. Rao, 2007. An efficient path query processing support for parent-child relationship in native XML databases. J. Digit. Inform. Manage., 2: 82-87.
22. He, H. and J. Yang, 2004. Multiresolution indexing of XMI for frequent queries. Proc. ICDE, pp: 683-694.
23. Jagadish, H., L. Lakshmanan, D. Srivastava and K. Thompson, 2001. Tax: A tree algebra for XML. Proceeding of Database Programming Language, pp: 149-164.
24. Jiang, H., W. Wang, H. Lu and J.X. Yu, 2003. Holistic twig joins on indexed XML documents. Proc. VLDB, pp: 273-284.
25. Jiang, H., H. Lu and W. Wang, 2004. Efficient processing of twig queries with OR-predicates. In Proc. of ACM SIGMOD, pp: 59-70.
26. Jiao, E., T.W. Ling, C.Y. Chan and S. Yu, 2005. PathStack ⌉: A holistic path join algorithm for path query with not-predicates on XML data. Proc. DASFAA, pp: 113-124.
27. Josifovski, V., M. Fontoura and A. Barta, 2005. Querying XML Streams. VLDB J., 14: 197-210.
28. Kanne, C.C., M. Brantner and G. Moerkotte, 2005. Cost sensitive reordering of navigational primitives. Proceeding ACM SIGMOD, pp: 742-753.
29. Kaushik, R., D. Shenoy, P. Bohannon and E. Gudes, 2002a. Exploiting local similarity to efficiently ondex paths in graph-structured data. Proc. ICDE, pp: 129-140.
30. Kaushik, R., P. Bohannon, J.F. Naughton and H.F. Korth, 2002b. Covering indexes for branching path queries. PTOC. ACM SIGMOD, pp: 133-144.
31. Kim, J., S.H. Lee and H.J. Kim, 2004. Efficient structural joins with clusters extents. Inform. Process. Lett., 91: 69-75.
32. Kimber, W.E., 1993. HyTime and SGML: Understanding the HyTime HYQ Query Language. Technical Report Version 1.1, IBM Corporation.
33. Li, Q. and B. Moon, 2001. Indexing and Querying XML Data for Regular Path Expressions. Proc. VLDB, pp: 361-370.
34. Lu, J., T. Chen and T.W. Ling, 2004. Efficient processing of XML Twig Patterns with Parent Child Edges: A look-ahead approach. In Proc. CIKM, pp: 533-542.
35. McHugh, J. and J. Widom, 1999. Query Optimization for XML. Proc. VLDB, pp: 315-326.
36. Milo, T. and D. Suciu, 1999. Index structures for path expression. Proc. ICDT, pp: 277-295.
37. O'Neil, P., E. O'Neil, S. Pal, I. Cseri, G. Schaller and N. Westbury, 2004. ORDPATHS: Insert-friendly XML node labels. Proc. ACM SIGMOD, pp: 903-908.
38. Polyzotis, N., M. Garofalakis and Y. Ioannidis, 2004. Approximate XML query answers. Proc. SIGMOD, pp: 263-274.
39. Tatarinov, I., S. Viglas, K.S. Beyer, J. Shanmugasundaram, E.J. Shekita and C. Zhang, 2002. Storing and querying ordered XML using a relational database system. In: Proc. ACM SIGMOD, pp: 204-215.
40. Viglas, S.D., L. Galanis, D.J. DeWitt, D. Maier and J.F. Naughton, 2002. Putting XML query algebras into context. Technical Report, University of Wisconsin.
41. Weigel, F., K.U. Schulz and H. Meuss, 2005. The BIRD numbering scheme for XML and tree databases-deciding and reconstructing tree relations using efficient arithmetic operations. Lecture Notes Computer Science, 3671: 49-67.
42. Wu, X., M.L. Lee and W. Hsu, 2004. A Prime Number Labeling Scheme for Dynamic Ordered XML Tree. Proc. ICDE, pp: 66-78.
43. Wu, Y., J.M. Patel and H.V. Jagadish, 2003. Structural join order selection for XML query optimization. Proc. ICDE, pp: 443454.
44. Yao, J.T. and M. Zhang, 2004. A Fast Tree Pattern Matching Algorithm for XML Query. In: Proc. IEE/WIC/ACM, pp: 235-241.
45. Yu, T., T.W. Ling and J. Lu, 2006. TwigStackList ]: A Holistic twig join algorithm for twig query with not-predicates on XML data. In: Proc. DASFAA, pp: 249-263.
46. Zezula, P., F. Mandreoli and R. Martoglia, 2004. Tree signatures and unordered XML pattern matching. Proc. SOFSEM, pp: 122-139.
47. Zhang, D. and Y. Dong, 1999. A Data Model and Algebra for the Web. Proceeding of Workshop on Database and Expert System Application, IEEE, pp: 711-714.
48. Zhang, C., J. Naughton, D. DeWitty, Q. Luo and G. Lohman, 2001. On supporting containment queries in relational database management systems. Proc. ACM SIGMOD, pp: 425-436.
49. Zhang, N., 2006. Query processing and optimization in native XML databases. Technical Report, University of Waterloo.
50. Zheng, S., A. Zhou, JX Yu, L. Zhang and H. Tao, 2002. Structural map: A new index for efficient XML path expression processing. Proc. WAIM, pp: 25-36.