Sciweavers

483 search results - page 11 / 97
» Evaluating Top-k Selection Queries
Sort
View
IIS
2004
13 years 9 months ago
Query Selectivity Estimation via Data Mining
Estimating the result size of a join is an important query optimization problem as it determines the choice of a good query evaluation strategy. Yet, there are few efficient techni...
Jarek Gryz, Dongming Liang
SIGIR
2008
ACM
13 years 7 months ago
Evaluation over thousands of queries
Information retrieval evaluation has typically been performed over several dozen queries, each judged to near-completeness. There has been a great deal of recent work on evaluatio...
Ben Carterette, Virgiliu Pavlu, Evangelos Kanoulas...
SSD
2005
Springer
105views Database» more  SSD 2005»
14 years 1 months ago
Evaluation of Top-k OLAP Queries Using Aggregate R-Trees
Abstract. A top-k OLAP query groups measures with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example ...
Nikos Mamoulis, Spiridon Bakiras, Panos Kalnis
ISEMANTICS
2010
13 years 6 months ago
An evaluation of approaches to federated query processing over linked data
The Web has evolved from a global information space of linked documents to a web of linked data. The Web of Data enables answering complex, structured queries that could not be an...
Peter Haase, Tobias Mathäß, Michael Zil...
SIGIR
2003
ACM
14 years 25 days ago
Evaluating different methods of estimating retrieval quality for resource selection
In a federated digital library system, it is too expensive to query every accessible library. Resource selection is the task to decide to which libraries a query should be routed....
Henrik Nottelmann, Norbert Fuhr