DeepAI AI Chat
Log In Sign Up

Puzzling over Subsequence-Query Extensions: Disjunction and Generalised Gaps

by   André Frochaux, et al.

A query model for sequence data was introduced in [11] in the form of subsequence-queries with wildcards and gap-size constraints (swg-queries, for short). These queries consist of a pattern over an alphabet of variables and types, as well as a global window size and a number of local gap-size constraints. We propose two new extensions of swg-queries, which both enrich the expressive power of swg-queries in different ways: subsequence-queries with generalised gap-size constraints (swgg-queries, for short) and disjunctive subsequence-queries (dswg-queries, for short). We discuss a suitable characterisation of containment, a classical property considered in database theory, and adapt results concerning the discovery of swg-queries to both, swgg-queries and dswg-queries.


page 1

page 2

page 3

page 4


A Monotone Preservation Result for Boolean Queries Expressed as a Containment of Conjunctive Queries

When a relational database is queried, the result is normally a relation...

Understanding Quantum Algorithms via Query Complexity

Query complexity is a model of computation in which we have to compute a...

A Comprehensive Trainable Error Model for Sung Music Queries

We propose a model for errors in sung queries, a variant of the hidden M...

The Complexity of Why-Provenance for Datalog Queries

Explaining why a database query result is obtained is an essential task ...

Mastermind with a Linear Number of Queries

Since the 60's Mastermind has been studied for the combinatorial and inf...

Extending Shinohara's Algorithm for Computing Descriptive (Angluin-Style) Patterns to Subsequence Patterns

The introduction of pattern languages in the seminal work [Angluin, “Fin...