From a Comprehensive Experimental Survey to a Cost-based Selection Strategy for Lightweight Integer Compression Algorithms
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: ACM Transactions on Database Systems, Erscheinungsjahr: 2019, Jahrgang: 44, Heft: 3, Seiten: 1-46, ISSN: 0362-5915, E-ISSN: 1557-4644, Artikelnummer: 9
- Ereignis
-
Veröffentlichung
- (wo)
-
Dresden
- (wer)
-
Technische Universität Dresden
- (wann)
-
2023
- Urheber
-
Damme, Patrick
Ungethüm, Annett
Hildebrandt, Juliana
Habich, Dirk
Lehner, Wolfgang
- URN
-
urn:nbn:de:bsz:14-qucosa2-813777
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:33 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Damme, Patrick
- Ungethüm, Annett
- Hildebrandt, Juliana
- Habich, Dirk
- Lehner, Wolfgang
- Technische Universität Dresden
Entstanden
- 2023
Ähnliche Objekte (12)
BOUNCE: memory-efficient SIMD approach for lightweight integer compression
BOUNCE : memory-efficient SIMD approach for lightweight integer compression
A Benchmark Framework for Data Compression Techniques
Make Larger Vector Register Sizes New Challenges? : Lessons Learned from the Area of Vectorized Lightweight Compression Algorithms
Balancing Performance and Energy for Lightweight Data Compression Algorithms
Compression-Aware In-Memory Query Processing : Vision, System Design and Beyond
Integer Compression in NVRAM-centric Data Stores : Comparative Experimental Analysis to DRAM
Limitations of Intra-operator Parallelism Using Heterogeneous Computing Resources
A Technical Perspective of DataCalc : Ad-hoc Analyses on Heterogeneous Data Sources
Penalized Graph Partitioning for Static and Dynamic Load Balancing
Direct Transformation Techniques for Compressed Data : General Approach and Application Scenarios
On-demand re-optimization of integration flows
BOUNCE: memory-efficient SIMD approach for lightweight integer compression
BOUNCE : memory-efficient SIMD approach for lightweight integer compression
A Benchmark Framework for Data Compression Techniques
Make Larger Vector Register Sizes New Challenges? : Lessons Learned from the Area of Vectorized Lightweight Compression Algorithms
Balancing Performance and Energy for Lightweight Data Compression Algorithms
Compression-Aware In-Memory Query Processing : Vision, System Design and Beyond
Integer Compression in NVRAM-centric Data Stores : Comparative Experimental Analysis to DRAM
Limitations of Intra-operator Parallelism Using Heterogeneous Computing Resources
A Technical Perspective of DataCalc : Ad-hoc Analyses on Heterogeneous Data Sources
Penalized Graph Partitioning for Static and Dynamic Load Balancing
Direct Transformation Techniques for Compressed Data : General Approach and Application Scenarios
On-demand re-optimization of integration flows
BOUNCE: memory-efficient SIMD approach for lightweight integer compression
BOUNCE : memory-efficient SIMD approach for lightweight integer compression
A Benchmark Framework for Data Compression Techniques
Make Larger Vector Register Sizes New Challenges? : Lessons Learned from the Area of Vectorized Lightweight Compression Algorithms
Balancing Performance and Energy for Lightweight Data Compression Algorithms
Compression-Aware In-Memory Query Processing : Vision, System Design and Beyond
Integer Compression in NVRAM-centric Data Stores : Comparative Experimental Analysis to DRAM
Limitations of Intra-operator Parallelism Using Heterogeneous Computing Resources
A Technical Perspective of DataCalc : Ad-hoc Analyses on Heterogeneous Data Sources
Penalized Graph Partitioning for Static and Dynamic Load Balancing
Direct Transformation Techniques for Compressed Data : General Approach and Application Scenarios