Download now Free registration required
In this paper, the authors 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 (semi-structured) database edge label. Annotated regular path queries are expressed syntactically as annotated regular expressions. They interpret these expressions in a uniform semiring framework, which allows different semantic interpretations for the same syntactic annotations. For their preference queries, they study three important aspects: (progressive) query answering, (certain) query answering in LAV data-integration systems, and query containment and equivalence.
- Format: PDF
- Size: 266.8 KB