ACM Home Page
Please provide us with feedback. Feedback
Race: finding and ranking compact connected trees for keyword proximity search over xml documents
Full text PdfPdf (136 KB)
Source
International World Wide Web Conference archive
Proceeding of the 17th international conference on World Wide Web table of contents
Beijing, China
POSTER SESSION: Posters table of contents
Pages 1045-1046  
Year of Publication: 2008
ISBN:978-1-60558-085-2
Authors
Guoliang Li  Tsinghua University, Beijing, China
Jianhua Feng  Tsinghua University, Beijing, China
Jianyong Wang  Tsinghua University, Beijing, China
Bei Yu  National University of Singapore, Singapore
Yukai He  Tsinghua University, Beijing, China
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 64,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

In this paper, we study the problem of keyword proximity search over XML documents and leverage the efficiency and effectiveness. We take the disjunctive semantics among input keywords into consideration and identify meaningful compact connected trees as the answers of keyword proximity queries. We introduce the notions of Compact Lowest Common Ancestor (CLCA) and Maximal CLCA (MCLCA) and propose Compact Connected Trees (CCTrees) and Maximal CCTrees (MCCTrees) to efficiently and effectively answer keyword queries. We propose a novel ranking mechanism, RACE, to Rank compAct Connected trEes, by taking into consideration both the structural similarity and the textual similarity. Our extensive experimental study shows that our method achieves both high search efficiency and effectiveness, and outperforms existing approaches significantly.


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
5
 
6
G. Li, B. C. Ooi, J. Feng, J. Wang, and L. Zhou. EASE: Efficient and Adaptive Keyword Search on Unstructured, Semi-structured and Structured Data. In SIGMOD, 2008.
7


Collaborative Colleagues:
Guoliang Li: colleagues
Jianhua Feng: colleagues
Jianyong Wang: colleagues
Bei Yu: colleagues
Yukai He: colleagues