Abstract
The class of fully generic queries on complex objects was introduced by Beeri, Milo and Ta-Shma in 1997. Such queries are still relevant as they capture the class of manipulations on nested big data, where output can be generated without a need for looking in detail at, or comparing, the atomic data elements. Unfortunately, the class of fully generic queries is rather poorly understood. We review the big open questions and formulate some partial answers.
Cite
CITATION STYLE
Surinx, D., Van den Bussche, J., & Virtema, J. (2019). Fully Generic Queries: Open Problems and Some Partial Answers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11815 LNCS, pp. 20–31). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-32065-2_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
