Sciweavers

188 search results - page 31 / 38
» A parallel index for semistructured data
Sort
View
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
14 years 4 months ago
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eri...
GPC
2007
Springer
15 years 3 months ago
Design of PeerSum: A Summary Service for P2P Applications
Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A more ef...
Rabab Hayek, Guillaume Raschia, Patrick Valduriez,...
NIPS
2004
14 years 11 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
COSPS
2001
Springer
15 years 2 months ago
Automatic Array Privatization
Abstract. Array privatization is one of the most e ective transformations for the exploitation of parallelism. In this paper, we present a technique for automatic array privatizati...
Peng Tu, David A. Padua
HPDC
2002
IEEE
15 years 2 months ago
A Decentralized, Adaptive Replica Location Mechanism
We describe a decentralized, adaptive mechanism for replica location in wide-area distributed systems. Unlike traditional, hierarchical (e.g, DNS) and more recent (e.g., CAN, Chor...
Matei Ripeanu, Ian T. Foster