1404 search results - page 101 / 281 » Increasing Concurrency in Databases Using Program Analysis |
192
click to vote
SIGMOD
2009
ACM
16 years 26 days ago
2009
ACM
There is currently considerable enthusiasm around the MapReduce (MR) paradigm for large-scale data analysis [17]. Although the basic control flow of this framework has existed in ...
199
Voted
POPL
2009
ACM
16 years 1 months ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
160
Voted
BMCBI
2011
14 years 4 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
122
click to vote
ECOOP
2005
Springer
15 years 6 months ago
2005
Springer
The three problems of the title — the first two widely discussed in the literature, the third less well known but just as important for further development of object technology ...
102
Voted
PPOPP
2005
ACM
15 years 6 months ago
2005
ACM
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...