Guoliang Li
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.
- S. Cohen, J. Mamou, Y. Kanza, and Y. Sagiv. Xsearch: A semantic search engine for xml. In VLDB, 2003. Google Scholar
Digital Library
- L. Guo, F. Shao, C. Botev, and J. Shanmugasundaram. Xrank: Ranked keyword search over xml documents. In SIGMOD, 2003. Google ScholarDigital Library
- V. Hristidis, N. Koudas, Y. Papakonstantinou, and D. Srivastava. Keyword proximity search in xml trees. In IEEE TKDE 18(4), 2006. Google ScholarDigital Library
- G. Li, J. Feng, J. Wang, and L. Zhou. Efficient keyword search for valuable lcas over xml documents. In CIKM, 2007. Google ScholarDigital Library
- G. Li, J. Feng, J. Wang, and L. Zhou. SAILER: An Effective Search Engine for Unified Retrieval of Heterogeneous XML and Web Documents. In WWW, 2008. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- C. Sun, C. Y. Chan, and A. K. Goenka. Multiway slca-based keyword search in xml data. In WWW, 2007. Google ScholarDigital Library
Index Terms
Race: finding and ranking compact connected trees for keyword proximity search over xml documents
Recommendations
Finding and ranking compact connected trees for effective keyword proximity search in XML documents
In this paper, we study the problem of keyword proximity search in XML documents. We take the disjunctive semantics among the keywords into consideration and find top-k relevant compact connected trees (CCTrees) as the answers of keyword proximity ...
The Race for Sponsored Links: Bidding Patterns for Search Advertising
Paid placements on search engines reached sales of nearly $11 billion in the United States last year and represent the most rapidly growing form of online advertising today. In its classic form, a search engine sets up an auction for each search word in ...
Lowest common ancestors in trees and directed acyclic graphs
We study the problem of finding lowest common ancestors (LCA) in trees and directed acyclic graphs (DAGs). Specifically, we extend the LCA problem to DAGs and study the LCA variants that arise in this general setting. We begin with a clear exposition of ...
Comments