Sciweavers

964 search results - page 11 / 193
» Efficiently Ordering Query Plans for Data Integration
Sort
View
PVLDB
2008
126views more  PVLDB 2008»
14 years 9 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
DASFAA
2007
IEEE
205views Database» more  DASFAA 2007»
15 years 1 months ago
Efficient Support for Ordered XPath Processing in Tree-Unaware Commercial Relational Databases
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
Boon-Siew Seah, Klarinda G. Widjanarko, Sourav S. ...
CIDR
2009
152views Algorithms» more  CIDR 2009»
14 years 10 months ago
Visualizing the robustness of query execution
In database query processing, actual run-time conditions (e.g., actual selectivities and actual available memory) very often differ from compile-time expectations of run-time cond...
Goetz Graefe, Harumi A. Kuno, Janet L. Wiener
FUIN
2006
139views more  FUIN 2006»
14 years 9 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
ESWS
2011
Springer
14 years 29 days ago
Zero-Knowledge Query Planning for an Iterator Implementation of Link Traversal Based Query Execution
Abstract. Link traversal based query execution is a new query execution paradigm for the Web of Data. This approach allows the execution engine to discover potentially relevant dat...
Olaf Hartig