Sciweavers

619 search results - page 14 / 124
» Query Planning in Infomaster
Sort
View
144
Voted
BTW
2003
Springer
170views Database» more  BTW 2003»
15 years 7 months ago
Executing Nested Queries
Abstract: Optimization of nested queries, in particular finding equivalent “flattened” queries for queries that employ the SQL sub-query construct, has been researched extensiv...
Goetz Graefe
125
Voted
ICDT
2007
ACM
105views Database» more  ICDT 2007»
15 years 8 months ago
Optimization of Query Plans in the presence of Access Limitations
We consider the problem of querying data sources that have limited capabilities and can thus only be accessed by complying with certain binding patterns for their attributes. This ...
Andrea Calì, Diego Calvanese, Davide Martin...
99
Voted
PVLDB
2010
110views more  PVLDB 2010»
15 years 7 days ago
Read-Once Functions and Query Evaluation in Probabilistic Databases
Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, q...
Prithviraj Sen, Amol Deshpande, Lise Getoor
139
Voted
SIGMOD
2011
ACM
176views Database» more  SIGMOD 2011»
14 years 4 months ago
Sharing work in keyword search over databases
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
Marie Jacob, Zachary G. Ives
DEBU
2000
118views more  DEBU 2000»
15 years 1 months ago
A Dynamic Query Processing Architecture for Data Integration Systems
Execution plans produced by traditional query optimizers for data integration queries may yield poor performance for several reasons. The cost estimates may be inaccurate, the mem...
Luc Bouganim, Françoise Fabret, C. Mohan, P...