Exploiting the relationship between keywords for effective XML keyword search

Li, J; Wang, J; Huang, M

Exploiting the relationship between keywords for effective XML keyword search

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), 2013, 8133 LNCS pp. 232 - 245
Issue Date:: 2013-09-05

Closed Access

	Filename	Description	Size
	2013003718OK.pdf		322.16 kB	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	2013-09-05	en_US
dc.identifier.citation	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013, 8133 LNCS pp. 232 - 245	en_US
dc.identifier.isbn	9783642406829	en_US
dc.identifier.issn	0302-9743	en_US
dc.identifier.uri	http://hdl.handle.net/10453/28304
dc.description.abstract	XML keyword search provides a simple and user-friendly way of retrieving data from XML databases, but the ambiguities of keywords make it difficult to effectively answer keyword queries. In this paper, we tackle the keyword ambiguity problem by exploiting the relationship between keywords in a query. We propose an approach which infers and ranks a set of likely search intentions. Extensive experiments verified the better effectiveness of our approach than existing systems. © 2013 Springer-Verlag.	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-40683-6_18	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	Exploiting the relationship between keywords for effective XML keyword search	en_US
dc.type	Conference Proceeding
utslib.citation.volume	8133 LNCS	en_US
utslib.for	0806 Information Systems	en_US
dc.location.activity	Genoa, Italy	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.publication-status	Published	en_US
pubs.volume	8133 LNCS	en_US

Abstract:

XML keyword search provides a simple and user-friendly way of retrieving data from XML databases, but the ambiguities of keywords make it difficult to effectively answer keyword queries. In this paper, we tackle the keyword ambiguity problem by exploiting the relationship between keywords in a query. We propose an approach which infers and ranks a set of likely search intentions. Extensive experiments verified the better effectiveness of our approach than existing systems. © 2013 Springer-Verlag.

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

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