Database Reference
In-Depth Information
Algorithm retrieves physical rows from a CTT and virtual rows from a VET. The
three cases that this algorithm is handling are described in Sect. 5 . This experi-
ment studies the third case that retrieves all rows of the
'
product
'
CTT and the
'
VET from the Single Table function without specifying any primary
keys or row IDs; the structure of the
product
'
'
product
'
table is shown in Fig. 7 (a). The
'
VET equals 16. The experimental results of Exp. 1
shows that the performance of the query execution time of a VET is faster than a
CTT when 1 or 100 of table rows are retrieved. The details of the queries used in
this experiment are shown in Tables 3 and 4 , the output of these queries is shown
in Fig. 8 , and the throughputs of this experiment are depicted in Fig. 16 (a) and (b).
db_table_id
'
of the
'
product
'
Fig. 7. The tables structures used in the experiments
Fig. 8. The outputs of the Simple Query Experiment (Single Table)
(2) Simple-to-Medium Query Experiment - One-to-Many (Exp. 2): In this
experiment, the function of One-to-Many Query Algorithm is invoked to retrieve
data from two CTTs by executing Query 3 (Q 3) that comprises of IQ5, two VETs
by executing Query 4 (Q 4) that comprises of IQ6 and IQ7, and CTT-and-VET by
Search WWH ::




Custom Search