DBScholar

Back to papers

ZipG: A Memory-efficient Graph Store for Interactive Queries

Summary: ZipG is a distributed, memory-efficient graph store that runs interactive queries on a compressed graph representation. Minimal but rich API; TAO/LinkBench/Graph Search workloads; up to 23x throughput vs Neo4j/Titan on a 244 GB node, with similar gains in distributed settings. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5450
Venue
SIGMOD
Year
2017
Pagerank
6.2659893e-05
Overall Rank
5,322 | 63.49%
DOI
10.1145/3035918.3064012

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{khandelwal_sigmod17,
        title = {{ZipG: A Memory-efficient Graph Store for Interactive Queries}},
        author = {Khandelwal, Anurag and Yang, Zongheng and Ye, Evan and Agarwal, Rachit and Stoica, Ion},
        series = {{SIGMOD} '17},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3035918.3064012},
        url = {https://dl.acm.org/doi/10.1145/3035918.3064012},
        year = {2017}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 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