1673 search results - page 41 / 335 » Taming the Dynamics of Distributed Data |
141
click to vote
POS
1998
Springer
15 years 8 months ago
1998
Springer
In light of advances in processor and networking technology, especially the emergence of network attached disks, the traditional client-server architecture becomes suboptimal for ...
143
click to vote
SIGSOFT
2002
ACM
16 years 5 months ago
2002
ACM
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
160
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
191
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
135
click to vote
GCC
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. In data grid, large quantity of data files is produced and data replication is applied to reduce data access time. Efficiently utilizing grid resources becomes important ...