Pometry / Pometry/Raphtory

Nested edge collections: lazy fetch and paging

Open
#2,725 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Dominant language
Rust
Stars
642
Forks
70
Avg merge
2d 13h
Merged PRs (30d)
21

Description

RemoteNestedEdges currently fetches eagerly and whole; on any remotely big graph this blows up. Needs lazy evaluation and paging support end to end. Server paging fields exist for flat collections; the nested shape needs design.

Raised in review:

Contributor guide

Open the contributing guide

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

Start with RemoteNestedEdges and the existing server paging fields for flat collections. Read the linked pull request discussions to understand the requested lazy behavior and paging concerns, then define how paging should work for nested collections end to end. Done means large remote graphs no longer require eager, whole-collection fetching.

Written by the indexing model from the issue text.

Assessment

Tech stack
rust
Domain
databases, distributed-systems
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Active
Clarity
Needs clarification
Newbie friendliness
30/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.