Sciweavers

48 search results - page 1 / 10
» Slicing Long-Running Queries
Sort
View
PVLDB
2010
189views more  PVLDB 2010»
13 years 7 months ago
Slicing Long-Running Queries
The ability to decompose a complex, long-running query into simpler queries that produce the same result is useful for many scenarios, such as admission control, resource manageme...
Nicolas Bruno, Vivek R. Narasayya, Ravishankar Ram...
SIGSOFT
2006
ACM
14 years 9 months ago
Dynamic slicing long running programs through execution fast forwarding
Fixing runtime bugs in long running programs using trace based analyses such as dynamic slicing was believed to be prohibitively expensive. In this paper, we present a novel execu...
Xiangyu Zhang, Sriraman Tallam, Rajiv Gupta
VLDB
2007
ACM
112views Database» more  VLDB 2007»
14 years 8 months ago
Stop-and-Restart Style Execution for Long Running Decision Support Queries
Long running decision support queries can be resource intensive and often lead to resource contention in data warehousing systems. Today, the only real option available to the DBA...
Surajit Chaudhuri, Raghav Kaushik, Ravishankar Ram...
OTM
2004
Springer
14 years 1 months ago
Managing Long Running Queries in Grid Environment
Exceptionally large amounts of both distributed data and computational resources are becoming available through the Grid. This will enable efficient exchange and processing of very...
Ruslan Fomkin, Tore Risch
ISSRE
2006
IEEE
14 years 2 months ago
Memoized Forward Computation of Dynamic Slices
Forward computation of dynamic slices is necessary to support interactive debugging and online analysis of long running programs. However, the overhead of existing forward computi...
Wes Masri, Nagi Nahas, Andy Podgurski