XKMis: Effective and efficient keyword search in XML databases

Li, J; Wang, J; Huang, M

XKMis: Effective and efficient keyword search in XML databases

Li, J Wang, J Huang, M

Permalink

Publication Type:: Conference Proceeding
Citation:: ACM International Conference Proceeding Series, 2009, pp. 121 - 130
Issue Date:: 2009-11-09

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download full textAdobe PDF (645.66 kB)

View on publisher's site

View statistics

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	2009-11-09	en_US
dc.identifier.citation	ACM International Conference Proceeding Series, 2009, pp. 121 - 130	en_US
dc.identifier.isbn	9781605584027	en_US
dc.identifier.uri	http://hdl.handle.net/10453/10772
dc.description.abstract	We present XKMis, a system for keyword search in xml documents. Unlike previous work, our method is not based on the lowest common ancestor (LCA) or its variant, rather we divide the nodes into meaningful and self-containing information segments, called minimal information segments (MISs), and return MIS-subtrees which consist of MISs that are logically connected by the keywords. The MIS-subtrees are closer to what the user wants. The MIS-subtrees enable us to use the region code of xml trees to develop an algorithm for the search which is more efficient especially for large xml trees. We report our experiment results, which verify the better effectiveness and efficiency of our system. Copyright ©2009 ACM.	en_US
dc.relation.ispartof	ACM International Conference Proceeding Series	en_US
dc.relation.isbasedon	10.1145/1620432.1620445	en_US
dc.title	XKMis: Effective and efficient keyword search in XML databases	en_US
dc.type	Conference Proceeding
utslib.for	0803 Computer Software	en_US
dc.location.activity	Cetraro, Calabria, 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	open_access
pubs.publication-status	Published	en_US

Abstract:

We present XKMis, a system for keyword search in xml documents. Unlike previous work, our method is not based on the lowest common ancestor (LCA) or its variant, rather we divide the nodes into meaningful and self-containing information segments, called minimal information segments (MISs), and return MIS-subtrees which consist of MISs that are logically connected by the keywords. The MIS-subtrees are closer to what the user wants. The MIS-subtrees enable us to use the region code of xml trees to develop an algorithm for the search which is more efficient especially for large xml trees. We report our experiment results, which verify the better effectiveness and efficiency of our system. Copyright ©2009 ACM.

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

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