Sciweavers

95 search results - page 3 / 19
» The repeatability experiment of SIGMOD 2008
Sort
View
SPE
1998
129views more  SPE 1998»
13 years 5 months ago
Timing Trials, or the Trials of Timing: Experiments with Scripting and User-Interface Languages
This paper describes some basic experiments to see how fast various popular scripting and user-interface languages run on a spectrum of representative tasks. We found enormous var...
Brian W. Kernighan, Christopher J. Van Wyk
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
14 years 5 months ago
LearnPADS: automatic tool generation from ad hoc data
In this demonstration, we will present LEARNPADS, a fully automatic system for generating ad hoc data processing tools. When presented with a collection of ad hoc data, the system...
Kathleen Fisher, David Walker, Kenny Qili Zhu
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
14 years 6 months ago
Optimizing complex extraction programs over evolving text data
Most information extraction (IE) approaches have considered only static text corpora, over which we apply IE only once. Many real-world text corpora however are dynamic. They evol...
Fei Chen 0002, Byron J. Gao, AnHai Doan, Jun Yang ...
SIGMOD
2004
ACM
151views Database» more  SIGMOD 2004»
14 years 5 months ago
Highly-Available, Fault-Tolerant, Parallel Dataflows
We present a technique that masks failures in a cluster to provide high availability and fault-tolerance for long-running, parallelized dataflows. We can use these dataflows to im...
Mehul A. Shah, Joseph M. Hellerstein, Eric A. Brew...
SYRCODIS
2008
95views Database» more  SYRCODIS 2008»
13 years 7 months ago
The Framework for Study Of Caching Algorithm Efficiency
In this paper we offer several models of reference sequences (traces of references) using Markov chains for testing of the replacement policies in caching systems. These models en...
Michael V. Grankov, Ngo Thanh Hung, Mosab Bassam Y...