Sciweavers

TOIS   2002
Wall of Fame | Most Viewed TOIS-2002 Paper
TOIS
2002
97views more  TOIS 2002»
14 years 7 days ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source97
2Download preprint from source87
3Download preprint from source55
4Download preprint from source55
5Download preprint from source51
6Download preprint from source41
7Download preprint from source40