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

Test push.

master
Aaron Huber 2020-06-09 17:27:07 -04:00
parent e8dc43e66b
commit a892a91480
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
prob_def.tex
View File

@ -1,7 +1,7 @@
% -*- root: main.tex -*-
\section{Problem Definition}
\label{sec:prob-def}
Our work involves overcoing the exponential computation time that it takes to compute world existence for a given tuple $\tup$ by estimating in polynomial time the same quantity within an ($\epsilon$, $\delta$) range. We employ the technique of sketching to obtain these results.
Our TESTING ! AND 2ork involves overcoing the exponential computation time that it takes to compute world existence for a given tuple $\tup$ by estimating in polynomial time the same quantity within an ($\epsilon$, $\delta$) range. We employ the technique of sketching to obtain these results.
The setting on which our work applies is as follows. First, we are given a database $\db$. We limit ourselves to positive queries. A positive query $\query$ is a query composed from the following set of operators: selection ($\selection$), projection ($\projection$), join/cross-product ($\join$), and union ($\union$), abbreviated as SPJU. Given database $\db$, a query Q performs its operations upon all the rows belonging to the tables it involves.