• DocumentCode
    2064271
  • Title

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

  • Author

    Chen, Cui ; Liao, Husheng ; Su, Hang

  • Author_Institution
    Coll. of Comput. Sci., Beijing Univ. of Technol., Beijing, China
  • fYear
    2010
  • fDate
    10-12 Aug. 2010
  • Firstpage
    392
  • Lastpage
    396
  • 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 Twig2Stack. 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.
  • Keywords
    Internet; XML; pattern matching; query processing; trees (mathematics); Internet; TwigList-By-PDT; XML document tree; XML query processing; XML schema; extensible markup language; information exchange; information representation; query matching; twig pattern matching; twig query algorithm; Algorithm design and analysis; Complexity theory; Optimization; Pattern matching; Pediatrics; Query processing; XML; Optimization; Twig query; XML; XML Schema;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Distributed Computing and Applications to Business Engineering and Science (DCABES), 2010 Ninth International Symposium on
  • Conference_Location
    Hong Kong
  • Print_ISBN
    978-1-4244-7539-1
  • Type

    conf

  • DOI
    10.1109/DCABES.2010.85
  • Filename
    5571630