Sciweavers

4039 search results - page 246 / 808
» A Method for Dynamic Clustering of Data
Sort
View
IPPS
2005
IEEE
16 years 6 days ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
Sebastian Gerlach, Roger D. Hersch
SIGMOD
2004
ACM
164views Database» more  SIGMOD 2004»
16 years 6 months ago
Dynamic Plan Migration for Continuous Queries Over Data Streams
Dynamic plan migration is concerned with the on-the-fly transition from one continuous query plan to a semantically equivalent yet more efficient plan. Migration is important for ...
Yali Zhu, Elke A. Rundensteiner, George T. Heinema...
196
Voted
JCP
2007
118views more  JCP 2007»
15 years 6 months ago
Dynamic Nonuniform Data Approximation in Databases with Haar Wavelet
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...
Su Chen, Antonio Nucci
WWW
2010
ACM
16 years 1 months ago
Mind the data skew: distributed inferencing by speeddating in elastic regions
Semantic Web data exhibits very skewed frequency distributions among terms. Efficient large-scale distributed reasoning methods should maintain load-balance in the face of such hi...
Spyros Kotoulas, Eyal Oren, Frank van Harmelen
ICPPW
2008
IEEE
16 years 1 months ago
Disparity: Scalable Anomaly Detection for Clusters
In this paper, we describe disparity, a tool that does parallel, scalable anomaly detection for clusters. Disparity uses basic statistical methods and scalable reduction operation...
Narayan Desai, Rick Bradshaw, Ewing L. Lusk