11213 search results - page 1826 / 2243 » Low-contention data structures |
331
click to vote
SIGMOD
2009
ACM
16 years 7 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...
173
click to vote
SPAA
2009
ACM
16 years 7 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...
212
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: Knowledge of transcription factor-DNA binding patterns is crucial for understanding gene transcription. Numerous DNA-binding proteins are annotated as transcription fa...
186
click to vote
SIAMCOMP
1998
15 years 6 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...
261
click to vote
BMCBI
2011
15 years 1 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...