A palindromic substring T[i..j] of a string T is said to be a shortest unique palindromic substring (SUPS) in T for an interval [p, q] if T[i..j] is a shortest palindromic substring such that T[i..j] occurs only once in T, and [i, j] contains [p, ...
We present GeX for the approximate matching of complex queries on graph-modeled data.GeX generalizes existing approaches and allows for querying any graph-based datasets.GeX query language supports queries ranging from keyword-based to complex ones.GeX ...
Ontology-based data access is concerned with querying incomplete data sources in the presence of domain-specific knowledge provided by an ontology. A central notion in this setting is that of an ontology-mediated query, which is a database query coupled ...
Springer-Verlag
Berlin, Heidelberg