Sciweavers

516 search results - page 26 / 104
» Processing Queries in a Large Peer-to-Peer System
Sort
View
CIKM
2010
Springer
13 years 6 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...
KDD
2007
ACM
186views Data Mining» more  KDD 2007»
14 years 8 months ago
Content-based document routing and index partitioning for scalable similarity-based searches in a large corpus
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...
Deepavali Bhagwat, Kave Eshghi, Pankaj Mehra
SIGMOD
2007
ACM
196views Database» more  SIGMOD 2007»
14 years 7 months ago
Adaptive location constraint processing
An important problem for many location-based applications is the continuous evaluation of proximity relations among moving objects. These relations express whether a given set of ...
Zhengdao Xu, Hans-Arno Jacobsen
CBMS
2009
IEEE
14 years 2 months ago
On the storage, management and analysis of (multi) similarity for large scale protein structure datasets in the grid
Assessment of the (Multi) Similarity among a set of protein structures is achieved through an ensemble of protein structure comparison methods/algorithms. This leads to the genera...
Gianluigi Folino, Azhar Ali Shah, Natalio Krasnogo...
USENIX
2008
13 years 10 months ago
Wide-Scale Data Stream Management
This paper describes Mortar, a distributed stream processing platform for building very large queries across federated systems (enterprises, grids, datacenters, testbeds). Nodes i...
Dionysios Logothetis, Ken Yocum