DBScholar

Back to papers

Worst Case Optimal Joins on Relational and XML data

Summary: Proposes a multi-model framework for relational and XML data and a worst-case optimal join algorithm. Guarantees intermediate results do not exceed the worst-case join bound, with preliminary results showing speedups over baseline methods. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5503
Venue
SIGMOD
Year
2018
Pagerank
5.093636e-05
Overall Rank
11,907 | 18.31%
DOI
10.1145/3183713.3183721

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{chen_sigmod18,
        title = {{Worst Case Optimal Joins on Relational and XML data}},
        author = {Chen, Yuxing},
        series = {{SIGMOD} '18},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3183713.3183721},
        url = {https://dl.acm.org/doi/10.1145/3183713.3183721},
        year = {2018}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
411 Worst-case Optimal Join Algorithms 2012 PODS 0.00018902089
4,294 From Region Encoding To Extended Dewey: On Efficient Processing of XML Twig Pattern Matching 2005 VLDB 6.7780241e-05
Previous Page 1 / 1 Next

Semantically Similar Papers