Sciweavers

1168 search results - page 29 / 234
» Optimization strategies for complex queries
Sort
View
SOFSEM
2012
Springer
12 years 6 months ago
Randomized Group Testing Both Query-Optimal and Minimal Adaptive
The classical group testing problem asks to determine at most d defective elements in a set of n elements, by queries to subsets that return Yes if the subset contains some defecti...
Peter Damaschke, Azam Sheikh Muhammad
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
14 years 3 months ago
Niching in evolution strategies
Evolutionary Algorithms (EAs), popular search methods for solving search and optimization problems, are known for successful and fast location of single optimal solutions. However,...
Ofer M. Shir, Thomas Bäck
ICDE
2007
IEEE
120views Database» more  ICDE 2007»
14 years 4 months ago
Optimizing State-Intensive Non-Blocking Queries Using Run-time Adaptation
Main memory is a critical resource when processing non-blocking queries with state intensive operators that require real-time responses. While partitioned parallel processing can ...
Bin Liu, Mariana Jbantova, Elke A. Rundensteiner
EDBT
2002
ACM
107views Database» more  EDBT 2002»
14 years 10 months ago
A Robust and Self-tuning Page-Replacement Strategy for Spatial Database Systems
For a spatial database management system, it is an important goal to minimize the I/O-cost of queries and other operations. Several page-replacement strategies have been proposed a...
Thomas Brinkhoff
ICDE
2007
IEEE
117views Database» more  ICDE 2007»
14 years 11 months ago
Unnesting Scalar SQL Queries in the Presence of Disjunction
Optimizing nested queries is an intricate problem. It becomes even harder if in a nested query the linking predicate or the correlation predicate occurs disjunctively. We present ...
Matthias Brantner, Norman May, Guido Moerkotte