sql server - Recursion On A Many To Many Table Parent To Child To Parent -


my boss has given me single table.

 related_items_table  item        | accessory  --------------------- tv          | antennae  tv          | power cord  tv          | remote  laptop      | power cord  laptop      | carrying case  camera      | carrying case  camera      | lens  ipod        | headphones 

the best way describe boss wants results walk through process.

  1. the user searches tv.

  2. tv found , accessories tv antennae, power cord & remote.

  3. the accessories antennae, power cord & remote used find other related items. power cord accessory laptop. antennae & remote not accessories other item.

  4. the item laptop used find item's accessories, power cord & carrying case.

  5. the accessories power cord & carrying case used find other related items. power cord finds no new items (we know power cord associated tv & laptop). carrying case accessory camera.

  6. the item camera used find item's accessories, carrying case & lens.

  7. the accessories carrying case & lens used find other related items. carrying case & lens find no new items (we know carrying case associated laptop).

  8. no new items found continue search chain. final list returned.

 final list   item        | accessory  --------------------- tv          | antennae  tv          | power cord  tv          | remote  laptop      | power cord  laptop      | carrying case  camera      | carrying case  camera      | lens  

what best way handle problem? i'm not sure correct terminology perhaps missed in searches. advice appreciated.

it looks table presents undirected graph , need traverse graph starting item user searched.

consider using breadth-first search (bfs) algorithm.

every visited node resulting list need.


Comments

Popular posts from this blog

Java 3D LWJGL collision -

spring - SubProtocolWebSocketHandler - No handlers -

methods - python can't use function in submodule -