Sciweavers

486 search results - page 91 / 98
» Online update of b-trees
Sort
View
ICALP
2009
Springer
15 years 10 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
VLDB
2008
ACM
127views Database» more  VLDB 2008»
15 years 9 months ago
Delay aware querying with Seaweed
Large highly distributed data sets are poorly supported by current query technologies. Applications such as endsystembased network management are characterized by data stored on l...
Dushyanth Narayanan, Austin Donnelly, Richard Mort...
EDBT
2004
ACM
174views Database» more  EDBT 2004»
15 years 9 months ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
WWW
2010
ACM
15 years 4 months ago
Atomate it! end-user context-sensitive automation using heterogeneous information sources on the web
The transition of personal information management (PIM) tools off the desktop to the Web presents an opportunity to augment these tools with capabilities provided by the wealth o...
Max Van Kleek, Brennan Moore, David R. Karger, Pau...
86
Voted
ICDE
2009
IEEE
174views Database» more  ICDE 2009»
15 years 4 months ago
Sketching Sampled Data Streams
—Sampling is used as a universal method to reduce the running time of computations – the computation is performed on a much smaller sample and then the result is scaled to comp...
Florin Rusu, Alin Dobra