Migrated back to default spacing for table/caption figures; added macro to adjust if needed.

introduction.tex

@@ -49,10 +49,12 @@ An $\raPlus$ query is a query expressed in positive relational algebra, i.e., us
 	          &\qquad\cdot\polyqdt{\query_2}{\gentupset}{\project_{\attr{\query_2}}{\tup}}
           \end{aligned}
 	\end{align*}%\\[-10mm]
-	\setlength{\abovecaptionskip}{-0.25cm}
+	%\setlength{\abovecaptionskip}{-0.25cm}
+	\savecaptionspace{
 	\caption{Lineage polynomial semantics given $\raPlus$ query $\query$, arbitrary deterministic database $\gentupset$ with variables $\inparen{X_\tup}_{\tup \in\gentupset}$, where for $\rel\in\gentupset$, $\tup\in\rel$, the base case is $\polyqdt{\rel}{\gentupset}{\tup} = X_\tup$.}% for any $\rel\in\gentupset$ and $\tup\in\rel$.}% consists of all $X_\tup$ over all $\rel$ in $\gentupset$ and $\tup$ in $\rel$, such that the base case $\polyqdt{\rel}{\gentupset}{\tup} = X_\tup$.} %Here $\gentupset.\rel$ denotes the instance of relation $\rel$ in $\gentupset$.  Please note, after we introduce the reduction to $1$-\abbrBIDB, the base case will be expressed alternatively.  The base case is $\polyqdt{\rel}{\gentupset}{\tup} = X_\tup$}
 	\label{fig:nxDBSemantics}
-	\vspace{-0.53cm}
+	}{\abovecapshrink}{\belowcapshrink}
+	%\vspace{-0.53cm}
 \end{figure}
 
 As also observed in \cite{https://doi.org/10.48550/arxiv.2201.11524}, computing the expected multiplicity of a result tuple in a bag probabilistic database is the analog of the marginal probability in a set \abbrPDB.
@@ -92,10 +94,12 @@ $\omega\inparen{\inparen{\qruntime{\optquery{\qhard}, \tupset, \bound}}^{C_0}}$
 $\Omega\inparen{\inparen{\qruntime{\optquery{\qhard}, \tupset, \bound}}^{c_0\cdot k}}$ for {\em some} $c_0>0$ & Multiple & \Cref{conj:known-algo-kmatch}\\
 \hline
 \end{tabular}
+\savecaptionspace{
 \caption{Our lower bounds for $\qhard$ parameterized by $k$ $\inparen{\Cref{sec:hard:sub:pre}}$ over \abbrCTIDB $\pdb$.  % = \inset{\worlds, \bpd}$.
 Those with `Multiple' in the second column need the algorithm to be able to handle multiple $\bpd$.  See~\Cref{sec:hard} for further details.}%, i.e. probability distributions (for a given $\tupset$). The last column states the hardness assumptions that imply the lower bounds in the first column ($\eps_o,C_0,c_0$ are constants that are independent of $k$).}
 \label{tab:lbs}
-\vspace{-0.73cm}
+}{0cm}{-0.73cm}
+%\vspace{-0.73cm}
 \end{table*}
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

macros.tex

@@ -46,6 +46,15 @@
 \newtheorem{hypo}[Theorem]{Conjecture}%used in mult_distinct_p.tex
 \newtheorem{Problem}[Theorem]{Problem}
 
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+%Figure/Caption space saving
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+\newtoggle{shrinkspace}
+\dimdef{\abovecapshrink}{-0.25cm}
+\dimdef{\belowcapshrink}{-0.53cm}
+%Uncomment the following if we want to save caption space
+%\toggletrue{shrinkspace}
+\newcommand{\savecaptionspace}[3]{\iftoggle{shrinkspace}{\setlength{\abovecaptionskip}{#2}#1\vspace{#3}}{#1}}
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 % Rel model

main.tex

@@ -67,6 +67,7 @@ sensitive=true
 }
 \lstset{style=psql}
 %%%%%%%%%%%%%%%%%%
+\usepackage{etoolbox}%for conditional expressions, in particular in \savecaptionspace
 \usepackage{wrapfig}
 \usepackage{fancyvrb}
 \usepackage{caption}

prob-def.tex

@@ -50,10 +50,12 @@ The circuits $\inparen{1}$ and $\inparen{2}$ in column $\poly$ of \Cref{fig:two-
 			\draw[->] (b3) -- (a4);
 			\draw[->] (a4) -- (2.25, 2.75);
 		\end{tikzpicture}
-		\setlength{\abovecaptionskip}{-0.025cm}
+		%\setlength{\abovecaptionskip}{-0.025cm}
+		\savecaptionspace{
 		\caption{Circuit encoding of $(X + 2Y)(2X - Y)$}
 		\label{fig:circuit}
-		\vspace{-0.58cm}
+		}{-0.025cm}{-0.58cm}
+		%\vspace{-0.58cm}
 	\end{figure}
 
 

two-step-model.tex

@@ -132,9 +132,11 @@
 		\node[below=0.2cm of rrect]{{\LARGE $\expct\pbox{\poly(\vct{X})}$}};
 	\end{tikzpicture}
 	}
-	\setlength{\abovecaptionskip}{-0.35cm}
+	%\setlength{\abovecaptionskip}{-0.35cm}
+	\savecaptionspace{
 	\caption{Intensional Query Evaluation Model $(\query_2 = \project_{\text{Point}}$ $\inparen{T\join_{\text{Point} = \text{Point}_1}R}$ where, for table $R,~\bound = 2$, while for $T,~\bound = 1.)$}
 	\label{fig:two-step}
-	\vspace{-0.43cm}
+	}{-0.35cm}{-0.43cm}
+	%\vspace{-0.43cm}
 \end{figure*}