Sciweavers

70 search results - page 8 / 14
» Self-Join Size Estimation in Large-scale Distributed Data Sy...
Sort
View
CIKM
2010
Springer
13 years 5 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
13 years 12 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
SPAA
2005
ACM
14 years 18 days ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski
ISPA
2004
Springer
14 years 12 days ago
HPL Performance Prevision to Intending System Improvement
HPL is a parallel Linpack benchmark package widely adopted in massive cluster system performance test. On HPL data layout among processors, a law to determine block size NB theoret...
Wenli Zhang, Mingyu Chen, Jianping Fan
CCGRID
2008
IEEE
13 years 9 months ago
A Probabilistic Model to Analyse Workflow Performance on Production Grids
Production grids are complex and highly variable systems whose behavior is not well understood and difficult to anticipate. The goal of this study is to estimate the impact of the ...
Tristan Glatard, Johan Montagnat, Xavier Pennec