Minimal Query Algorithm of XML Document Based on Unconstrained Tree Pattern

Article Preview

Abstract:

XML document structure uses the tree structure to express the document structure model that is different from the traditional two-dimensional relational table structure and XML query patterns mainly for tree query. Tree pattern always divided into constrained type and unconstrained type. This paper based on unconstrained tree pattern query, provide a mini algorithm of unconstrained tree pattern query, and prove the correctness of algorithm theoretically.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 430-432)

Pages:

1677-1681

Citation:

Online since:

January 2012

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] WangChangxuan.Technology of Native XML Database [M].BeiJing:TsingHua University Press,2005:202-204.

Google Scholar

[2] AMERYAHIS S, CHO S, LAKSHM ANNAN LV, SRIVASTAVAD.Minimization of Tree PaRern Queries[C].Proc.of the SIGMOD 2001 Electronic,Santa Barbara:ACM Press,Aref WG,2001.497-508.

Google Scholar

[3] LuoDaofeng, JiangYu, MengXiaofeng.OrientXA:An efficient XQuery Algebra [J].Journal of Software,2004,15(11):1648-1660.

Google Scholar