Image de couverture de livre

Approximate Keys and Functional Dependencies in Incomplete Databases With Limited Domains-Algorithmic Perspective

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Al-atar, Munqath, Sali, Attila
Format:	Preprint
Publié:	2024
Sujets:	Databases 68P15, 68Q15 H.2.1; F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Approximate Integrity Constraints in Incomplete Databases With Limited Domains
par: Al-atar, Munqath, et autres
Publié: (2024)

The Complexity of Resilience Problems via Valued Constraint Satisfaction
par: Bodirsky, Manuel, et autres
Publié: (2023)

A Unified Mathematical Framework for Distributed Data Fabrics: Categorical Hypergraph Models
par: Shaska, T., et autres
Publié: (2026)

Graphify: Automated Synthesis of Type-Safe Graph Backends via $O(S)$ GraphQL-to-Gremlin Transpilation
par: Graf, Johannes
Publié: (2026)

NP-hard problems are not in BQP
par: Czerwinski, Reiner
Publié: (2023)

Modeling Concurrency Control as a Learnable Function
par: Pan, Hexiang, et autres
Publié: (2025)

Completeness classes in algebraic complexity theory
par: Bürgisser, Peter
Publié: (2024)

The Optimizer Quotient and the Certification Trilemma
par: Simas, Tristan
Publié: (2026)

Modular Fault-Tolerant DBMS
par: Fot, Nikolay, et autres
Publié: (2025)

Shifted Partial Derivative Polynomial Rank and Codimension
par: Edwards, Darren J.
Publié: (2025)

IECZ-III: Hardcore Condensation Lift with Size-Aware Invariants
par: Lela, Marko
Publié: (2025)

Topological Relational Theory: A Simplicial-Complex View of Functional Dependencies, Lossless Decomposition, and Acyclicity
par: Senturk, Bilge, et autres
Publié: (2026)

Competitive Data-Structure Dynamization
par: Mathieu, Claire, et autres
Publié: (2020)

On the study of cellular automata on modulo-recurrent words
par: Barro, Moussa, et autres
Publié: (2022)

A Simple and Efficient Algorithm for Sorting Signed Permutations by Reversals
par: Swenson, Krister M.
Publié: (2024)

Multiset semantics in SPARQL, Relational Algebra and Datalog
par: Angles, Renzo, et autres
Publié: (2026)

The Gallai Vertex Problem is $Θ_2^p$-Complete
par: Nikabadi, Amir, et autres
Publié: (2026)

Hierarchical Robust PCA for Scalable Data Quality Monitoring in Multi-level Aggregation Pipelines
par: Ojha, Preetam Kumar
Publié: (2025)

Stringological sequence prediction I: efficient algorithms for predicting highly repetitive sequences
par: Kosoy, Vanessa
Publié: (2026)

CAFS: A Cache-Aware Frequency Sort for Low-Cardinality Integer Data on x86-64
par: Shlyk, Vasiliy S.
Publié: (2026)

An MDL-Style Cost Functional KC, Distribution-Preserving Reductions ($A2^d$), and an $AC^0$+log Lower Bound for 3SAT via Balanced 3XOR
par: Lela, Marko
Publié: (2025)

From Unstructured Recall to Schema-Grounded Memory: Reliable AI Memory via Iterative, Schema-Aware Extraction
par: Petrov, Alex, et autres
Publié: (2026)

Quantum Advantage in Computational Chemistry?
par: Gundlach, Hans, et autres
Publié: (2025)

Computational Complexity of Determining the Assembly Index
par: Masierak, Piotr
Publié: (2026)

Adaptive Indexing for Approximate Query Processing in Exploratory Data Analysis
par: Maroulis, Stavros, et autres
Publié: (2025)

Polynomial Prenexing of QBFs with Non-Monotone Boolean Operators
par: Saffidine, Abdallah, et autres
Publié: (2025)

Quantum Algorithms for the Minimum Steiner Tree problem with application to Binary Near-Perfect Phylogenies
par: Meng, Lingfa, et autres
Publié: (2025)

Evolomino is NP-complete
par: Nikolaev, Andrei V.
Publié: (2025)

Distributed Exact Quantum Amplitude Amplification Algorithm for Arbitrary Quantum States
par: Zhou, Xu, et autres
Publié: (2026)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
par: Chen, Yijia, et autres
Publié: (2023)

Visual Analytics Challenges and Trends in the Age of AI: The BigVis Community Perspective
par: Bikakis, Nikos, et autres
Publié: (2025)

Generalized Fractional Repetition Codes for Binary Coded Computations
par: Charalambides, Neophytos, et autres
Publié: (2021)

Character Complexity: A Novel Measure for Quantum Circuit Analysis
par: Shami, Daksh
Publié: (2024)

On (In)approximability of MaxMin Independent Set Reconfiguration
par: Hoang, Hung P., et autres
Publié: (2026)

Computing bases in Hermite normal form of lattices of integer relations
par: Labahn, George, et autres
Publié: (2026)

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness
par: Grochow, Joshua A., et autres
Publié: (2025)

A quantum implementation of high-order power method for estimating geometric entanglement of pure states
par: Semenov, Andrii, et autres
Publié: (2024)

M3: Conversational LLMs Simplify Secure Clinical Data Access, Understanding, and Analysis
par: Attrach, Rafi Al, et autres
Publié: (2025)

Nested Grover's Algorithm for Tree Search
par: Wichert, Andreas
Publié: (2025)

Language-Based Protocol Testing
par: Liggesmeyer, Alexander, et autres
Publié: (2025)