[ABS15] Antoine Amarilli, Pierre Bourhis, Pierre Senellart.
Provenance Circuits for Trees and Treelike Instances.
In Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, Lecture Notes in Computer Science, 56–68. Springer, 2015.
doi:10.1007/978-3-662-47666-6\_5, URL: https://doi.org/10.1007/978-3-662-47666-6_5. [1]
[Ame84] K. Amer.
Equationally complete classes of commutative monoids with monus.
Algebra Universalis, 18(1):129-131, 1984. [1][2]
[ADT11b] Yael Amsterdamer, Daniel Deutch, Val Tannen.
Provenance for aggregate queries.
In Maurizio Lenzerini, Thomas Schwentick, editors, Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2011, June 12-16, 2011, Athens, Greece, 153–164. ACM, 2011.
doi:10.1145/1989284.1989302, URL: https://doi.org/10.1145/1989284.1989302. [1][2]
[GT17] Todd J. Green, Val Tannen.
The Semiring Framework for Database Provenance.
In Emanuel Sallinger, Jan Van den Bussche, Floris Geerts, editors, Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14-19, 2017, 93–99. ACM, 2017.
doi:10.1145/3034786.3056125, URL: https://doi.org/10.1145/3034786.3056125. [1][2][3][4][5][6][7][8]