Skip to main navigation Skip to search Skip to main content

Query optimization for complex path Queries on XML data

  • Harbin Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

With the proliferation of XML data and applications on the Internet, efficiently XML query processing techniques are in great demand. Many path queries on XML data have complex structure with both structural and value constraints. Existing query processing techniques can only process some part of such queries efficiently. In this paper, a query optimization strategy for complex path queries is presented. Such strategy combines index on values, structural index and join on labeling scheme and generates effective query plan for complex queries. Experimental results show that the optimization strategy is efficient and effective; our method is suitable for various path queries with value constraints and our method scales up for large data size with good query performance.

Original languageEnglish
Title of host publicationDatabase Systems for Advanced Applications - 14th International Conference, DASFAA 2009, Proceedings
Pages389-404
Number of pages16
DOIs
StatePublished - 2009
Event14th International Conference on Database Systems for Advanced Applications, DASFAA 2009 - Brisbane, QLD, Australia
Duration: 21 Apr 200923 Apr 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5463
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Conference on Database Systems for Advanced Applications, DASFAA 2009
Country/TerritoryAustralia
CityBrisbane, QLD
Period21/04/0923/04/09

Keywords

  • Path query
  • Query optimization
  • XML

Fingerprint

Dive into the research topics of 'Query optimization for complex path Queries on XML data'. Together they form a unique fingerprint.

Cite this