...
Fetch descendants | Omit Descendants | Direct Descendants | All Descendants |
---|---|---|---|
Query | //openroadm-device[@device-id="C201-7-1A-14"] | ||
Graph | |||
Time Complexity | Linear on total number of fragments in database | Linear on total number of fragments in database | Linear on total number of fragments in database |
Comments | These operations are as fast as reading with getDataNodes API. |
Query one device out of many using descendant cps path
...
Fetch descendants | Omit Descendants | Direct Descendants | All Descendants |
---|---|---|---|
Query | //openroadm-device[@device-id="C201-7-1A-14"] | ||
Graph | |||
Time Complexity | Linear on total number of fragments in database | Linear on total number of fragments in database | Linear on total number of fragments in database |
Comments | These operations are as fast as reading with getDataNodes API. |
Query all devices using absolute cps path
...
Fetch descendants | Omit Descendants | Direct Descendants | All Descendants |
---|---|---|---|
Query | /openroadm-devices/openroadm-device[@status="success"] | ||
Graph | |||
Time Complexity | Linear on the amount of fragments returned from query | Linear on the amount of fragments returned from query | Linear on the amount of fragments returned from query |
Comments | This operation is around half the speed as getDataNodes. | This operation is around half the speed as getDataNodes. | This has same speed as reading with getDataNodes. |
Query all devices using descendant cps path
...
Fetch descendants | Omit Descendants | Direct Descendants | All Descendants |
---|---|---|---|
Query | //openroadm-device[@ne-state="inservice"] | ||
Graph | |||
Time Complexity | Linear on the amount of fragments returned from query | Linear on the amount of fragments returned from query | Linear on the amount of fragments returned from query |
Comments | This operation is around half the speed as getDataNodes. | This operation is around half the speed as getDataNodes. | This has same speed as reading with getDataNodes. |
Commentary
Suggested improvement: For absolute cps path queries, the complexity can be reduced to best-case constant time (so it is no longer linear on the total number of fragments in the database).
...