Database Paper Browser

Back to papers

Connectivity-Oriented Property Graph Partitioning for Distributed Graph Pattern Query Processing

Summary: RCP partitions graphs by weakly connected components per relationship label to reduce crossing matches in variable-length path and labeled-pattern queries. It enables independent execution of basic and extended queries, with Neo4j/JanusGraph prototypes achieving nearly 100× speedups on billion-scale data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6978
Venue
SIGMOD
Year
2024
Pagerank
4.1945683e-05
Overall Rank
10,984 | 23.59%
DOI
10.1145/3698804

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,308 Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching 2026 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers