Sciweavers

149 search results - page 7 / 30
» Optimization of Multi-Way Join Queries for Parallel Executio...
Sort
View
SIGMOD
2000
ACM
141views Database» more  SIGMOD 2000»
15 years 1 months ago
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
Florian Waas, César A. Galindo-Legaria
ICDE
2003
IEEE
161views Database» more  ICDE 2003»
15 years 11 months ago
Structural Join Order Selection for XML Query Optimization
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish
COMAD
1994
14 years 11 months ago
An Adaptive, Load Balancing Parallel Join Algorithm
Many parallel join algorithms have been proposed in the last several years. However, most of these algorithms require that the amount of data to be joined is known in advance in o...
Minesh B. Amin, Donovan A. Schneider, V. Singh
68
Voted
VLDB
1992
ACM
103views Database» more  VLDB 1992»
15 years 1 months ago
Temporal Query Processing and Optimization in Multiprocessor Database Machines
In this paper, we discuss issues involving temporal data fragmentation, temporal query processing, and query optimization in multiprocessor database machines. We propose parallel ...
T. Y. Cliff Leung, Richard R. Muntz
DKE
2006
123views more  DKE 2006»
14 years 9 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...