Twig pattern matching: A revisit

Li, J; Wang, J; Huang, M

Twig pattern matching: A revisit

Li, J Wang, J Huang, M

Permalink

Publication Type:: Conference Proceeding
Citation:: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011, 6861 LNCS (PART 2), pp. 43 - 50
Issue Date:: 2011-09-20

Closed Access

	Filename	Description	Size
	2011001180OK.pdf		2.33 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Li, J	en_US
dc.contributor.author	Wang, J	en_US
dc.contributor.author	Huang, M https://orcid.org/0000-0002-6896-6480	en_US
dc.date.issued	2011-09-20	en_US
dc.identifier.citation	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011, 6861 LNCS (PART 2), pp. 43 - 50	en_US
dc.identifier.isbn	9783642230905	en_US
dc.identifier.issn	0302-9743	en_US
dc.identifier.uri	http://hdl.handle.net/10453/19108
dc.description.abstract	Twig pattern matching plays a crucial role in xml query processing. In order to reduce the processing time, some existing holistic one-phase twig pattern matching algorithms (e.g., HolisticTwigStack [3], TwigFast [5], etc) use the core function getNext of TwigStack [2] to effectively and efficiently filter out the useless elements. However, using getNext as a filter may incur other redundant computation. We propose two approaches, namely re-test checking and forward-to-end, which can avoid the redundant computation and can be easily applied to both holistic one-phase and two-phase algorithms. The experiments show that our approach can significantly improve the efficiency by avoiding the redundant computation. © 2011 Springer-Verlag Berlin Heidelberg.	en_US
dc.relation.ispartof	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en_US
dc.relation.isbasedon	10.1007/978-3-642-23091-2_4	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	Twig pattern matching: A revisit	en_US
dc.type	Conference Proceeding
utslib.citation.volume	PART 2	en_US
utslib.citation.volume	6861 LNCS	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
dc.location.activity	Toulouse, France	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Strength - INEXT - Innovation in IT Services and Applications
utslib.copyright.status	closed_access
pubs.issue	PART 2	en_US
pubs.publication-status	Published	en_US
pubs.volume	6861 LNCS	en_US

Abstract:

Twig pattern matching plays a crucial role in xml query processing. In order to reduce the processing time, some existing holistic one-phase twig pattern matching algorithms (e.g., HolisticTwigStack [3], TwigFast [5], etc) use the core function getNext of TwigStack [2] to effectively and efficiently filter out the useless elements. However, using getNext as a filter may incur other redundant computation. We propose two approaches, namely re-test checking and forward-to-end, which can avoid the redundant computation and can be easily applied to both holistic one-phase and two-phase algorithms. The experiments show that our approach can significantly improve the efficiency by avoiding the redundant computation. © 2011 Springer-Verlag Berlin Heidelberg.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/19108