DBScholar

Back to papers

Graph Indexing: A Frequent Structure-based Approach

Summary: gIndex uses frequent substructures as the indexing feature, replacing path-based graph indexing. It yields ~10× smaller index and 3–10× faster queries than GraphGrep, with stable updates; extends to sequences/trees, illustrating mining-based indexing. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3592
Venue
SIGMOD
Year
2004
Pagerank
0.00027100548
Overall Rank
177 | 98.79%
DOI
10.1145/1007568.1007607

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{yan_sigmod04,
        title = {{Graph Indexing: A Frequent Structure-based Approach}},
        author = {Yan, Xifeng and Yu, Philip S. and Han, Jiawei},
        series = {{SIGMOD} '04},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1007568.1007607},
        url = {https://dl.acm.org/doi/10.1145/1007568.1007607},
        year = {2004}
}

Incoming Citations (Sorted by Pagerank)

Showing 12 of 62 citing papers.

Previous Page 2 / 2 Next

Outgoing Citations (Sorted by Pagerank)

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