Sciweavers

3225 search results - page 86 / 645
» Query Optimization by Stored Queries
Sort
View
ICDE
2007
IEEE
98views Database» more  ICDE 2007»
14 years 3 months ago
Towards Adaptive Costing of Database Access Methods
Most database query optimizers use cost models to identify good query execution plans. Inaccuracies in the cost models can cause query optimizers to select poor plans. In this pap...
Ye Qin, Kenneth Salem, Anil K. Goel
ICDE
2009
IEEE
182views Database» more  ICDE 2009»
14 years 10 months ago
Adaptive Parallelization of Queries over Dependent Web Service Calls
We have developed a system to process database queries over composed data providing web services. The queries are transformed into execution plans containing an operator that invok...
Manivasakan Sabesan, Tore Risch
ADBIS
2000
Springer
188views Database» more  ADBIS 2000»
14 years 1 months ago
Algorithms for Rewriting Aggregate Queries Using Views
Queries involving aggregation are typical in a number of database research areas, such as data warehousing, global information systems and mobile computing. One of the main ideas ...
Sara Cohen, Werner Nutt, Alexander Serebrenik
ICDE
2003
IEEE
183views Database» more  ICDE 2003»
14 years 10 months ago
Skyline with Presorting
There has been interest recently in skyline queries, also called Pareto queries, on relational databases. Relational query languages do not support search for "best" tupl...
Jan Chomicki, Parke Godfrey, Jarek Gryz, Dongming ...
ICFP
2008
ACM
14 years 8 months ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...