期刊文献+

Path-partitioned encoding supports wildcard-awareness twig queries

Path-partitioned encoding supports wildcard-awareness twig queries
下载PDF
导出
摘要 Finding all occurrences of a twig query in an XML database is a core operation for efficient evaluation of XML queries. It is important to effiectively handle twig queries with wildcards. In this paper, a novel path-partitioned encoding scheme is proposed for XML documents to capture paths of all elements, and a twig query is modeled as an XPattern extended from tree pattern. After definition, simplification, normalization, verification and initialization of the XPattern, both work sets and a join plan are generated. According to these measures, an effiective algorithm to answer for a twig query, called DMTwig, is designed without unnecessary elements and invalid structural joins. The algorithm can adaptively deal with twig queries with branch ([ ]), child edge (/), descendant edge (//), and wildcard (*) synthetically. We show that path-partitioned encoding scheme and XPattern guarantee the I/O and CPU optimality for twig queries. Experiments on representative data set indicate that the proposed solution performs significantly. Finding all occurrences of a twig query in an XML database is a core operation for efficient evaluation of XML queries. It is important to effiectively handle twig queries with wildcards. In this paper, a novel path-partitioned encoding scheme is proposed for XML documents to capture paths of all elements, and a twig query is modeled as an XPattern extended from tree pattern. After definition, simplification, normalization, verification and initialization of the XPattern, both work sets and a join plan are generated. According to these measures, an effiective algorithm to answer for a twig query, called DMTwig, is designed without unnecessary elements and invalid structural joins. The algorithm can adaptively deal with twig queries with branch ([ ]), child edge (/), descendant edge (//), and wildcard (*) synthetically. We show that path-partitioned encoding scheme and XPattern guarantee the I/O and CPU optimality for twig queries. Experiments on representative data set indicate that the proposed solution performs significantly.
出处 《Journal of Shanghai University(English Edition)》 2009年第5期363-374,共12页 上海大学学报(英文版)
基金 supported by the National High-Tech Research and Development Plan of China (Grant No.2005AA4Z3030)
关键词 XML tree pattern structural join encoding scheme twig query XML, tree pattern, structural join, encoding scheme, twig query
  • 相关文献

参考文献10

  • 1Bruno N,,Koudas N,Srivastava D.Holistic twig joins:Optimal XML pattern matching[].Proceed-ings of theACM SIGMOD International Con-ference on Management of Data.2002
  • 2Wu X,Lee M,Hsu W.A prime number labeling scheme for dynamic ordered XML trees[].Proceed-ings of theth International Conference on Data En-gineering.2004
  • 3Chen T,Lu J H,Ling T W.On boosting holism in XML twig pattern matching using structural in-dexing techniques[].Proceedings of theACM SIGMOD International Conference on Management of Data.2005
  • 4Lu J H,Ling T W,Chan C Y,Chen T.From re-gion encoding to extended dewey:On e-cient process-ing of XML twig pattern matching[].Proceedings of thest International Conference on Very Large Data Bases.2005
  • 5Hockenmaier J,Steedman M.CCGbank:A cor-pus of CCG derivations and dependency structures ex-tracted from the penn treebank[].Computational Lin-guistics.2007
  • 6Wood P T.Minimizing simple XPath expressions[].Proceedings of theth International Workshop on the Web and Databases(WebDB).2001
  • 7Amer-Yahis S,Cho S,Lakshmanan L V,Srivas-tava D.Minimization of tree pattern queries[].Pro-ceedings of theACM SIGMOD International Con-ference on Management of Data.2001
  • 8Lu H,Chen T,Ling T W.E-cient processing of XML twig patterns with parent child edges:A look-ahead approach[].Proceedings of CIKM Confer-ence.2004
  • 9Chen S T,Li H G,Tatemura J,Hsiung W P,Agrawal D,Selc-uk C K.Twig2 Stack:Bottomup processing of generalized tree pattern queries over XML documents[].Proceedings of thend International Conference on Very Large Data Bases.2006
  • 10Tatarinov I,Viglas S,Beyer K S,Shanmugasun-daram J,Shekita E J,Zhang C.Storing and query-ing ordered XML using a relational database system[].Proceedings of theACM SIGMOD Interna-tional Conference on Management of Data.2002

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部