Sciweavers

2124 search results - page 51 / 425
» An Efficient Framework for Order Optimization
Sort
View
FUIN
2006
139views more  FUIN 2006»
15 years 4 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
131
Voted
PODS
2008
ACM
221views Database» more  PODS 2008»
16 years 4 months ago
A generic flow algorithm for shared filter ordering problems
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
AMC
2005
138views more  AMC 2005»
15 years 4 months ago
Optimal centers in branch-and-prune algorithms for univariate global optimization
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
D. G. Sotiropoulos, T. N. Grapsa
TSMC
2008
136views more  TSMC 2008»
15 years 4 months ago
On 3-D Point Set Matching With MAE and SAE Cost Criteria
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
Giuseppe C. Calafiore
SIGMOD
2001
ACM
120views Database» more  SIGMOD 2001»
16 years 4 months ago
Materialized View Selection and Maintenance Using Multi-Query Optimization
Materialized views have been found to be very effective at speeding up queries, and are increasingly being supported by commercial databases and data warehouse systems. However, w...
Hoshi Mistry, Prasan Roy, S. Sudarshan, Krithi Ram...