Imagen de Portada

Improving Unstructured Data Quality via Updatable Extracted Views

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kassaie, Besat, Tompa, Frank Wm.
Formato:	Preprint
Publicado:	2025
Materias:	Databases Formal Languages and Automata Theory H.2; I.7
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Unifying Perspective on Succinct Data Representations
por: Kimelfeld, Benny, et al.
Publicado: (2023)

A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity
por: Mengel, Stefan, et al.
Publicado: (2024)

Designing and Comparing RPQ Semantics
por: Marsault, Victor, et al.
Publicado: (2026)

The Complexity of Aggregates over Extractions by Regular Expressions
por: Doleschal, Johannes, et al.
Publicado: (2020)

A framework for extraction and transformation of documents
por: Riveros, Cristian, et al.
Publicado: (2024)

MSO-Enumeration Over SLP-Compressed Unranked Forests
por: Lohrey, Markus, et al.
Publicado: (2024)

Skyline Operators for Document Spanners
por: Amarilli, Antoine, et al.
Publicado: (2023)

Bayesian scaling laws for in-context learning
por: Arora, Aryaman, et al.
Publicado: (2024)

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

Matching walks that are minimal with respect to edge inclusion
por: Marsault, Victor
Publicado: (2024)

Active Automata Learning with Advice
por: Fica, Michał, et al.
Publicado: (2025)

Learning Tree Automata with Term Rewriting
por: Kopystiański, Jakub, et al.
Publicado: (2026)

Homomorphism Problems in Graph Databases and Automatic Structures
por: Morvan, Rémi
Publicado: (2025)

Complex event recognition under time constraints: towards a formal framework for efficient query evaluation
por: García, Julián, et al.
Publicado: (2025)

FC-Datalog as a Framework for Efficient String Querying
por: Bell, Owen M., et al.
Publicado: (2025)

Complex event recognition meets hierarchical conjunctive queries
por: Pinto, Dante, et al.
Publicado: (2024)

A Trichotomy for Regular Trail Queries
por: Martens, Wim, et al.
Publicado: (2019)

Distinct Shortest Walk Enumeration for RPQs
por: David, Claire, et al.
Publicado: (2023)

A formal query language and automata model for aggregation in complex event recognition
por: Bourhis, Pierre, et al.
Publicado: (2026)

Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration
por: Gawrychowski, Pawel, et al.
Publicado: (2024)

Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
por: Figueira, Diego, et al.
Publicado: (2022)

A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata
por: Amarilli, Antoine, et al.
Publicado: (2024)

Dynamic direct access of MSO query evaluation over strings
por: Bourhis, Pierre, et al.
Publicado: (2024)

Systems of Graph Formulas and their Equivalence to Alternating Graph Automata
por: Drewes, Frank, et al.
Publicado: (2025)

Finite Automata for Efficient Graph Recognition
por: Drewes, Frank, et al.
Publicado: (2024)

Complex Event Recognition with Symbolic Register Transducers: Extended Technical Report
por: Alevizos, Elias, et al.
Publicado: (2024)

Exact Separation of Words via Trace Geometry
por: Chen, Zeyu, et al.
Publicado: (2026)

Minimality Notions via Factorization Systems and Examples
por: Wißmann, Thorsten
Publicado: (2022)

Extended Stone Duality via Monoidal Adjunctions
por: Lenke, Fabian, et al.
Publicado: (2024)

The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective
por: Bergsträßer, Pascal, et al.
Publicado: (2024)

Alloy-Driven Verification of Object-Centric Event Data: From Temporal Logic to Knowledge Graphs
por: Latif, Saba, et al.
Publicado: (2025)

Characterizing normality via automata and random matrix products
por: Bienvenu, Laurent, et al.
Publicado: (2026)

Time for Quiescence: Modelling quiescent behaviour in testing via time-outs in timed automata
por: Briones, Laura Brandán, et al.
Publicado: (2025)

Generalised Arc Consistency via the Synchronised Product of Finite Automata wrt a Constraint
por: Beldiceanu, Nicolas
Publicado: (2025)

MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm
por: Akshay, S., et al.
Publicado: (2024)

Reasoning about Rare-Event Reachability in Stochastic Vector Addition Systems via Affine Vector Spaces
por: Jeppson, Joshua, et al.
Publicado: (2025)

Unveiling the connection between the Lyndon factorization and the Canonical Inverse Lyndon factorization via a border property
por: Bonizzoni, Paola, et al.
Publicado: (2024)

Composition Machines: Programming Self-Organising Software Models for the Emergence of Sequential Program Spaces
por: Arellanes, Damian
Publicado: (2021)

LTL-Constrained Policy Optimization with Cycle Experience Replay
por: Shah, Ameesh, et al.
Publicado: (2024)

A General Information Extraction Framework Based on Formal Languages
por: Schmid, Markus L.
Publicado: (2025)