342 search results - page 3 / 69 » Branch-and-bound processing of ranked queries |
BTW
2007
Springer
2007
Springer
TopX - Efficient and Versatile Top-k Query Process-ing for Text, Semistructured, and Structured Data
13 years 11 months ago
: This paper presents a comprehensive overview of the TopX search engine, an extensive framework for unified indexing and querying large collections of unstructured, semistructured...
VLDB
2007
ACM
14 years 1 months ago
2007
ACM
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...
ICDT
2007
ACM
14 years 1 months ago
2007
ACM
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
EMNLP
2009
13 years 5 months ago
2009
There have been increasing needs for task specific rankings in web search such as rankings for specific query segments like long queries, time-sensitive queries, navigational quer...
GI
2010
Springer
13 years 6 months ago
2010
Springer
: Information needs like searching scientific literature that involve high recall rates are difficult to satisfy with ad hoc keyword search. We propose to state queries implicitl...