Sciweavers

44 search results - page 1 / 9
» Compression in Data Caches with Compressible Field Isolation...
Sort
View
EUROPAR
2003
Springer
13 years 10 months ago
Compression in Data Caches with Compressible Field Isolation for Recursive Data Structures
We introduce a software/hardware scheme called the Field Array Compression Technique (FACT) which reduces cache misses due to recursive data structures. Using a data layout transfo...
Masamichi Takagi, Kei Hiraki
DATESO
2009
158views Database» more  DATESO 2009»
13 years 3 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...
ACMMSP
2005
ACM
101views Hardware» more  ACMMSP 2005»
13 years 11 months ago
Transparent pointer compression for linked data structures
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
Chris Lattner, Vikram S. Adve
COMPUTER
2000
138views more  COMPUTER 2000»
13 years 5 months ago
Making Pointer-Based Data Structures Cache Conscious
Processor and memory technology trends portend a continual increase in the relative cost of accessing main memory. Machine designers have tried to mitigate the effect of this tren...
Trishul M. Chilimbi, Mark D. Hill, James R. Larus
FIMI
2004
175views Data Mining» more  FIMI 2004»
13 years 6 months ago
CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure
Frequent itemset mining (FIM) is an essential part of association rules mining. Its application for other data mining tasks has also been recognized. It has been an active researc...
Yudho Giri Sucahyo, Raj P. Gopalan