72 search results - page 8 / 15 » Approximate distributed top- k queries |
ICTIR
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. A useful ability for search engines is to be able to rank objects with novelty and diversity: the top k documents retrieved should cover possible interpretations of a que...
JACM
2012
12 years 1 months ago
2012
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...
EDBT
2009
ACM
14 years 5 months ago
2009
ACM
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
SSDBM
2003
IEEE
14 years 4 months ago
2003
IEEE
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
PVLDB
2008
13 years 10 months ago
2008
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...