Sciweavers

624 search results - page 35 / 125
» Mutant Query Plans
Sort
View
WLP
2000
Springer
15 years 3 months ago
A Dynamic Approach to Deductive Query Evaluation
In this paper, a dynamic approach to deductive query evaluation is presented which combines the e ects of di erent SIP strategies used for the magic set rewriting technique. Given...
Andreas Behrend
CSMR
2000
IEEE
15 years 4 months ago
Architectural Design Recovery using Data Mining Techniques
This paper presents a technique for recovering the high level design of legacy software systems according to user defined architectural plans. Architectural plans are represented...
Kamran Sartipi, Kostas Kontogiannis, Farhad Mavadd...
ICDCS
2002
IEEE
15 years 4 months ago
Query Optimization to Meet Performance Targets for Wide Area Applications
Recent technology advances have enabled mediated query processing with Internet accessible WebSources. A characteristic of WebSources is that their access costs exhibit transient ...
Vladimir Zadorozhny, Louiqa Raschid
ICDE
2012
IEEE
224views Database» more  ICDE 2012»
13 years 2 months ago
Exploiting Common Subexpressions for Cloud Query Processing
—Many companies now routinely run massive data analysis jobs – expressed in some scripting language – on large clusters of low-end servers. Many analysis scripts are complex ...
Yasin N. Silva, Paul-Ake Larson, Jingren Zhou
BNCOD
2006
55views Database» more  BNCOD 2006»
15 years 1 months ago
On the Optimal Ordering of Maps, Selections, and Joins Under Factorization
We examine the problem of producing the optimal evaluation order for queries containing joins, selections, and maps. Specifically, we look at the case where common subexpressions i...
Thomas Neumann, Sven Helmer, Guido Moerkotte