Optimizing Intensive Database Tasks Through Caching Proxy Mechanisms
Web caching is essential for the World Wide Web, saving processing power, bandwidth, and reducing latency. Many proxy caching solutions focus on buffering data from the main server, neglecting cacheable information meant for server writes. Existing systems addressing this issue are often intrusive,...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2024-04 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Moise, Ionut-Alex Băicoianu, Alexandra |
description | Web caching is essential for the World Wide Web, saving processing power, bandwidth, and reducing latency. Many proxy caching solutions focus on buffering data from the main server, neglecting cacheable information meant for server writes. Existing systems addressing this issue are often intrusive, requiring modifications to the main application for integration. We identify opportunities for enhancement in conventional caching proxies. This paper explores, designs, and implements a potential prototype for such an application. Our focus is on harnessing a faster bulk-data-write approach compared to single-data-write within the context of relational databases. If a (upload) request matches a specified cacheable URL, then the data will be extracted and buffered on the local disk for later bulk-write. In contrast with already existing caching proxies, Squid, for example, in a similar uploading scenario, the request would simply get redirected, leaving out potential gains such as minimized processing power, lower server load, and bandwidth. After prototyping and testing the suggested application against Squid, concerning data uploads with 1, 100, 1.000, ..., and 100.000 requests, we consistently observed query execution improvements ranging from 5 to 9 times. This enhancement was achieved through buffering and bulk-writing the data, the extent of which depended on the specific test conditions. |
doi_str_mv | 10.48550/arxiv.2404.12128 |
format | Article |
fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2404_12128</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3041595853</sourcerecordid><originalsourceid>FETCH-LOGICAL-a958-8b3d820bd42245d48e9c6c5d8f8cdd352dc137ee628a45e36439a201f31e08413</originalsourceid><addsrcrecordid>eNotj7tuwjAYRq1KlYooD9Cpljontf3bwRmr0AsSFR2yR47tENPmUjsg6NMToNO3HH06B6EHSmIuhSDPyh_cPmac8JgyyuQNmjAAGknO2B2ahbAlhLBkzoSACVqs-8E17s-1G7xsB9sGt7d4oQZVqmBxrsJ3wHntu92mxpnS9Rn88t3hiD-trlXrQhPu0W2lfoKd_e8U5W-vefYRrdbvy-xlFalUyEiWYCQjpRlFuDBc2lQnWhhZSW0MCGY0hbm1CZOKCwsJh1QxQiuglkhOYYoer7eXxKL3rlH-WJxTi0vqSDxdid53vzsbhmLb7Xw7OhVAOBWjhgA4AXxdVdo</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3041595853</pqid></control><display><type>article</type><title>Optimizing Intensive Database Tasks Through Caching Proxy Mechanisms</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Moise, Ionut-Alex ; Băicoianu, Alexandra</creator><creatorcontrib>Moise, Ionut-Alex ; Băicoianu, Alexandra</creatorcontrib><description>Web caching is essential for the World Wide Web, saving processing power, bandwidth, and reducing latency. Many proxy caching solutions focus on buffering data from the main server, neglecting cacheable information meant for server writes. Existing systems addressing this issue are often intrusive, requiring modifications to the main application for integration. We identify opportunities for enhancement in conventional caching proxies. This paper explores, designs, and implements a potential prototype for such an application. Our focus is on harnessing a faster bulk-data-write approach compared to single-data-write within the context of relational databases. If a (upload) request matches a specified cacheable URL, then the data will be extracted and buffered on the local disk for later bulk-write. In contrast with already existing caching proxies, Squid, for example, in a similar uploading scenario, the request would simply get redirected, leaving out potential gains such as minimized processing power, lower server load, and bandwidth. After prototyping and testing the suggested application against Squid, concerning data uploads with 1, 100, 1.000, ..., and 100.000 requests, we consistently observed query execution improvements ranging from 5 to 9 times. This enhancement was achieved through buffering and bulk-writing the data, the extent of which depended on the specific test conditions.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2404.12128</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Buffers ; Caching ; Computer Science - Databases ; Prototyping ; Relational data bases ; Squid</subject><ispartof>arXiv.org, 2024-04</ispartof><rights>2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,780,881,27902</link.rule.ids><backlink>$$Uhttps://doi.org/10.5220/0012754600003753$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.2404.12128$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Moise, Ionut-Alex</creatorcontrib><creatorcontrib>Băicoianu, Alexandra</creatorcontrib><title>Optimizing Intensive Database Tasks Through Caching Proxy Mechanisms</title><title>arXiv.org</title><description>Web caching is essential for the World Wide Web, saving processing power, bandwidth, and reducing latency. Many proxy caching solutions focus on buffering data from the main server, neglecting cacheable information meant for server writes. Existing systems addressing this issue are often intrusive, requiring modifications to the main application for integration. We identify opportunities for enhancement in conventional caching proxies. This paper explores, designs, and implements a potential prototype for such an application. Our focus is on harnessing a faster bulk-data-write approach compared to single-data-write within the context of relational databases. If a (upload) request matches a specified cacheable URL, then the data will be extracted and buffered on the local disk for later bulk-write. In contrast with already existing caching proxies, Squid, for example, in a similar uploading scenario, the request would simply get redirected, leaving out potential gains such as minimized processing power, lower server load, and bandwidth. After prototyping and testing the suggested application against Squid, concerning data uploads with 1, 100, 1.000, ..., and 100.000 requests, we consistently observed query execution improvements ranging from 5 to 9 times. This enhancement was achieved through buffering and bulk-writing the data, the extent of which depended on the specific test conditions.</description><subject>Buffers</subject><subject>Caching</subject><subject>Computer Science - Databases</subject><subject>Prototyping</subject><subject>Relational data bases</subject><subject>Squid</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><sourceid>GOX</sourceid><recordid>eNotj7tuwjAYRq1KlYooD9Cpljontf3bwRmr0AsSFR2yR47tENPmUjsg6NMToNO3HH06B6EHSmIuhSDPyh_cPmac8JgyyuQNmjAAGknO2B2ahbAlhLBkzoSACVqs-8E17s-1G7xsB9sGt7d4oQZVqmBxrsJ3wHntu92mxpnS9Rn88t3hiD-trlXrQhPu0W2lfoKd_e8U5W-vefYRrdbvy-xlFalUyEiWYCQjpRlFuDBc2lQnWhhZSW0MCGY0hbm1CZOKCwsJh1QxQiuglkhOYYoer7eXxKL3rlH-WJxTi0vqSDxdid53vzsbhmLb7Xw7OhVAOBWjhgA4AXxdVdo</recordid><startdate>20240418</startdate><enddate>20240418</enddate><creator>Moise, Ionut-Alex</creator><creator>Băicoianu, Alexandra</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20240418</creationdate><title>Optimizing Intensive Database Tasks Through Caching Proxy Mechanisms</title><author>Moise, Ionut-Alex ; Băicoianu, Alexandra</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a958-8b3d820bd42245d48e9c6c5d8f8cdd352dc137ee628a45e36439a201f31e08413</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Buffers</topic><topic>Caching</topic><topic>Computer Science - Databases</topic><topic>Prototyping</topic><topic>Relational data bases</topic><topic>Squid</topic><toplevel>online_resources</toplevel><creatorcontrib>Moise, Ionut-Alex</creatorcontrib><creatorcontrib>Băicoianu, Alexandra</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Moise, Ionut-Alex</au><au>Băicoianu, Alexandra</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimizing Intensive Database Tasks Through Caching Proxy Mechanisms</atitle><jtitle>arXiv.org</jtitle><date>2024-04-18</date><risdate>2024</risdate><eissn>2331-8422</eissn><abstract>Web caching is essential for the World Wide Web, saving processing power, bandwidth, and reducing latency. Many proxy caching solutions focus on buffering data from the main server, neglecting cacheable information meant for server writes. Existing systems addressing this issue are often intrusive, requiring modifications to the main application for integration. We identify opportunities for enhancement in conventional caching proxies. This paper explores, designs, and implements a potential prototype for such an application. Our focus is on harnessing a faster bulk-data-write approach compared to single-data-write within the context of relational databases. If a (upload) request matches a specified cacheable URL, then the data will be extracted and buffered on the local disk for later bulk-write. In contrast with already existing caching proxies, Squid, for example, in a similar uploading scenario, the request would simply get redirected, leaving out potential gains such as minimized processing power, lower server load, and bandwidth. After prototyping and testing the suggested application against Squid, concerning data uploads with 1, 100, 1.000, ..., and 100.000 requests, we consistently observed query execution improvements ranging from 5 to 9 times. This enhancement was achieved through buffering and bulk-writing the data, the extent of which depended on the specific test conditions.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2404.12128</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2024-04 |
issn | 2331-8422 |
language | eng |
recordid | cdi_arxiv_primary_2404_12128 |
source | arXiv.org; Free E- Journals |
subjects | Buffers Caching Computer Science - Databases Prototyping Relational data bases Squid |
title | Optimizing Intensive Database Tasks Through Caching Proxy Mechanisms |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T16%3A33%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimizing%20Intensive%20Database%20Tasks%20Through%20Caching%20Proxy%20Mechanisms&rft.jtitle=arXiv.org&rft.au=Moise,%20Ionut-Alex&rft.date=2024-04-18&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2404.12128&rft_dat=%3Cproquest_arxiv%3E3041595853%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3041595853&rft_id=info:pmid/&rfr_iscdi=true |