Sciweavers

342 search results - page 66 / 69
» Branch-and-bound processing of ranked queries
Sort
View
PVLDB
2008
116views more  PVLDB 2008»
13 years 9 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
WWW
2004
ACM
14 years 10 months ago
Web-scale information extraction in knowitall: (preliminary results)
Manually querying search engines in order to accumulate a large body of factual information is a tedious, error-prone process of piecemeal search. Search engines retrieve and rank...
Oren Etzioni, Michael J. Cafarella, Doug Downey, S...
CIKM
2001
Springer
14 years 2 months ago
PowerDB-IR - Information Retrieval on Top of a Database Cluster
Our current concern is a scalable infrastructure for information retrieval (IR) with up-to-date retrieval results in the presence of frequent, continuous updates. Timely processin...
Torsten Grabs, Klemens Böhm, Hans-Jörg S...
SIGIR
2008
ACM
13 years 9 months ago
On iterative intelligent medical search
Searching for medical information on the Web has become highly popular, but it remains a challenging task because searchers are often uncertain about their exact medical situation...
Gang Luo, Chunqiang Tang
WWW
2003
ACM
14 years 10 months ago
Mining topic-specific concepts and definitions on the web
Traditionally, when one wants to learn about a particular topic, one reads a book or a survey paper. With the rapid expansion of the Web, learning in-depth knowledge about a topic...
Bing Liu, Chee Wee Chin, Hwee Tou Ng