Refactor shard search related fields from DistTableCacheEntry
Open
1-2 days
technical debt
- Dominant language
- C
- Stars
- 12.8k
- Forks
- 794
- Avg merge
- 2d 14h
- Merged PRs (30d)
- 31
Description
We need to search for shards in scenarios where we don't really have a real relation, e.g. https://github.com/citusdata/citus/pull/3329. If we refactor shard search related fields from `DistTableCacheEntry` into a struct `ShardingInfo`, then we can use it as the 2nd argument for `FindShardInterval()` and do shard search without a need for a real relation.
Contributor guide
Research direction
Start by tracing DistTableCacheEntry and FindShardInterval(), then review the shard-search scenario described in pull request 3329. The refactor is complete when shard-search fields are represented by ShardingInfo and FindShardInterval() can search shards without requiring a real relation.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- c, postgresql
- Domain
- databases, distributed-systems
- Issue type
- Refactor
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100