1101 search results - page 150 / 221 » Scalable Distributed Data Structures for High-Performance Da... |
153
click to vote
PPOPP
2006
ACM
15 years 8 months ago
2006
ACM
We investigate a transactional memory runtime system providing scaling and strong consistency for generic C++ and SQL applications on commodity clusters. We introduce a novel page...
122
Voted
BMCBI
2010
15 years 2 months ago
2010
Background: Many protein structures determined in high-throughput structural genomics centers, despite their significant novelty and importance, are available only as PDB depositi...
138
Voted
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
171
click to vote
VLDB
1999
ACM
15 years 6 months ago
1999
ACM
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
144
click to vote
KDD
2004
ACM
15 years 8 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...