:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Barsamian, Yann, Chailloux, André
Formato:	Preprint
Publicado:	2022
Materias:	Databases Information Theory
Acceso en línea:	https://arxiv.org/abs/2209.02089
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Universal Graph Compression: Stochastic Block Models
por: Bhatt, Alankrita, et al.
Publicado: (2020)

New Solutions to Delsarte's Dual Linear Programs
por: Chailloux, André, et al.
Publicado: (2024)

PANDA: Query Evaluation in Submodular Width
por: Khamis, Mahmoud Abo, et al.
Publicado: (2024)

Ambidextrous Degree Sequence Bounds for Pessimistic Cardinality Estimation
por: Lin, Yu-Ting, et al.
Publicado: (2025)

Wrangling Data Issues to be Wrangled: Literature Review, Taxonomy, and Industry Case Study
por: Qin, Qiaolin, et al.
Publicado: (2024)

A Partial-Exclusion Repair Scheme for MDS Codes
por: Zhao, Wei, et al.
Publicado: (2026)

The MAGIC of Data Management: Understanding the Value and Activities of Data Management
por: Lukyanenko, Roman
Publicado: (2024)

Applications of Information Inequalities to Database Theory Problems
por: Suciu, Dan
Publicado: (2023)

Join Size Bounds using Lp-Norms on Degree Sequences
por: Khamis, Mahmoud Abo, et al.
Publicado: (2023)

Query Optimization and Evaluation via Information Theory: A Tutorial
por: Khamis, Mahmoud Abo, et al.
Publicado: (2026)

The Case for Cardinality Lower Bounds
por: Stoian, Mihail, et al.
Publicado: (2026)

Pessimistic Cardinality Estimation
por: Khamis, Mahmoud Abo, et al.
Publicado: (2024)

A Plaque Test for Redundancies in Relational Data [Extendend Version]
por: Köhnen, Christoph, et al.
Publicado: (2023)

OpenZL: A Graph-Based Model for Compression
por: Collet, Yann, et al.
Publicado: (2025)

OpenZL: Using Graphs to Compress Smaller and Faster
por: Collet, Yann, et al.
Publicado: (2026)

From HNSW to Information-Theoretic Binarization: Rethinking the Architecture of Scalable Vector Search
por: Abtahi, Seyed Moein, et al.
Publicado: (2025)

PANDAExpress: a Simpler and Faster PANDA Algorithm
por: Khamis, Mahmoud Abo, et al.
Publicado: (2025)

CAMEO: Autocorrelation-Preserving Line Simplification for Lossy Time Series Compression
por: Muñiz-Cuza, Carlos Enrique, et al.
Publicado: (2025)

Constraint based Modeling according to Reference Design
por: Heiland, Erik, et al.
Publicado: (2024)

Foundations for Digital Twins
por: Wilson, Finn, et al.
Publicado: (2024)

Fast Matrix Multiplication meets the Submodular Width
por: Abo-Khamis, Mahmoud, et al.
Publicado: (2024)

An Algorithm for Streaming Differentially Private Data
por: Kumar, Girish, et al.
Publicado: (2024)

Towards declarative comparabilities: application to functional dependencies
por: Nourine, Lhouari, et al.
Publicado: (2019)

A Word-Based Compression Technique for Text Files.
por: Vernor, Russel L., III, et al.
Publicado: (1978)

Learned Data Compression: Challenges and Opportunities for the Future
por: Liu, Qiyu, et al.
Publicado: (2024)

Information Theory Strikes Back: New Development in the Theory of Cardinality Estimation
por: Khamis, Mahmoud Abo, et al.
Publicado: (2025)

HetDAPAC: Leveraging Attribute Heterogeneity in Distributed Attribute-Based Private Access Control
por: Meel, Shreya, et al.
Publicado: (2025)

Data Augmentation in Graph Neural Networks: The Role of Generated Synthetic Graphs
por: Bas, Sumeyye, et al.
Publicado: (2024)

Refl-Spanners: A Purely Regular Approach to Non-Regular Core Spanners
por: Schmid, Markus L., et al.
Publicado: (2020)

Combining PatternRank with Huffman Coding: A Novel Compression Algorithm
por: Shukurov, Jasurbek
Publicado: (2024)

Un cadre paraconsistant pour l'{é}valuation de similarit{é} dans les bases de connaissances
por: Medina, José-Luis Vilchis
Publicado: (2025)

Lightweight Correlation-Aware Table Compression
por: Stoian, Mihail, et al.
Publicado: (2024)

Speculations on Unanticipated Outcomes of Data Base Research.
por: Doll, Russell
Publicado: (1980)

Future of AI Models: A Computational perspective on Model collapse
por: Satharasi, Trivikram, et al.
Publicado: (2025)

Optimized Arithmetic Coding for Efficient Data Compression in the Resource-Constrained Internet of Things(IoT)
por: Upadhyay, Vatsala, et al.
Publicado: (2025)

Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search
por: Severo, Daniel, et al.
Publicado: (2025)

Experimental Analysis of Large-scale Learnable Vector Storage Compression
por: Zhang, Hailin, et al.
Publicado: (2023)

An Analysis of XML Compression Efficiency
por: Augeri, Christopher James, et al.
Publicado: (2024)

Symmetric Private Information Retrieval (SPIR) on Graph-Based Replicated Systems
por: Meel, Shreya, et al.
Publicado: (2025)

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