ACM Home Page
Please provide us with feedback. Feedback
XKMis: effective and efficient keyword search in XML databases
Full text PdfPdf (984 KB)
Source
ACM International Conference Proceeding Series archive
Proceedings of the 2009 International Database Engineering & Applications Symposium table of contents
Cetraro - Calabria, Italy
SESSION: Full papers table of contents
Pages 121-130  
Year of Publication: 2009
ISBN:978-1-60558-402-7
Authors
Jiang Li  Griffith University, Gold Coast, Australia
Junhu Wang  Griffith University, Gold Coast, Australia
Maolin Huang  The University of Technology, Sydney, Australia
Sponsors
: BytePress
Concordia University : Concordia University
: ACM
: Universita della Calabria, Rende(CS), Italy
: ICAR-CNR, Rende (CS), Italy
: ACM International Conference Proceeding Series
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 8,   Citation Count: 0
Additional Information:

abstract   references   index terms  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1620432.1620445
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
N. Bruno, N. Koudas, and D. Srivastava. Holistic twig joins: optimal XML pattern matching. In SIGMOD Conference, pages 310--321, 2002.
 
5
L. Guo, F. Shao, C. Botev, and J. Shanmugasundaram. Xrank: Ranked keyword search over XML documents. In SIGMOD Conference, pages 16--27, 2003.
 
6
V. Hristidis, L. Gravano, and Y. Papakonstantinou. Efficient ir-style keyword search over relational databases. In VLDB, pages 850--861, 2003.
 
7
V. Hristidis, N. Koudas, Y. Papakonstantinou, and D. Srivastava. Keyword proximity search in XML trees. IEEE Trans. Knowl. Data Eng., 18(4):525--539, 2006.
 
8
G. Li, J. Feng, J. Wang, and L. Zhou. Effective keyword search for valuable lcas over XML documents. In CIKM, pages 31--40, 2007.
 
9
Y. Li, C. Yu, and H. V. Jagadish. Schema-free XQuery. In VLDB, pages 72--83, 2004.
 
10
Z. Liu and Y. Chen. Identifying meaningful return information for XML keyword search. In SIGMOD Conference, pages 329--340, 2007.
 
11
Z. Liu and Y. Chen. Reasoning and identifying relevant matches for xml keyword search. PVLDB, 1(1):921--932, 2008.
 
12
J. Xu, J. Lu, W. Wang, and B. Shi. Effective keyword search in XML documents based on MIU. In DASFAA, pages 702--716, 2006.
 
13
Y. Xu and Y. Papakonstantinou. Efficient keyword search for smallest lcas in XML databases. In SIGMOD Conference, pages 527--538, 2005.