Preferential Regular Path Queries

13 years 2 months ago
Preferential Regular Path Queries
In this paper, we introduce preferential regular path queries. These are regular path queries whose symbols are annotated with preference weights for "scaling" up or down the intrinsic importance of matching a symbol against a (semistructured) database edge label. Annotated regular path queries are expressed syntactically as annotated regular expressions. We interpret these expressions in a uniform semiring framework, which allows different semantic interpretations for the same syntactic annotations. For our preference queries, we study three important aspects: (1) (progressive) query answering (2) (certain) query answering in LAV data-integration systems, and (3) query containment and equivalence. In all of these, we obtain important positive results, which encourage the use of our preference framework for enhanced querying of semistructured databases.
Gösta Grahne, Alex Thomo, William W. Wadge
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where FUIN
Authors Gösta Grahne, Alex Thomo, William W. Wadge
Comments (0)