Sciweavers

1637 search results - page 29 / 328
» Superimposing dynamic range
Sort
View
70
Voted
VLDB
2004
ACM
100views Database» more  VLDB 2004»
15 years 3 months ago
Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
Prasanna Ganesan, Mayank Bawa, Hector Garcia-Molin...
LCN
2006
IEEE
15 years 3 months ago
Cerco: Supporting Range Queries with a Hierarchically Structured Peer-to-Peer System
Structured Peer-to-Peer systems are designed for a highly scalable, self organizing, and efficient lookup for data. The key space of the so-called Distributed Hash Tables (DHTs) ...
Simon Rieche, Klaus Wehrle, Leo Petrak, Clemens Wr...
INFOCOM
1997
IEEE
15 years 1 months ago
Time Scale Analysis of an ATM Queueing System with Long-Range Dependent Traffic
Several types of network trafic have been shown to exhibit long-range dependence (LRD). In this work, we show that the busy period of an ATM system driven by a long-range dependen...
Gilberto Mayor, John A. Silvester
CGO
2006
IEEE
15 years 1 months ago
Profiling over Adaptive Ranges
Modern computer systems are called on to deal with billions of events every second, whether they are instructions executed, memory locations accessed, or packets forwarded. This p...
Shashidhar Mysore, Banit Agrawal, Timothy Sherwood...
166
Voted
ICDE
1999
IEEE
89views Database» more  ICDE 1999»
15 years 11 months ago
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the ...
Steven Geffner, Divyakant Agrawal, Amr El Abbadi, ...