1101 search results - page 184 / 221 » Scalable Distributed Data Structures for High-Performance Da... |
168
click to vote
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
177
click to vote
ERLANG
2003
ACM
15 years 11 months ago
2003
ACM
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
156
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
167
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
248
click to vote
GIS
2008
ACM
16 years 7 months ago
2008
ACM
We introduce a parallel approximation of an Over-determined Laplacian Partial Differential Equation solver (ODETLAP) applied to the compression and restoration of terrain data use...