JanusGraph / JanusGraph/janusgraph

Implement multi-range slice queries for CQL storage implementation

Open
#3,816 6 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

area/core kind/performance storage/cassandra
Dominant language
Java
Stars
5.8k
Forks
1.2k
Avg merge
13h 53m
Merged PRs (30d)
6

Description

Discussion: #3812

As for now JanusGraph can fetch requested properties either using a separate slice query per each property or using a single slice query to fetch all vertex properties. The user should always weight pros and cons of each approach and decide how they want to fetch those properties.
With multiple ranges per single slice query it will be possible to fetch only requested set of properties in a single slice query. Thus, the user won't need to decide between trade-offs of each solution.

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 by reading the linked discussion in #3812 and then locate the CQL storage implementation in the JanusGraph repository. The goal is a single slice query that supports multiple ranges and fetches only the requested properties, rather than requiring one query per property or one query for all properties.

Written by the indexing model from the issue text.

Assessment

Tech stack
cassandra, java
Domain
databases
Issue type
Feature
Difficulty
4/5
Estimated time
3-5 days
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
35/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.