Husheng Liao

Publications (4)0 Total impact

• Conference Proceeding: TwigList-By-PDT: A Twig Query Algorithm Based on XML Schema

  Cui Chen, Husheng Liao, Hang Su
  [show abstract] [hide abstract]
  ABSTRACT: Extensible Markup Language (XML) has become a de facto standard for information representation and exchange over the Internet. The core operation of XML Query processing is twig pattern matching. TwigList uses simple lists to maintain the twig pattern instead of using the hierarchical-stacks, the algorithm outperforms Twig²Stack. Most of the modern twig query algorithms must scan the whole XML document tree to conduct the query matching. However, useless path matches increase query processing time. Existing approaches do not consider the fact in practice. In this paper, we propose a novel Twig query algorithm based on TwigList. The algorithm makes good use of XML Schema, avoids scanning the entire XML document and effectively improves the twig query performance.
  Distributed Computing and Applications to Business Engineering and Science (DCABES), 2010 Ninth International Symposium on; 09/2010
• Conference Proceeding: A Two-Phase Binding-Time Analysis in Partial Evaluation for XQuery.

  Hang Su, Husheng Liao
  CSIE 2009, 2009 WRI World Congress on Computer Science and Information Engineering, March 31 - April 2, 2009, Los Angeles, California, USA, 7 Volumes; 01/2009
• Article: Reference-Sensitivity Analysis in Partial Evaluation for XQuery

  Hang Su, Husheng Liao
  [show abstract] [hide abstract]
  ABSTRACT: In the partial evaluation for XQuery, the reconstruction for XML document segment is used to represent the result of the constant folding for the value of a node expression. But the representation of the result do lost some semantic information of the value, such as the relative position of a node in an XML document. Unfortunately, there are some special expressions that work out their values by using the semantic information in XQuery. A wrong residual program will be produced by the partial evaluator when reconstructs the values of the expressions which participate in the computing of those special expressions. And it will result in a low efficient partial evaluation if constant folding is arbitrarily prohibited. To avoid the mistake and achieve an effective partial evaluation for XQuery, a novel method, called reference-sensitivity analysis, is proposed in this thesis, which can be used to distinguish the node expression whose value can not be reconstructed for doing constant folding from others.
  Software Engineering, World Congress on. 3:82-89.
• Conference Proceeding: XQPE: A Partial Evaluation System for XQuery

  Hang Su, Husheng Liao
  [show abstract] [hide abstract]
  ABSTRACT: Partial evaluation is an automatic approach to customize a program with respect to configuration values and invariants of the program itself. XQuery is a new query language for querying XML data source. In this paper, we present a partial evaluation system for the XQuery language named XQPE. XQPE is an off-line partial evaluation system; it offers specialization at compile time, and program specialization. The partial evaluation process of XQPE can be divided into two phases: one is analysis phase, and the other is specialization phase. Our XQPE has been implemented in Java, and the results of experiments show that the speedups of XQuery residual programs we have obtained are good.
  Computer Software and Applications, 2008. COMPSAC '08. 32nd Annual IEEE International;