Potential to make FastComparison actually fast
Nobody has claimed this yet.
- Dominant language
- C#
- Stars
- 460
- Forks
- 29
- Avg merge
- 4d 9h
- Merged PRs (30d)
- 7
Description
I my testing FastComparision always takes at least 2 seconds.
I was looking at the number of queries issued during "FastComparison" and noticed the following:
- 62 batches executed
- 10 duplicated batches (2 or 3 executions each)
- including one huge 6000 line schema query with multiple result sets!
I think there should be potential to avoid some of these in the context of "FastComparision"
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reproducing the reported FastComparison run and capturing its batch count, duplicate executions, schema-query duration, and total latency. Trace the FastComparison entry point and query-generation or execution path to identify why batches repeat. Done means a measured reduction in redundant work and regression coverage for the observed behavior.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- csharp, sql
- Domain
- databases, performance
- Issue type
- Bug
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Quiet
- Clarity
- Needs clarification
- Newbie friendliness
- 35/100