A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
A Theoretical View on Reverse Engineering Problems for Database Query Languages
2019
International Workshop on Description Logics
A typical reverse engineering problem for a query language L is as follows: Given a database D and two sets P and N of tuples over D labeled as positive and negative examples, respectively, is there a query q in L that explains P and N , i.e., the evaluation of q on D contains all positive examples in P and none of the negative examples in N ? Applications of reverse engineering problems include database explanations, data exploration, data security, relational classifier engineering, and the
dblp:conf/dlog/Barcelo19
fatcat:njioppv77fedfiwcff6krs7zy4