Sciweavers

3269 search results - page 288 / 654
» Query Optimization for XML
Sort
View
130
Voted
CICLING
2005
Springer
15 years 10 months ago
Learning the Query Generation Patterns
Abstract. With the current method of query formation, a Question Answering system retrieves a set of documents that are similar to a question, while what is mostly required is a se...
Marcin Skowron, Kenji Araki
VLDB
2001
ACM
190views Database» more  VLDB 2001»
15 years 9 months ago
LEO - DB2's LEarning Optimizer
Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer’s e...
Michael Stillger, Guy M. Lohman, Volker Markl, Mok...
ICDE
2006
IEEE
189views Database» more  ICDE 2006»
16 years 6 months ago
Algebraic Optimization of Nested XPath Expressions
The XPath language incorporates powerful primitives for formulating queries containing nested subexpressions which are existentially or universally quantified. However, even the b...
Matthias Brantner, Carl-Christian Kanne, Guido Moe...
DAWAK
2003
Springer
15 years 10 months ago
Computing SQL Queries with Boolean Aggregates
We introduce a new method for optimization of SQL queries with nested subqueries. The method is based on the idea of Boolean aggregates, aggregates that compute the conjunction or ...
Antonio Badia
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
13 years 7 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...