Path-partitioned Encoding Optimizes Twig Queries

Effectively storing and querying XML documents becomes a hot research topic on current database domain.In the light of path summary,path-partitioned encoding scheme was proposed to store an XML document,and useful for eliminating descendant axes and wildcards in twig queries.For twig queries without // or *,a new query algorithm was developed based on structure-constrained nodes,so structural joins extremely decreases.The results of experi-ments indicate the algorithm can significantly filter useless elements and improve the performance for twig queries.