Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity (Q4598259)
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: Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity |
scientific article; zbMATH DE number 6820306
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity |
scientific article; zbMATH DE number 6820306 |
Statements
19 December 2017
0 references
graphs with data
0 references
regular data path queries
0 references
expressiveness
0 references
query evaluation
0 references
complexity
0 references
Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity (English)
0 references
0.8582941
0 references
0.8476156
0 references
0.8426362
0 references
0.84106517
0 references
0.8364502
0 references
0.8364502
0 references
0 references
0.8332044
0 references
0.83222497
0 references
