Efficient Subgraph Matching by Postponing Cartesian Products

Authors

• 1. Fei Bi (University of New South Wales)
• 2. Lijun Chang (University of New South Wales)
• 3. Xuemin Lin (University of New South Wales)
• 4. Lu Qin (University of Technology Sydney)
• 5. Wenjie Zhang (University of New South Wales)

@inproceedings{bi_sigmod16,
        title = {{Efficient Subgraph Matching by Postponing Cartesian Products}},
        author = {Bi, Fei and Chang, Lijun and Lin, Xuemin and Qin, Lu and Zhang, Wenjie},
        series = {{SIGMOD} '16},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2882903.2915236},
        url = {https://dl.acm.org/doi/10.1145/2882903.2915236},
        year = {2016}
}

Incoming Citations (Sorted by Pagerank)

Showing 50 of 75 citing papers.

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.

Semantically Similar Papers