An Adaptive Index of XML for Frequent Branching Path Queries

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Yingjie Fan Articles by Chenghong Zhang Articles by Shuyun Wang Articles by Xiulan Hao Articles by Yunfa Hu

Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008)

May 14-May 16

ISBN: 978-0-7695-3131-1

	ASCII Text	x
	Yingjie Fan, Chenghong Zhang, Shuyun Wang, Xiulan Hao, Yunfa Hu, "An Adaptive Index of XML for Frequent Branching Path Queries," Computer and Information Science, ACIS International Conference on, pp. 269-275, Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008), 2008.

	BibTex	x
	@article{ 10.1109/ICIS.2008.47, author = {Yingjie Fan and Chenghong Zhang and Shuyun Wang and Xiulan Hao and Yunfa Hu}, title = {An Adaptive Index of XML for Frequent Branching Path Queries}, journal ={Computer and Information Science, ACIS International Conference on}, volume = {0}, year = {2008}, isbn = {978-0-7695-3131-1}, pages = {269-275}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICIS.2008.47}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computer and Information Science, ACIS International Conference on TI - An Adaptive Index of XML for Frequent Branching Path Queries SN - 978-0-7695-3131-1 SP269 EP275 A1 - Yingjie Fan, A1 - Chenghong Zhang, A1 - Shuyun Wang, A1 - Xiulan Hao, A1 - Yunfa Hu, PY - 2008 KW - XML KW - Structural summary KW - Branching path query KW - Over-refinement KW - k-l-bisimilarity VL - 0 JA - Computer and Information Science, ACIS International Conference on ER -

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICIS.2008.47

Structural index, which acts as a structural summary, plays an important role in query optimization over XML and semi-structured data. To speed up branching path queries, we introduce the notion of k-l-bisimilarity into M(k)-index and propose an adaptive structural index, MBF(k, l)-index, which supports branching paths with any complexity efficiently and inherits the advantage of avoiding over-refinement from M(k)-index. Our experiments have shown that the index performs more efficiently in terms of space consumption and query performance for branching or simple paths in comparison with the same kind of indexes.

Index Terms:

XML, Structural summary, Branching path query, Over-refinement, k-l-bisimilarity

Citation:

Yingjie Fan, Chenghong Zhang, Shuyun Wang, Xiulan Hao, Yunfa Hu, "An Adaptive Index of XML for Frequent Branching Path Queries," icis, pp.269-275, Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008), 2008

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.