Sciweavers

257 search results - page 37 / 52
» An Approximate L1-Difference Algorithm for Massive Data Stre...
Sort
View
SIGMOD
2003
ACM
196views Database» more  SIGMOD 2003»
15 years 9 months ago
Aurora: A Data Stream Management System
The Aurora system [1] is an experimental data stream management system with a fully functional prototype. It includes both a graphical development environment, and a runtime syste...
Daniel J. Abadi, Donald Carney, Ugur Çetint...
AAAI
2010
14 years 11 months ago
Local Search in Histogram Construction
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
15 years 4 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
BDA
2007
14 years 11 months ago
PeerSum: Summary Management in P2P Systems
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer suffi...
Rabab Hayek, Guillaume Raschia, Patrick Valduriez,...
ICDE
2012
IEEE
216views Database» more  ICDE 2012»
13 years 2 days ago
Load Balancing in MapReduce Based on Scalable Cardinality Estimates
—MapReduce has emerged as a popular tool for distributed and scalable processing of massive data sets and is increasingly being used in e-science applications. Unfortunately, the...
Benjamin Gufler, Nikolaus Augsten, Angelika Reiser...