Sciweavers

291 search results - page 12 / 59
» Dynamic Memory Allocation for Large Query Execution
Sort
View
ICDE
2000
IEEE
111views Database» more  ICDE 2000»
16 years 1 months ago
Dynamic Query Scheduling in Data Integration Systems
Execution plans produced by traditional query optimizers for data integration queries may yield poor performance for several reasons. The cost estimates may be inaccurate, the mem...
C. Mohan, Françoise Fabret, Luc Bouganim, P...
FMCAD
2009
Springer
15 years 6 months ago
Finding heap-bounds for hardware synthesis
Abstract—Dynamically allocated and manipulated data structures cannot be translated into hardware unless there is an upper bound on the amount of memory the program uses during a...
Byron Cook, Ashutosh Gupta, Stephen Magill, Andrey...
PARLE
1993
15 years 3 months ago
On the Performance of Parallel Join Processing in Shared Nothing Database Systems
: Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries. Shared nothing systems re...
Robert Marek, Erhard Rahm
95
Voted
ISSTA
2010
ACM
15 years 3 months ago
Proving memory safety of floating-point computations by combining static and dynamic program analysis
Whitebox fuzzing is a novel form of security testing based on dynamic symbolic execution and constraint solving. Over the last couple of years, whitebox fuzzers have found many ne...
Patrice Godefroid, Johannes Kinder
177
Voted
GIS
2007
ACM
16 years 22 days ago
Dynamic storage balancing in a distributed spatial index
We propose a general framework to index very large datasets of spatial data in a distributed system. Our proposal is built on the recently proposed Scalable Distributed Rtree (SD-...
Cédric du Mouza, Philippe Rigaux, Witold Li...