Pages that link to "Item:Q1245699"

The following pages link to On the expressive power of the relational algebra (Q1245699):

Displaying 11 items.

• The complexity of higher-order queries (Q498405) (← links)
• Procedural languages for database queries and updates (Q751799) (← links)
• Structural characterizations of the navigational expressiveness of relation algebras on a tree (Q896017) (← links)
• On database query languages for K-relations (Q975870) (← links)
• An alternative way to represent the cogroup of a relation in the context of nested databases (Q1124381) (← links)
• Computable queries for relational data bases (Q1151060) (← links)
• A comparison between algebraic query languages for flat and nested databases (Q1177142) (← links)
• The powerset algebra as a natural tool to handle nested database relations (Q1198662) (← links)
• The expressive power of stratified logic programs with value invention (Q1281496) (← links)
• On the expressive power of the relational algebra with partially ordered domains (Q4951743) (← links)
• First-order definable counting-only queries (Q5919275) (← links)