We have a website today that help people swap objects with each other.
Each object has a specification and some criteria.
We are presenting this in direct (2 people), triangle (3 people) and rectangle (4 people) swaps.
**Example of directswap:**
Object: A > B > A (A get B, B get A)
**Example of triangleswap:**
Object: A > B > C > A (A get B, B get C, C get A).
**Example of rectangleswap:**
Object: A > B > C > D > A (A get B, B get C, C get D, D get A).
**How we do it today:**
We find matches between object A and B and save all this in a 1 to 1 table.
After this we can do joins to get all direct-, triangel- and rectanglechains.
This is obviously a time consuming task if we have like [url removed, login to view] objects to see who matches who, and build chains from it.
We want to be able to instantly see these chains without having to do all the joins and if one object is changed, it need to rematch almost everything.
We need a solution in C# and Microsoft SQL Server xxxx and about [url removed, login to view] objects. The change of object and to get a list of all direct, triangle and rectangle chains available for an object must be done to counting MS, not taking 5 seconds.
The one who can come up with a mindblowing idea that uses very little resources for this to be run (we're talking MS to get the results and also when you change an object) will be paid.
Thanks in advance =)