DBScholar

Back to papers

Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries

Summary: Degree-aware heavy/light framework for static and dynamic evaluation of hierarchical queries with arbitrary free variables, trading preprocessing, update time, and enumeration delay via a tunable light/heavy threshold. Recovers prior bounds and, for a restricted subclass, achieves OMv‑conditioned worst-case optimal update time and enumeration delay. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1809
Venue
PODS
Year
2020
Pagerank
7.7210541e-05
Overall Rank
3,136 | 78.49%
DOI
10.1145/3375395.3387646

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{kara_pods20,
        address = {New York, NY, USA},
        series = {{PODS} '20},
        title = {{Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries}},
        url = {https://dl.acm.org/doi/10.1145/3375395.3387646},
        doi = {10.1145/3375395.3387646},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Kara, Ahmet and Nikolic, Milos and Olteanu, Dan and Zhang, Haozhe},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 14 of 14 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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