Sciweavers

36 search results - page 3 / 8
» The Influence of Caches on the Performance of Sorting
Sort
View
DCC
1998
IEEE
13 years 10 months ago
The Context Trees of Block Sorting Compression
Abstract. The Burrows-Wheeler transform (BWT) and block sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutat...
N. Jesper Larsson
CLUSTER
2005
IEEE
13 years 11 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
JCIT
2008
78views more  JCIT 2008»
13 years 5 months ago
A Study on Web Caching based on Reference Characteristics of Web Objects
There are various web caching replacement algorithms related to reference characteristics of web objects were researched. They could be used in regard to user characteristics of c...
Yun Ji Na, Sarvar R. Abdullaev, Il Seok Ko
ACSC
2007
IEEE
14 years 3 days ago
HAT-Trie: A Cache-Conscious Trie-Based Data Structure For Strings
Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-cha...
Nikolas Askitis, Ranjan Sinha
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
13 years 7 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee