...
As can be seen in the cases below, the existing algorithm using regex has linear time complexity , based on the the size of the databasefragment table. The new algorithm is constant time.
- For querying 1 out of many nodes, existing algorithm is linear time (linear on fragment table size).
- For querying 1 out of many nodes, new algorithm is constant time.
- For querying many out of many all nodes, existing algorithm is quadratic on fragment table size.
- For querying many out of many all nodes, new algorithm is linear on fragment table size.
- In all cases, there is an easily observed massive reduction in query duration using new algorithm.
...