Sciweavers

297 search results - page 11 / 60
» Polynomial heuristics for query optimization
Sort
View
JPDC
2006
187views more  JPDC 2006»
13 years 7 months ago
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
Bo Hong, Viktor K. Prasanna
DAC
2009
ACM
14 years 8 months ago
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
Shiyan Hu, Zhuo Li, Charles J. Alpert
ICDT
2009
ACM
149views Database» more  ICDT 2009»
14 years 8 months ago
Query languages for data exchange: beyond unions of conjunctive queries
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
Juan Reutter, Marcelo Arenas, Pablo Barceló
WSC
2007
13 years 10 months ago
Implications of heavy tails on simulation-based ordinal optimization
We consider the problem of selecting the best system using simulation-based ordinal optimization. This problem has been studied mostly in the context of light-tailed distributions...
Mark Broadie, Minsup Han, Assaf Zeevi
CIKM
2005
Springer
14 years 1 months ago
Selectivity-based partitioning: a divide-and-union paradigm for effective query optimization
Modern query optimizers select an efficient join ordering for a physical execution plan based essentially on the average join selectivity factors among the referenced tables. In ...
Neoklis Polyzotis