25 search results - page 3 / 5 » Tree Indexing on Flash Disks |
VISUALIZATION
1998
IEEE
13 years 9 months ago
1998
IEEE
Many high-performance isosurface extraction algorithms have been proposed in the past several years as a result of intensive research efforts. When applying these algorithms to la...
PODS
2006
ACM
14 years 5 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
DEXA
1998
Springer
13 years 9 months ago
1998
Springer
The object identifier index of an object-oriented database system is typically 20% of the size of the database itself, and for large databases, only a small part of the index fits...
SIGMOD
2009
ACM
14 years 5 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...
CIKM
2005
Springer
13 years 10 months ago
2005
Springer
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...