4 search results - page 1 / 1 » Cache-Conscious Sorting of Large Sets of Strings with Dynami... |
ALENEX
2003
13 years 6 months ago
2003
Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms. The size of main memory in typical computers continues to grow, but memory acce...
SPIRE
2005
Springer
13 years 10 months ago
2005
Springer
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
TOIS
2002
13 years 4 months ago
2002
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...
SIGMOD
2009
ACM
14 years 4 months ago
2009
ACM
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...