Enumeration on Trees with Tractable Combined Complexity and Efficient Updates

Authors

• 1. Antoine Amarilli (Télécom Paris; University of Paris)
• 2. Pierre Bourhis (CNRS; CRIStAL (Research Center in Computer Science, Signal and Automatic Control, Lille); INRIA)
• 3. Stefan Mengel (CNRS; CRIL (Research Center in Computer Science of Lens))
• 4. Matthias Niewerth (University of Bayreuth)

@inproceedings{amarilli_pods19,
        address = {New York, NY, USA},
        series = {{PODS} '19},
        title = {{Enumeration on Trees with Tractable Combined Complexity and Efficient Updates}},
        url = {https://dl.acm.org/doi/10.1145/3294052.3319702},
        doi = {10.1145/3294052.3319702},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Amarilli, Antoine and Bourhis, Pierre and Mengel, Stefan and Niewerth, Matthias},
        year = {2019}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Semantically Similar Papers