Sciweavers

128 search results - page 4 / 26
» Plan Selection Based on Query Clustering
Sort
View
VLDB
2005
ACM
126views Database» more  VLDB 2005»
14 years 1 months ago
Consistently Estimating the Selectivity of Conjuncts of Predicates
Cost-based query optimizers need to estimate the selectivity of conjunctive predicates when comparing alternative query execution plans. To this end, advanced optimizers use multi...
Volker Markl, Nimrod Megiddo, Marcel Kutsch, Tam M...
ICDE
2000
IEEE
113views Database» more  ICDE 2000»
14 years 2 days ago
Web Query Optimizer
We consider an architecture of mediators and wrappers for Internet accessible WebSources of limited query capability. Each call to a source is a WebSource Implementation (WSI) and...
Vladimir Zadorozhny, Laura Bright, Louiqa Raschid,...
SSDBM
2008
IEEE
149views Database» more  SSDBM 2008»
14 years 2 months ago
Query Planning for Searching Inter-dependent Deep-Web Databases
Increasingly, many data sources appear as online databases, hidden behind query forms, thus forming what is referred to as the deep web. It is desirable to have systems that can pr...
Fan Wang, Gagan Agrawal, Ruoming Jin
VLDB
2001
ACM
123views Database» more  VLDB 2001»
14 years 3 days ago
User-Optimizer Communication using Abstract Plans in Sybase ASE
imizer Communication using Abstract Plans in Sybase ASE Query optimizers are error prone, due to both their nature and the increased search space that modern query processing requ...
Mihnea Andrei, Patrick Valduriez
CIKM
2009
Springer
14 years 2 months ago
Improving retrievability of patents with cluster-based pseudo-relevance feedback documents selection
High findability of documents within a certain cut-off rank is considered an important factor in recall-oriented application domains such as patent or legal document retrieval. ...
Shariq Bashir, Andreas Rauber