ODIn
/
paper-BagRelationalPDBsAreHard
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Done with my pass

master
Atri Rudra 2021-09-20 18:16:25 -04:00
parent 13f711abb3
commit c17d3e468e
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
conclusions.tex
View File

@ -12,7 +12,7 @@ We show that under various parameterized complexity hardness results/conjectures
We prove that it is possible to approximate the expectation of a lineage polynomial in linear time
% When only considering polynomials for result tuples of
in the deterministic query processing over TIDBs and BIDBs (assuming that there are few cancellations).
Interesting directions for future work include development of a dichotomy for bag \abbrPDB\xplural. While we can handle higher moments (this follows fairly easily from our existing results-- see \Cref{app:sec-cicuits}), more general approximations are an interesting area for exploration, including those for more general data models. % beyond what we consider in this paper.
Interesting directions for future work include development of a dichotomy for bag \abbrPDB\xplural. While we can handle higher moments (this follows fairly easily from our existing results-- see \Cref{sec:momemts}), more general approximations are an interesting area for exploration, including those for more general data models. % beyond what we consider in this paper.
% Furthermore, it would be interesting to see whether our approximation algorithm can be extended to support queries with negations, perhaps using circuits with monus as a representation system.
% \BG{I am not sure what interesting future work is here. Some wild guesses, if anybody agrees I'll try to flesh them out: