47 search results - page 3 / 10 » Supporting Ranked Boolean Similarity Queries in MARS |
ICDE
2010
IEEE
13 years 5 months ago
2010
IEEE
— There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, onl...
SIGIR
1998
ACM
13 years 5 months ago
1998
ACM
Ranked queries are used to locate relevant documents in text databases. In a ranked query a list of terms is specified, then the documents that most closely match the query are re...
SAC
2006
ACM
13 years 11 months ago
2006
ACM
Traditional semantic web query languages support a logicbased access to the semantic web. They offer a retrieval (or reasoning) of data based on facts. On the traditional web and...
KDD
2005
ACM
14 years 5 months ago
2005
ACM
This paper presents a novel approach for using clickthrough data to learn ranked retrieval functions for web search results. We observe that users searching the web often perform ...
WWW
2010
ACM
14 years 4 days ago
2010
ACM
In this paper, we address the problem of database selection for XML document collections, that is, given a set of collections and a user query, how to rank the collections based o...