DBScholar

Back to papers

Towards Graph Containment Search and Indexing

Summary: Studies reverse containment search—retrieving g where q contains g—and its distinct indexing requirements. cIndex selects redundancy-aware contrast subgraphs (NP-hard; greedy 1−1/e), extending to hierarchical indexes with near-optimal pruning. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
9833
Venue
VLDB
Year
2007
Pagerank
8.745748e-05
Overall Rank
2,328 | 84.03%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{chen_vldb07,
        title = {{Towards Graph Containment Search and Indexing}},
        author = {Chen, Chen and Yan, Xifeng and Yu, Philip S. and Han, Jiawei and Zhang, Dong-Qing and Gu, Xiaohui},
        journal = {PVLDB},
        series = {{VLDB} '07},
        pages = {926--937},
        year = {2007}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Previous Page 1 / 1 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