换柱状图配色
This commit is contained in:
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
@@ -50,7 +50,7 @@
|
|||||||
\newlabel{eqn:pre_st_query}{{2}{3}}
|
\newlabel{eqn:pre_st_query}{{2}{3}}
|
||||||
\newlabel{eqn:cost_total}{{3}{3}}
|
\newlabel{eqn:cost_total}{{3}{3}}
|
||||||
\newlabel{eqn_pre_objective}{{4}{3}}
|
\newlabel{eqn_pre_objective}{{4}{3}}
|
||||||
\@writefile{toc}{\contentsline {section}{\numberline {4}I/O-aware Indexing stucture}{3}{}\protected@file@percent }
|
\@writefile{toc}{\contentsline {section}{\numberline {4}I/O-aware Indexing Structure}{3}{}\protected@file@percent }
|
||||||
\newlabel{sec:Index}{{4}{3}}
|
\newlabel{sec:Index}{{4}{3}}
|
||||||
\@writefile{toc}{\contentsline {subsection}{\numberline {4.1}Index schema design}{3}{}\protected@file@percent }
|
\@writefile{toc}{\contentsline {subsection}{\numberline {4.1}Index schema design}{3}{}\protected@file@percent }
|
||||||
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces Index schema design}}{4}{}\protected@file@percent }
|
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces Index schema design}}{4}{}\protected@file@percent }
|
||||||
@@ -173,13 +173,13 @@
|
|||||||
\bibcite{riotiler25riotiler}{11}
|
\bibcite{riotiler25riotiler}{11}
|
||||||
\bibcite{Thomson12Calvin}{12}
|
\bibcite{Thomson12Calvin}{12}
|
||||||
\bibcite{Lim17OCC}{13}
|
\bibcite{Lim17OCC}{13}
|
||||||
\bibcite{Rajesh24TunIO}{14}
|
|
||||||
\@writefile{lof}{\contentsline {figure}{\numberline {13}{\ignorespaces Mode Switching}}{13}{}\protected@file@percent }
|
\@writefile{lof}{\contentsline {figure}{\numberline {13}{\ignorespaces Mode Switching}}{13}{}\protected@file@percent }
|
||||||
\newlabel{fig:tune_exp3}{{13}{13}}
|
\newlabel{fig:tune_exp3}{{13}{13}}
|
||||||
\@writefile{toc}{\contentsline {subsubsection}{\numberline {7.4.2}Adaptation to Workload Shifts}{13}{}\protected@file@percent }
|
\@writefile{toc}{\contentsline {subsubsection}{\numberline {7.4.2}Adaptation to Workload Shifts}{13}{}\protected@file@percent }
|
||||||
\@writefile{toc}{\contentsline {section}{\numberline {8}Conclusions}{13}{}\protected@file@percent }
|
\@writefile{toc}{\contentsline {section}{\numberline {8}Conclusions}{13}{}\protected@file@percent }
|
||||||
\newlabel{sec:Con}{{8}{13}}
|
\newlabel{sec:Con}{{8}{13}}
|
||||||
\@writefile{toc}{\contentsline {section}{References}{13}{}\protected@file@percent }
|
\@writefile{toc}{\contentsline {section}{References}{13}{}\protected@file@percent }
|
||||||
|
\bibcite{Rajesh24TunIO}{14}
|
||||||
\bibcite{Preil25GMAB}{15}
|
\bibcite{Preil25GMAB}{15}
|
||||||
\bibcite{Tang12Quad-Tree}{16}
|
\bibcite{Tang12Quad-Tree}{16}
|
||||||
\bibcite{Bernstein812PL}{17}
|
\bibcite{Bernstein812PL}{17}
|
||||||
|
|||||||
@@ -1,4 +1,4 @@
|
|||||||
This is XeTeX, Version 3.141592653-2.6-0.999995 (MiKTeX 23.4) (preloaded format=xelatex 2025.11.26) 31 JAN 2026 15:42
|
This is XeTeX, Version 3.141592653-2.6-0.999995 (MiKTeX 23.4) (preloaded format=xelatex 2025.11.26) 31 JAN 2026 16:23
|
||||||
entering extended mode
|
entering extended mode
|
||||||
restricted \write18 enabled.
|
restricted \write18 enabled.
|
||||||
%&-line parsing enabled.
|
%&-line parsing enabled.
|
||||||
@@ -385,14 +385,12 @@ LaTeX Font Info: Trying to load font information for U+msb on input line 278
|
|||||||
(D:\software\ctex\MiKTeX\tex/latex/amsfonts\umsb.fd
|
(D:\software\ctex\MiKTeX\tex/latex/amsfonts\umsb.fd
|
||||||
File: umsb.fd 2013/01/14 v3.01 AMS symbols B
|
File: umsb.fd 2013/01/14 v3.01 AMS symbols B
|
||||||
)
|
)
|
||||||
Missing character: There is no , in font phvr8t!
|
|
||||||
** ATTENTION: \keywords is deprecated (line 278). Use \IEEEkeywords instead.
|
** ATTENTION: \keywords is deprecated (line 278). Use \IEEEkeywords instead.
|
||||||
LaTeX Font Info: Trying to load font information for U+pzd on input line 278
|
LaTeX Font Info: Trying to load font information for U+pzd on input line 278
|
||||||
.
|
.
|
||||||
(D:\software\ctex\MiKTeX\tex/latex/psnfss\upzd.fd
|
(D:\software\ctex\MiKTeX\tex/latex/psnfss\upzd.fd
|
||||||
File: upzd.fd 2001/06/04 font definitions for U/pzd.
|
File: upzd.fd 2001/06/04 font definitions for U/pzd.
|
||||||
)
|
)
|
||||||
Missing character: There is no , in font phvr8t!
|
|
||||||
** ATTENTION: \keywords is deprecated (line 278). Use \IEEEkeywords instead.
|
** ATTENTION: \keywords is deprecated (line 278). Use \IEEEkeywords instead.
|
||||||
[1
|
[1
|
||||||
|
|
||||||
@@ -504,11 +502,11 @@ File: exp/index_exp2_1.pdf Graphic file (type pdf)
|
|||||||
<use exp/index_exp2_1.pdf>
|
<use exp/index_exp2_1.pdf>
|
||||||
File: exp/index_exp2_2.pdf Graphic file (type pdf)
|
File: exp/index_exp2_2.pdf Graphic file (type pdf)
|
||||||
<use exp/index_exp2_2.pdf>
|
<use exp/index_exp2_2.pdf>
|
||||||
|
[9]
|
||||||
File: exp/index_exp3_1.pdf Graphic file (type pdf)
|
File: exp/index_exp3_1.pdf Graphic file (type pdf)
|
||||||
<use exp/index_exp3_1.pdf>
|
<use exp/index_exp3_1.pdf>
|
||||||
File: exp/index_exp3_2.pdf Graphic file (type pdf)
|
File: exp/index_exp3_2.pdf Graphic file (type pdf)
|
||||||
<use exp/index_exp3_2.pdf>
|
<use exp/index_exp3_2.pdf>
|
||||||
[9]
|
|
||||||
File: exp/index_exp3_3.pdf Graphic file (type pdf)
|
File: exp/index_exp3_3.pdf Graphic file (type pdf)
|
||||||
<use exp/index_exp3_3.pdf>
|
<use exp/index_exp3_3.pdf>
|
||||||
File: exp/index_exp4_2.pdf Graphic file (type pdf)
|
File: exp/index_exp4_2.pdf Graphic file (type pdf)
|
||||||
|
|||||||
Binary file not shown.
Binary file not shown.
@@ -925,7 +925,6 @@ For comparison, we evaluate the following execution schemes:
|
|||||||
\item \textbf{Ours:} The proposed mechanism featuring contention-aware switching, global I/O plan ordering, and window merging.
|
\item \textbf{Ours:} The proposed mechanism featuring contention-aware switching, global I/O plan ordering, and window merging.
|
||||||
\end{enumerate}
|
\end{enumerate}
|
||||||
|
|
||||||
\subsubsection{Concurrency Scalability}
|
|
||||||
\begin{figure*}[htb]
|
\begin{figure*}[htb]
|
||||||
\centering
|
\centering
|
||||||
\subfigure[$\sigma=0.4$]{\label{fig:cc_exp1_3}
|
\subfigure[$\sigma=0.4$]{\label{fig:cc_exp1_3}
|
||||||
@@ -943,6 +942,7 @@ For comparison, we evaluate the following execution schemes:
|
|||||||
\label{fig:cc_exp1}
|
\label{fig:cc_exp1}
|
||||||
\end{figure*}
|
\end{figure*}
|
||||||
|
|
||||||
|
\subsubsection{Concurrency Scalability}
|
||||||
To evaluate the system's robustness under different workload characteristics, we conducted a sensitivity analysis by manipulating the Spatial Overlap Ratio ($\sigma$). We examined three distinct scenarios: low overlap ($\sigma=0.4$, simulating dispersed random queries), medium overlap ($\sigma=0.6$), and high overlap ($\sigma=0.8$, simulating hotspot analysis). Note that $\sigma=0.4$ is defined as a low overlap scenario because: when $\sigma \le 0.35$, the performance of the deterministic scheduling mode is even lower than that of the optimistic mode (See Sec.~\ref{sec:ModeSwitch}). So, the performance of our method is the same as the Baseline when $\sigma \le 0.35$. Fig.~\ref{fig:cc_exp1} illustrates the query latency trends as the number of concurrent clients increases from 1 to 64.
|
To evaluate the system's robustness under different workload characteristics, we conducted a sensitivity analysis by manipulating the Spatial Overlap Ratio ($\sigma$). We examined three distinct scenarios: low overlap ($\sigma=0.4$, simulating dispersed random queries), medium overlap ($\sigma=0.6$), and high overlap ($\sigma=0.8$, simulating hotspot analysis). Note that $\sigma=0.4$ is defined as a low overlap scenario because: when $\sigma \le 0.35$, the performance of the deterministic scheduling mode is even lower than that of the optimistic mode (See Sec.~\ref{sec:ModeSwitch}). So, the performance of our method is the same as the Baseline when $\sigma \le 0.35$. Fig.~\ref{fig:cc_exp1} illustrates the query latency trends as the number of concurrent clients increases from 1 to 64.
|
||||||
|
|
||||||
The results reveal a fundamental divergence in how the two systems respond to data contention. As shown in Fig.~\ref{fig:cc_exp1}(a), when query footprints are spatially dispersed, the opportunities for physical I/O merging are minimal. Consequently, the performance of both systems is primarily constrained by the aggregate physical bandwidth of the storage cluster. Both approaches exhibit linear latency growth with respect to the client count. At $N=64$, the Baseline reaches a mean latency of approx. 37,000 ms, while our method records approx. 30,000 ms. Although our method maintains a slight performance edge due to the reduced read amplification provided by the I/O-aware index, it inevitably degrades to a linear query processing mode similar to the Baseline. This confirms that without spatial locality to leverage request collapsing, the system is bound by the hardware's I/O throughput limits.
|
The results reveal a fundamental divergence in how the two systems respond to data contention. As shown in Fig.~\ref{fig:cc_exp1}(a), when query footprints are spatially dispersed, the opportunities for physical I/O merging are minimal. Consequently, the performance of both systems is primarily constrained by the aggregate physical bandwidth of the storage cluster. Both approaches exhibit linear latency growth with respect to the client count. At $N=64$, the Baseline reaches a mean latency of approx. 37,000 ms, while our method records approx. 30,000 ms. Although our method maintains a slight performance edge due to the reduced read amplification provided by the I/O-aware index, it inevitably degrades to a linear query processing mode similar to the Baseline. This confirms that without spatial locality to leverage request collapsing, the system is bound by the hardware's I/O throughput limits.
|
||||||
|
|||||||
Reference in New Issue
Block a user