Cover Image

A High-Throughput GPU Framework for Adaptive Lossless Compression of Floating-Point Data

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Zheng, Wang, Weiyan, Li, Ruiyuan, Chen, Chao, Long, Xianlei, Zheng, Linjiang, Xu, Quanqing, Yang, Chuanhui
Format:	Preprint
Published:	2025
Subjects:	Databases Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

New Compressed Indices for Multijoins on Graph Databases
by: Arroyuelo, Diego, et al.
Published: (2024)

A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets
by: Li, Xuan, et al.
Published: (2024)

Evaluating Regular Path Queries on Compressed Adjacency Matrices
by: Arroyuelo, Diego, et al.
Published: (2023)

A Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,\mathcal{X})$-Core Query
by: Zhong, Ming, et al.
Published: (2023)

AutoCSF: Provably Space-Efficient Indexing of Skewed Key-Value Workloads via Filter-Augmented Compressed Static Functions
by: Ramos, David Torres, et al.
Published: (2026)

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
by: Shi, Jifan, et al.
Published: (2026)

Algorithms for Optimizing Acyclic Queries
by: Luo, Zheng, et al.
Published: (2025)

Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy
by: Wang, Kaixin, et al.
Published: (2026)

Efficient $k$-Clique Listing: An Edge-Oriented Branching Strategy
by: Wang, Kaixin, et al.
Published: (2023)

Adaptive Hybrid Sort: Dynamic Strategy Selection for Optimal Sorting Across Diverse Data Distributions
by: Balasubramanian, Shrinivass Arunachalam
Published: (2025)

A Theoretical Framework for Distribution-Aware Dataset Search
by: Esmailpour, Aryan, et al.
Published: (2025)

In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
by: Zhou, Yingli, et al.
Published: (2024)

Balanced Partitioning for Optimizing Big Graph Computation: Complexities and Approximation Algorithms
by: Ning, Baoling, et al.
Published: (2024)

Computing Data Distribution from Query Selectivities
by: Agarwal, Pankaj K., et al.
Published: (2024)

Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
by: Yu, Kaiqiang, et al.
Published: (2025)

Faster Relational Algorithms Using Geometric Data Structures
by: Esmailpour, Aryan, et al.
Published: (2026)

Frequency Moments in Noisy Streaming and Distributed Data under Mismatch Ambiguity
by: Liu, Kaiwen, et al.
Published: (2026)

The SpaceSaving$\pm$ Family of Algorithms for Data Streams with Bounded Deletions
by: Zhao, Fuheng, et al.
Published: (2023)

CuckooGraph: A Scalable and Space-Time Efficient Data Structure for Large-Scale Dynamic Graphs
by: Fan, Zhuochen, et al.
Published: (2024)

QSketch: An Efficient Sketch for Weighted Cardinality Estimation in Streams
by: Qi, Yiyan, et al.
Published: (2024)

U-HNSW: An Efficient Graph-based Solution to ANNS Under Universal Lp Metrics
by: Wang, Huayi, et al.
Published: (2026)

Scalable Order-Preserving Pattern Mining
by: Li, Ling, et al.
Published: (2024)

Contextual Pattern Mining and Counting
by: Li, Ling, et al.
Published: (2025)

RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
by: Gao, Jianyang, et al.
Published: (2024)

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
by: Gao, Jianyang, et al.
Published: (2024)

GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs
by: Fan, Xiaoyu, et al.
Published: (2024)

CAMP: A Cost Adaptive Multi-Queue Eviction Policy for Key-Value Stores
by: Ghandeharizadeh, Shahram, et al.
Published: (2024)

FB$^+$-tree: A Memory-Optimized B$^+$-tree with Latch-Free Update
by: Chen, Yuan, et al.
Published: (2025)

CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions
by: Coleman, Benjamin, et al.
Published: (2023)

Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
by: Carmeli, Nofar, et al.
Published: (2025)

Improved Approximation Algorithms for Relational Clustering
by: Esmailpour, Aryan, et al.
Published: (2024)

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
by: De Man, Quinten, et al.
Published: (2026)

Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue
by: Arenas, Marcelo, et al.
Published: (2024)

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
by: Hamada, Kou, et al.
Published: (2024)

Sampling Methods for Inner Product Sketching
by: Daliri, Majid, et al.
Published: (2023)

Approaching 100% Confidence in Stream Summary through ReliableSketch
by: Wu, Yuhan, et al.
Published: (2024)

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
by: Song, Siwoo, et al.
Published: (2025)

Range (Rényi) Entropy Queries and Partitioning
by: Esmailpour, Aryan, et al.
Published: (2023)

Parallel Dynamic Spatial Indexes
by: Men, Ziyang, et al.
Published: (2026)

Space-efficient B-tree Implementation for Memory-Constrained Flash Embedded Devices
by: Ould-Khessal, Nadir, et al.
Published: (2026)