Relative expressive power of navigational querying on graphs using transitive closure (Q4644599)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Relative expressive power of navigational querying on graphs using transitive closure |
scientific article; zbMATH DE number 6998034
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relative expressive power of navigational querying on graphs using transitive closure |
scientific article; zbMATH DE number 6998034 |
Statements
Relative expressive power of navigational querying on graphs using transitive closure (English)
0 references
8 January 2019
0 references
databases
0 references
relational algebra
0 references
query languages
0 references
0.9412378668785096
0 references
0.9312609434127808
0 references
0.9106559753417968
0 references
0.7689159512519836
0 references
0.7420711517333984
0 references
