Sciweavers

101 search results - page 12 / 21
» Query optimization techniques for partitioned tables
Sort
View
SIGMOD
2009
ACM
161views Database» more  SIGMOD 2009»
14 years 2 months ago
Dependency-aware reordering for parallelizing query optimization in multi-core CPUs
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
Wook-Shin Han, Jinsoo Lee
SIGMOD
2004
ACM
122views Database» more  SIGMOD 2004»
14 years 7 months ago
Adapting to Source Properties in Processing Data Integration Queries
An effective query optimizer finds a query plan that exploits the characteristics of the source data. In data integration, little is known in advance about sources' propertie...
Zachary G. Ives, Alon Y. Halevy, Daniel S. Weld
ICDE
2005
IEEE
103views Database» more  ICDE 2005»
14 years 9 months ago
Vectorizing and Querying Large XML Repositories
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
Peter Buneman, Byron Choi, Wenfei Fan, Robert Hutc...
ER
2008
Springer
110views Database» more  ER 2008»
13 years 9 months ago
Conjunctive Query Containment under Access Limitations
Access limitations may occur when querying data sources over the web or heterogeneous data sources presented as relational tables: this happens, for instance, in Data Exchange and ...
Andrea Calì, Davide Martinenghi
WWW
2008
ACM
14 years 8 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...