|Table of Contents|

A XML Multiple Branch Path Query Algorithm Based on Index(PDF)

南京师范大学学报（工程技术版）[ISSN:1006-6977/CN:61-1281/TN]

Issue:
2007年01期
Page:
63-67
Research Field:
Publishing date:

Info

Title:
A XML Multiple Branch Path Query Algorithm Based on Index
Author(s):
Ji Genlin; Xiao Yuan
School of Mathematics and Computer Science,Nanjing Normal University,Nanjing 210097,China
Keywords:
XML query;  XML index;  XM L mu ltip le branch path
PACS:
TP312.2
DOI:
-
Abstract:
XM L sing le path querym e thods and simp le branch path que ry m ethods have been presented, but how to que ry mu ltip le branch path is not so lved w e l.l This paper presents the algor ithm depthjo in for que ry ingXML mu ltiple branch pa th based on index. The algor ithm encodes the XM L docum ents and creates an index for them. It restores the sing le path o f the mu ltiple branches path using stack on the process o f m a tch ing o f the query tree, judg ing if the branch nodes have the same ancesto rs or parent by the index. Com pared w ith the ex isting a lgor ithm s, the a lgo rithm does not need jo in the sing le paths. The query effic iency is superior to the ex isting a lgor ithm s。

References:

[ 1] Kaushik R, Shenoy P, Bohannon P, et a.l Exp lo iting lo ca l s im ilar ity for e ffic ient index ing of pa ths in g raph structured data [ C] / / 10th International Conference on Da tabase Theo ry. Ca lifornia: San Jo se, 2002: 129-140.
[ 2] Chen Q, L im A, Ong K W. D( k) - index: an adaptive structural summa ry for g raph-structured data[ C] / / Proc of the 2003 ACM S IGMOD Intl Conf onM anag em ent o f Data. Ca lifornia: San D iego, 2003: 134-144.
[ 3] Chung C, M in J, Sh im K. APEX: an adaptive path index for XML da ta[ C ] / / Pro c of the 2002 ACM SIGMOD Intl Conf on M anagem ent o f Data. W isconsin: M adison, 2002: 121-132.
[ 4] M ilo T, Suciu D. Index structures for path expressions[ C] / / 7th Internationa l Con ference on DatabaseTheo ry. Israe:l Jerusalem, 1999: 277-255.
[ 5] Li Quanzhong, BongkiMoon. Index ing and query ing XML data fo r regu lar path expressions[ C ] / / Proceed ing s of the 27th VLDB Con ference. Ita ly: Rom a, 2001: 361-370.
[ 6] Roy Go ldm an, Jenn ifer W idom. DataGuide: enab ling query formu lation and optim ization in sem istructu red databases[ C ] / / Proceedings o f the 23th Interna tiona l Conference on Very Larg e Data Bases. A thens: Pages, 1997: 436-445.
[ 7] Jagad ish H V S, Koudas N. Structura l jo ins: a pr im itiv e fo r effic ient XML query patte rn m atch ing[ C ] / / H iong Ngu A H. Proceedings of the 18th IEEE ICDE International Confe rence on Data Eng ineer ing. Californ ia, 2002: 141-152.
[ 8] Ch ien S Y, Vagena Z, Zhang Donghu,i et a.l Effic ient structural jo ins on index ed XM L docum ent[ C] / / Papad ias D. Proceedings of the 28th VLDB Internationa l Con ference on Very Large Da tabase. China: H ong Kong, 2002: 263-274.
[ 9] Bruno N, Koudas N, Srivastava D. H o listic tw ig Jo ins: Optim alXML pa ttern m atch ing [ C] / / FranklinM J. Pro ceedings o f the 21th ACM S IGMOD Inte rnational Conference onM anagem ent o f Data. W isconsin: M adison, 2002: 310-321.
[ 10] Shakespea re XML da ta se ts[ DB /OL]. ftp: / / sunsite. unc. edu /pub /sun- in fo /standards/XM L/ egs/.

Memo

Memo:
-
Last Update: 2013-04-29