624 search results - page 36 / 125 » Mutant Query Plans |
94
Voted
ICDE
2010
IEEE
15 years 7 months ago
2010
IEEE
— Research on query optimization has traditionally focused on exhaustive enumeration of an exponential number of candidate plans. Alternatively, heuristics for query optimization...
147
click to vote
ADHOCNOW
2008
Springer
15 years 2 months ago
2008
Springer
This paper presents a novel method for optimizing sliding window based continuous queries. We deal with two categories of aggregation operations: stepwise aggregation (e.g. COUNT) ...
115
Voted
DEXAW
2009
IEEE
15 years 8 months ago
2009
IEEE
— The amount of semantic data on the Web has increased exponentially in the last years. One of the main reasons for this is the use of RDB2RDF systems, which generate RDF data fr...
104
click to vote
VLDB
1997
ACM
15 years 6 months ago
1997
ACM
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or...
119
click to vote
EDBT
2009
ACM
15 years 8 months ago
2009
ACM
This paper introduces the problem of modeling urban transportation systems in a database where certain aspects of the data are probabilistic in nature. The transportation network ...