DBScholar

Back to papers

Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query

Summary: Vertex-constrained Multi Subgraph Matching Query (vMSQ) scheduling for parallel processing of multiple subgraph queries. Proposes a load-balanced, computation-sharing aware schedule to maximize cross-query reuse of subgraph matches during graph pattern matching. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5903
Venue
SIGMOD
Year
2020
Pagerank
5.1685424e-05
Overall Rank
10,050 | 31.05%
DOI
10.1145/3318464.3384409

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{hao_sigmod20,
        title = {{Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query}},
        author = {Hao, Kongzhang and Lai, Longbin},
        series = {{SIGMOD} '20},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3318464.3384409},
        url = {https://dl.acm.org/doi/10.1145/3318464.3384409},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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