Sciweavers

5659 search results - page 995 / 1132
» Comparing Clusterings in Space
Sort
View
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
16 years 4 months ago
Estimating Compilation Time of a Query Optimizer
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
Ihab F. Ilyas, Jun Rao, Guy M. Lohman, Dengfeng Ga...
DCC
2008
IEEE
16 years 4 months ago
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries
The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent on-line queries asking for the position of a minimal element between...
Johannes Fischer, Volker Heun, Horst Martin St&uum...
ICCAD
2004
IEEE
158views Hardware» more  ICCAD 2004»
16 years 1 months ago
DAOmap: a depth-optimal area optimization mapping algorithm for FPGA designs
In this paper we study the technology mapping problem for FPGA architectures to minimize chip area, or the total number of lookup tables (LUTs) of the mapped design, under the chi...
Deming Chen, Jason Cong
ICDE
2010
IEEE
211views Database» more  ICDE 2010»
15 years 11 months ago
ROX: The robustness of a run-time XQuery optimizer against correlated data
— We demonstrate ROX, a run-time optimizer of XQueries, that focuses on finding the best execution order of XPath steps and relational joins in an XQuery. The problem of join or...
Riham Abdel Kader, Peter A. Boncz, Stefan Manegold...
ASPLOS
2010
ACM
15 years 11 months ago
ConMem: detecting severe concurrency bugs through an effect-oriented approach
Multicore technology is making concurrent programs increasingly pervasive. Unfortunately, it is difficult to deliver reliable concurrent programs, because of the huge and non-det...
Wei Zhang, Chong Sun, Shan Lu