Sciweavers

808 search results - page 10 / 162
» On the Estimation of Join Result Sizes
Sort
View
INFORMS
2006
87views more  INFORMS 2006»
14 years 9 months ago
Early Estimates of the Size of Branch-and-Bound Trees
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
Gérard Cornuéjols, Miroslav Karamano...
VTC
2008
IEEE
105views Communications» more  VTC 2008»
15 years 4 months ago
Practical Results of High Resolution AOA Estimation by the Synthetic Array
— In this paper, a new method for AOA estimation, based on the synthetic ESPRIT algorithm is described and tested with actual CDMA signals. Physical size constraints of handheld ...
Ali Broumandan, John Nielsen, Gérard Lachap...
73
Voted
ADBIS
2000
Springer
82views Database» more  ADBIS 2000»
15 years 1 months ago
A New Algorithm for Page Access Sequencing in Join Processing
Abstract. One of the fundamental problems in relational database management is the handling of the join operation. Two of the problems are: 1) finding a page access sequence which...
Andrew Lim, Wee-Chong Oon, Chi-Hung Chi
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
15 years 9 months ago
Rank-aware Query Optimization
Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank...
Ihab F. Ilyas, Rahul Shah, Walid G. Aref, Jeffrey ...
SIGMOD
2011
ACM
179views Database» more  SIGMOD 2011»
14 years 12 days ago
How soccer players would do stream joins
In spite of the omnipresence of parallel (multi-core) systems, the predominant strategy to evaluate window-based stream joins is still strictly sequential, mostly just straightfor...
Jens Teubner, René Müller