297 search results - page 16 / 60 » Polynomial heuristics for query optimization |
FOIKS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
EOR
2008
13 years 7 months ago
2008
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
ICDE
2007
IEEE
14 years 2 months ago
2007
IEEE
Existing index selection tools rely on heuristics to efficiently search within the large space of alternative solutions and to minimize the overhead of using the query optimizer ...
INFFUS
2008
13 years 7 months ago
2008
Data processing applications for sensor streams have to deal with multiple continuous data streams with inputs arriving at highly variable and unpredictable rates from various sour...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...