Sciweavers

491 search results - page 48 / 99
» Optimizing complex queries with multiple relation instances
Sort
View
SAMOS
2007
Springer
14 years 1 months ago
An Evolutionary Approach to Area-Time Optimization of FPGA designs
—This paper presents a new methodology based on evolutionary multi-objective optimization (EMO) to synthesize multiple complex modules on programmable devices (FPGAs). It starts ...
Fabrizio Ferrandi, Pier Luca Lanzi, Gianluca Paler...
DMDW
2000
161views Management» more  DMDW 2000»
13 years 9 months ago
View materialization for nested GPSJ queries
View materialization is a central issue in logical design of data warehouses since it is one of the most powerful techniques to improve the response to the workload. Most approach...
Matteo Golfarelli, Stefano Rizzi
VLDB
2007
ACM
103views Database» more  VLDB 2007»
14 years 7 months ago
On the Production of Anorexic Plan Diagrams
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently tha...
Harish D., Pooja N. Darera, Jayant R. Haritsa
STOC
2005
ACM
174views Algorithms» more  STOC 2005»
14 years 8 months ago
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera
GIS
1999
ACM
13 years 12 months ago
A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
Vasilis Delis, Christos Makris, Spyros Sioutas