Sciweavers

243 search results - page 29 / 49
» Selectivity Estimation for Boolean Queries
Sort
View
ADC
2008
Springer
135views Database» more  ADC 2008»
15 years 9 months ago
Faster Path Indexes for Search in XML Data
This article describes how to implement efficient memory resident path indexes for semi-structured data. Two techniques are introduced, and they are shown to be significantly fas...
Nils Grimsmo
SIGIR
2010
ACM
15 years 3 months ago
A joint probabilistic classification model for resource selection
Resource selection is an important task in Federated Search to select a small number of most relevant information sources. Current resource selection algorithms such as GlOSS, COR...
Dzung Hong, Luo Si, Paul Bracke, Michael Witt, Tim...
ICML
2009
IEEE
16 years 3 months ago
Robust bounds for classification via selective sampling
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
Nicolò Cesa-Bianchi, Claudio Gentile, Franc...
VLDB
2004
ACM
97views Database» more  VLDB 2004»
15 years 8 months ago
Progressive Optimization in Action
Progressive Optimization (POP) is a technique to make query plans robust, and minimize need for DBA intervention, by repeatedly re-optimizing a query during runtime if the cardina...
Vijayshankar Raman, Volker Markl, David E. Simmen,...
DL
2000
Springer
137views Digital Library» more  DL 2000»
15 years 7 months ago
Server selection on the World Wide Web
We evaluate server selection methods in a Web environment, modeling a digital library which makes use of existing Web search servers rather than building its own index. The evalua...
Nick Craswell, Peter Bailey, David Hawking