Sciweavers

55 search results - page 10 / 11
» Augmenting Performance For Distributed Cloud Storage
Sort
View
PDP
2003
IEEE
15 years 2 months ago
An XML based framework for self-describing parallel I/O data
File I/O data is interpreted by high performance parallel/distributed applications mostly as a sequence of arbitrary bits. This leads to the situation where data is ’volatile’...
András Belokosztolszki, Erich Schikuta
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
14 years 11 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount
OTM
2010
Springer
14 years 7 months ago
On the Expressiveness and Trade-Offs of Large Scale Tuple Stores
Massive-scale distributed computing is a challenge at our doorstep. The current exponential growth of data calls for massive-scale capabilities of storage and processing. This is b...
Ricardo Vilaça, Francisco Cruz, Rui Carlos ...
DCOSS
2006
Springer
15 years 1 months ago
Distance-Sensitive Information Brokerage in Sensor Networks
In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms o...
Stefan Funke, Leonidas J. Guibas, An Nguyen, Yusu ...
SIGIR
2011
ACM
14 years 11 days ago
Faster top-k document retrieval using block-max indexes
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
Shuai Ding, Torsten Suel