11212 search results - page 2007 / 2243 » Semi-persistent Data Structures |
127
click to vote
HPDC
1999
IEEE
15 years 8 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
264
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
133
click to vote
SPAA
2009
ACM
16 years 4 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
132
click to vote
SIAMCOMP
1998
15 years 3 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
199
click to vote
BMCBI
2011
14 years 11 months ago
2011
Background: Genomic position (GP) files currently used in next-generation sequencing (NGS) studies are always difficult to manipulate due to their huge size and the lack of approp...