[PERF] Investigate optimizations for large graphs
- Dominant language
- C#
- Stars
- 10.9k
- Forks
- 2.1k
- Avg merge
- 13h 56m
- Merged PRs (30d)
- 351
Description
See this twitter thread for reference: https://twitter.com/neuecc/status/1589902671540256771?s=20&t=AcVRk8mwSdMyQJT2c5jyDg
Note: we could also consider avoiding reference tracking for types by default. There are some complexities involved, like what do you do with built-in types, eg `string`, `byte[]`, `List`. You could potentially have ref-tracking variants of the codecs or pass a reference tracking preference to the codec and have an attribute per-property to indicate a reference tracking preference.
Contributor guide
Research direction
Start by reading the linked Twitter thread and the issue notes about reference tracking, codecs, and built-in types. No files or tests are named; done would require a defined optimization scope and measurable acceptance criteria before implementation.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- csharp
- Domain
- distributed-systems, performance
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100