# A Novel Approach for Improving XML Querying over Wireless Broadcast Channels
## 5 Comparative Study
### Comparison of Access Time of the Proposed Scheme with Various Data Placement Schemes  
To provide a comparative study, the proposed scheme is compared to other XML data placement techniques. We compare the access time of these techniques under various scenarios:  
* The proposed scheme implements data partitioning, load balancing, and query routing. * The broadcast disk method rotates data into predefined segments [17]. * Index-based methods use indexing to improve query performance [18]. * Sequential broadcast means broadcasting all data sequentially [19]. We consider the following sample data for comparison:  
* Size of XML data (_sizexml_): 10 MB
* Complexity of XML data (_complexityxml_): Medium (2)
* Number of partitions (for Proposed Scheme): 5
* Bandwidth of each channel (_bandwidthchannel_): 1 MBps
* Number of channels (_numberchannels_): 5
* Routing Complexity (for Proposed Scheme): Medium (2)
* Query Complexity: Medium (2)
* Processing Efficiency: Medium (1 s per unit)  
The comparison of the access time of the proposed scheme against existing XML data placement techniques is tabulated in Table 2 and Figure 3 The proposed scheme achieves a balance between access time and an efficient query routing mechanism. Because of periodic data segments, the broadcast disk method has a slightly faster access time. The index-based method is efficient because it allows for quick index lookups. The sequential broadcast has \begin{table}
\begin{tabular}{c c c c c c c c c} \hline \hline
**Size of** & **XML** & **XML** & **Partitions** & **Bandwidth** & **Channels** & **Routing** & **Query** & **Processing** & **Access** \\
**XML (MB)** & **Complexity** & **(MBps)** & **Channels** & **Complexity** & **Complexity** & **Efficiency (s/unit)** & **Time (s)** \\ \hline
5 & Low (1) & 3 & 1 & 3 & Low (1) & Low (1) & 0.5 & 3.17 \\ \hline
10 & Medium (2) & 5 & 1 & 5 & Medium (2) & Medium (2) & 1 & 6.9 \\ \hline
15 & High (3) & 7 & 2 & 7 & High (3) & High (3) & 1.5 & 9.64 \\ \hline
10 & Low (1) & 5 & 2 & 5 & Low (1) & High (3) & 0.5 & 5.9 \\ \hline
5 & High (3) & 3 & 1 & 3 & Medium (2) & Medium (2) & 1 & 6.67 \\ \hline
15 & Medium (2) & 7 & 1 & 7 & Low (1) & Low (1) & 1.5 & 7.5 \\ \hline \hline \end{tabular}
\end{table} 
Table 1: Access time of the proposed XML data placement scheme. the longest access time because it waits for the entire data broadcast. This table compares the proposed scheme's access time benefits to other existing techniques, highlighting the trade-offs. The proposed scheme strikes a balance between partitioning, transmission, routing, and processing times, giving it a competitive advantage in scenarios requiring optimal access times. Comparison of Various Performance Metrics of the Proposed Scheme with Various XML Data Placement Schemes  
This section compares the proposed algorithm for improving XML querying over wireless broadcast channels with existing algorithms. Several performance metrics were defined, and a comparative analysis was conducted. The performance metrics and definitions used in this analysis are as follows:  
1. _Query Response Time (QRT)_: The time it takes to receive results after issuing a query. 2. _Network Traffic (NT)_: The amount of data sent across the network during the querying process. This refers to the total amount of data transmitted during querying, including any overhead. \begin{table}
\begin{tabular}{l c c c c} \hline \hline
**Parameters****Technique** & **Proposed Scheme** & **Broadcast Disk Method [20]** & **Index-Based Method [21]** & **Sequential Broadcast [22]** \\ \hline Partitioning Time (seconds) & 0.4 & 0 & 0 & 0 \\ \hline Transmission Time (seconds) & 2 & 2 & 2 & 10 \\ \hline Routing Time (seconds) & 1 & 1 & 1 & 5 \\ \hline Processing Time (seconds) & 2 & 2 & 2 & 2 \\ \hline Total Access Time (seconds) & 5.4 & 5 & 5 & 17 \\ \hline \hline \end{tabular}
\end{table} 
Table 2: Comparison of the access time of the proposed scheme against existing XML data placement techniques.