XKMis: effective and efficient keyword search in XML databases

Authors:
Jiang Li;Junhu Wang;Maolin Huang
Affiliations:
Griffith University, Gold Coast, Australia;Griffith University, Gold Coast, Australia;The University of Technology, Sydney, Australia
Venue:
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Year:
2009

Citing 10
Cited 1

Holistic twig joins: optimal XML pattern matching

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
XRANK: ranked keyword search over XML documents

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Efficient keyword search for smallest LCAs in XML databases

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Keyword Proximity Search in XML Trees

IEEE Transactions on Knowledge and Data Engineering
Identifying meaningful return information for XML keyword search

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Efficient IR-style keyword search over relational databases

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Schema-free XQuery

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Effective keyword search for valuable lcas over xml documents

Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Reasoning and identifying relevant matches for XML keyword search

Proceedings of the VLDB Endowment
Effective keyword search in XML documents based on MIU

DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications

Effective keyword search for candidate fragments of XML documents

DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications

Quantified Score

Hi-index	0.00

Visualization

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.