Image de couverture de livre

Skyline Operators for Document Spanners

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Amarilli, Antoine, Kimelfeld, Benny, Labbé, Sébastien, Mengel, Stefan
Format:	Preprint
Publié:	2023
Sujets:	Databases Formal Languages and Automata Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Unifying Perspective on Succinct Data Representations
par: Kimelfeld, Benny, et autres
Publié: (2023)

The Complexity of Aggregates over Extractions by Regular Expressions
par: Doleschal, Johannes, et autres
Publié: (2020)

A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity
par: Mengel, Stefan, et autres
Publié: (2024)

Out-of-Order Membership in Regular Languages
par: Amarilli, Antoine, et autres
Publié: (2026)

Refl-Spanners: A Purely Regular Approach to Non-Regular Core Spanners
par: Schmid, Markus L., et autres
Publié: (2020)

Locality and Centrality: The Variety ZG
par: Amarilli, Antoine, et autres
Publié: (2021)

Designing and Comparing RPQ Semantics
par: Marsault, Victor, et autres
Publié: (2026)

Locality Testing for NFAs is PSPACE-complete
par: Amarilli, Antoine, et autres
Publié: (2025)

Dynamic direct access of MSO query evaluation over strings
par: Bourhis, Pierre, et autres
Publié: (2024)

On the Complexity of Language Membership for Probabilistic Words
par: Amarilli, Antoine, et autres
Publié: (2025)

A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata
par: Amarilli, Antoine, et autres
Publié: (2024)

A framework for extraction and transformation of documents
par: Riveros, Cristian, et autres
Publié: (2024)

MSO-Enumeration Over SLP-Compressed Unranked Forests
par: Lohrey, Markus, et autres
Publié: (2024)

Constant-Time Dynamic Enumeration of Word Infixes in a Regular Language
par: Amarilli, Antoine, et autres
Publié: (2026)

Dynamic Membership for Regular Tree Languages
par: Amarilli, Antoine, et autres
Publié: (2025)

Linear Time Subsequence and Supersequence Regex Matching
par: Amarilli, Antoine, et autres
Publié: (2025)

Matching walks that are minimal with respect to edge inclusion
par: Marsault, Victor
Publié: (2024)

Operational State Complexity of Block Languages
par: Duarte, Guilherme, et autres
Publié: (2024)

Distinct Shortest Walk Enumeration for RPQs
par: David, Claire, et autres
Publié: (2023)

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

Complex event recognition under time constraints: towards a formal framework for efficient query evaluation
par: García, Julián, et autres
Publié: (2025)

Complex event recognition meets hierarchical conjunctive queries
par: Pinto, Dante, et autres
Publié: (2024)

FC-Datalog as a Framework for Efficient String Querying
par: Bell, Owen M., et autres
Publié: (2025)

A Trichotomy for Regular Trail Queries
par: Martens, Wim, et autres
Publié: (2019)

A formal query language and automata model for aggregation in complex event recognition
par: Bourhis, Pierre, et autres
Publié: (2026)

Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration
par: Gawrychowski, Pawel, et autres
Publié: (2024)

Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
par: Figueira, Diego, et autres
Publié: (2022)

Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques
par: Kiefer, Stefan, et autres
Publié: (2019)

The complexity of reachability problems in strongly connected finite automata
par: Kiefer, Stefan, et autres
Publié: (2025)

Well-Behaved (Co)algebraic Semantics of Regular Expressions in Dafny
par: Zetzsche, Stefan, et autres
Publié: (2024)

A Usage-Aware Sequent Calculus for Differential Dynamic Logic
par: Dotzel, Myra, et autres
Publié: (2023)

Nominal Automata with Name Deallocation
par: Prucker, Simon, et autres
Publié: (2026)

Extended Stone Duality via Monoidal Adjunctions
par: Lenke, Fabian, et autres
Publié: (2024)

Soft state reduction of fuzzy automata over residuated lattices
par: Nguyen, Linh Anh, et autres
Publié: (2025)

Improving Unstructured Data Quality via Updatable Extracted Views
par: Kassaie, Besat, et autres
Publié: (2025)

The Expansion Problem for Infinite Trees
par: Blumensath, Achim
Publié: (2023)

Mata, a Fast and Simple Finite Automata Library (Technical Report)
par: Chocholatý, David, et autres
Publié: (2023)

Simulation Limitations of Affine Cellular Automata
par: Hudcová, Barbora, et autres
Publié: (2023)

On the Expressive Power of Regular Expressions with Backreferences
par: Nogami, Taisei, et autres
Publié: (2023)

Safety and Liveness of Quantitative Properties and Automata
par: Boker, Udi, et autres
Publié: (2023)