Commercial search engines, especially meta-search engines was designed to retrieve the information by submitting users’ queries to multiple conventional search engines and integrating their partial searching results generated by each search engine. How to find the best search engine for user queries is know as the selection problem of search engines. Recently, the selection problem has become a...

Recently, keyword search has attracted a great deal of attention in XML database. It is hard to directly improve the relevancy of XML keyword search because lots of keyword-matched nodes may not contribute to the results. To address this challenge, in this paper we design an adaptive XML keyword search approach, called XBridge, that can derive the semantics of a keyword query and generate a set...

Keyword search over entity databases (e.g., product, moviedatabases) is an important problem. Current techniques forkeyword search on databases may often return incompleteand imprecise results. On the one hand, they either requirethat relevant entities contain all (or most) of the query key-words, or that relevant entities and the query keywords oc-cur together in severa...

The emergence of the Web has increased interests in XML data because that XML has flexible structure. Keyword search has attracted a great deal of attention for retrieving XML data because it is a userfriendly mechanism. But Keyword search is hard to directly improve search quality because lots of keyword-matched nodes may not contribute to the results. And in many applications, the goal is to ...

With the growing size of publicly available XML document collections, fast keyword search becomes increasingly important. We present an indexing and keyword search technique that is suitable for DAGcompressed data and has the advantage that common subtrees have to be searched only once. We also present a performance evaluation that shows that our DAGcompressed index and search technique is supe...

Decentralized and unstructured peer-to-peer (P2P) networks such as Gnutella are attractive for Internet-scale information retrieval and search systems because they require neither any centralized directory nor any centralized management of overlay network topology and data placement. However, due to this decentralized architecture, current P2P keyword search systems lack useful global knowledge...