ADD-QIA: An Adaptive Data Deduplication Framework Based on Quantum Immune Algorithm

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract Cloud computing has become the backbone of modern data management, yet the exponential growth of unstructured data from IoT devices, virtual machines, and enterprise systems has created excessive redundancy. Conventional deduplication techniques, such as fixed-size and content-defined chunking, either miss shifted duplicates or impose heavy computational overhead, limiting their scalability. Bio-inspired approaches (GA, PSO, IA) introduce adaptability but suffer from slow convergence and suboptimal trade-offs between deduplication ratio, execution time, and memory usage. To address these gaps, this paper proposes ADD-QIA, an Adaptive Data Deduplication framework based on a Quantum Immune Algorithm. By combining quantum-inspired probabilistic encoding with immune clonal selection, ADD-QIA dynamically adjusts chunking strategies to workload variations. Extensive evaluation on VM snapshots, enterprise backups, and cloud traces demonstrates that ADD-QIA achieves a deduplication ratio of 5.3:1, reduces execution time by 20%, and lowers memory usage by 15%, while sustaining throughput above 300 MB/s. The strength and scalability of the method is statistically validated. These findings make ADD-QIA a viable and scalable model of removing redundancy in the cloud.
Full text 13,997 characters · extracted from preprint-html · click to expand
ADD-QIA: An Adaptive Data Deduplication Framework Based on Quantum Immune Algorithm | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article ADD-QIA: An Adaptive Data Deduplication Framework Based on Quantum Immune Algorithm Sashi Tarun, Shivani Goel, Vijaya Chandra Jadala This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7829113/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Cloud computing has become the backbone of modern data management, yet the exponential growth of unstructured data from IoT devices, virtual machines, and enterprise systems has created excessive redundancy. Conventional deduplication techniques, such as fixed-size and content-defined chunking, either miss shifted duplicates or impose heavy computational overhead, limiting their scalability. Bio-inspired approaches (GA, PSO, IA) introduce adaptability but suffer from slow convergence and suboptimal trade-offs between deduplication ratio, execution time, and memory usage. To address these gaps, this paper proposes ADD-QIA, an Adaptive Data Deduplication framework based on a Quantum Immune Algorithm. By combining quantum-inspired probabilistic encoding with immune clonal selection, ADD-QIA dynamically adjusts chunking strategies to workload variations. Extensive evaluation on VM snapshots, enterprise backups, and cloud traces demonstrates that ADD-QIA achieves a deduplication ratio of 5.3:1, reduces execution time by 20%, and lowers memory usage by 15%, while sustaining throughput above 300 MB/s. The strength and scalability of the method is statistically validated. These findings make ADD-QIA a viable and scalable model of removing redundancy in the cloud. Adaptive Deduplication Quantum Immune Algorithm Cloud Storage Redundancy Elimi- nation Bio-inspired Quantum Computing Metaheuristics Cloud Effciency Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-7829113","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":529324484,"identity":"2af3a288-1611-4d15-a07f-65e1fbe2354a","order_by":0,"name":"Sashi Tarun","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA8klEQVRIiWNgGAWjYHACNoYEMM3/8cEHEJedKC0QPcaGM0BcZmK0QK0xk+YBUYS0yLcff/bg4Q+7fIPbDWnSNr+2yfMxMzB++JiDW4vBmRxzg4SEZMsNdw4cts7tu23YxszALDlzGx4tDDlsEgkJzAYGNxIbb+f23GYEamFj5sWjRb7/+TOglnqglmQGacue2/YEtTDcSDADajkM1JLGJM3w43YiQS0GN94AtaQdN5C8kcNs2NtwO7mNmbEZr1/k+9OfSf6wqTbgu5HD+ODHn9u289ubD374iM9hKICxDUw2EKseBP6QongUjIJRMApGCgAAynBPoCIqfHsAAAAASUVORK5CYII=","orcid":"","institution":"SR University","correspondingAuthor":true,"prefix":"","firstName":"Sashi","middleName":"","lastName":"Tarun","suffix":""},{"id":529324486,"identity":"3ef82c8f-dfdc-406b-9b32-64b15f35da3c","order_by":1,"name":"Shivani Goel","email":"","orcid":"","institution":"SR University","correspondingAuthor":false,"prefix":"","firstName":"Shivani","middleName":"","lastName":"Goel","suffix":""},{"id":529324488,"identity":"23b0f863-9b54-4cbb-a55a-63d4bf6b8ff0","order_by":2,"name":"Vijaya Chandra Jadala","email":"","orcid":"","institution":"SR University","correspondingAuthor":false,"prefix":"","firstName":"Vijaya","middleName":"Chandra","lastName":"Jadala","suffix":""}],"badges":[],"createdAt":"2025-10-10 16:53:09","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-7829113/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7829113/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":94135004,"identity":"af587af1-0a3e-4130-83be-26638e70dfa5","added_by":"auto","created_at":"2025-10-22 18:49:21","extension":"json","order_by":0,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":4912,"visible":true,"origin":"","legend":"","description":"","filename":"4d848cfaf8574bf8a88dd622272a482d.json","url":"https://assets-eu.researchsquare.com/files/rs-7829113/v1/98058f03d95134f144afddc5.json"},{"id":94136224,"identity":"4514b6e3-9903-4e0a-8bde-e4f6eb163e4e","added_by":"auto","created_at":"2025-10-22 19:05:21","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":596324,"visible":true,"origin":"","legend":"","description":"","filename":"ADDQIA.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7829113/v1/9a827c641c8a36272b2d9692.pdf"},{"id":94135644,"identity":"c9a41a51-6474-43b9-9f70-7c11fedb361b","added_by":"auto","created_at":"2025-10-22 18:57:22","extension":"pdf","order_by":2,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":359117,"visible":true,"origin":"","legend":"","description":"","filename":"CoverletterJournalofSuperComputing.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7829113/v1/135969808a034852f5f11521.pdf"},{"id":94135005,"identity":"4ceb35bf-7012-4f40-ae18-7ae47485fb8a","added_by":"auto","created_at":"2025-10-22 18:49:21","extension":"png","order_by":3,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":167435,"visible":true,"origin":"","legend":"","description":"","filename":"combinedheatmaps.png","url":"https://assets-eu.researchsquare.com/files/rs-7829113/v1/ebc706c4b682ae7158a0b4d0.png"},{"id":94135002,"identity":"a9b418ca-badb-4628-91aa-2fc0a8f7823c","added_by":"auto","created_at":"2025-10-22 18:49:21","extension":"png","order_by":4,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":113561,"visible":true,"origin":"","legend":"","description":"","filename":"paretomemory.png","url":"https://assets-eu.researchsquare.com/files/rs-7829113/v1/f2a3a9c9384bf1a5d6b2cfe3.png"},{"id":94135642,"identity":"905abd82-5b77-48c6-87bd-2c8f39cf22d2","added_by":"auto","created_at":"2025-10-22 18:57:21","extension":"png","order_by":5,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":114482,"visible":true,"origin":"","legend":"","description":"","filename":"paretotime.png","url":"https://assets-eu.researchsquare.com/files/rs-7829113/v1/e1b794ad59c7a9b6d3cbce70.png"},{"id":94135008,"identity":"d8e7f138-f86f-4196-a168-56d4d85a4b37","added_by":"auto","created_at":"2025-10-22 18:49:22","extension":"png","order_by":6,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":157441,"visible":true,"origin":"","legend":"","description":"","filename":"scalability.png","url":"https://assets-eu.researchsquare.com/files/rs-7829113/v1/7cc6d740c2b8d1187db4d2ba.png"},{"id":94135007,"identity":"9450d38d-7e74-4e83-999f-c301a39b0b3a","added_by":"auto","created_at":"2025-10-22 18:49:22","extension":"png","order_by":7,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":167643,"visible":true,"origin":"","legend":"","description":"","filename":"sensitivity.png","url":"https://assets-eu.researchsquare.com/files/rs-7829113/v1/00d894e9c38690e8d1435cb4.png"},{"id":94135009,"identity":"215357b7-f7b1-419c-8bf6-a7e76ad7ad8f","added_by":"auto","created_at":"2025-10-22 18:49:22","extension":"xml","order_by":8,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":89624,"visible":true,"origin":"","legend":"","description":"","filename":"4d848cfaf8574bf8a88dd622272a482d1structuring.xml","url":"https://assets-eu.researchsquare.com/files/rs-7829113/v1/15b900560c1ff8307ea0541b.xml"},{"id":94136569,"identity":"92b7dbf8-6783-4f97-a8c6-ccf0f9ecdebd","added_by":"auto","created_at":"2025-10-22 19:13:22","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":535309,"visible":true,"origin":"","legend":"","description":"","filename":"ADDQIA.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7829113/v1_covered_5b98c169-76d5-4fe7-8c82-351aa7697e61.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"ADD-QIA: An Adaptive Data Deduplication Framework Based on Quantum Immune Algorithm","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Adaptive Deduplication, Quantum Immune Algorithm, Cloud Storage, Redundancy Elimi- nation, Bio-inspired, Quantum Computing, Metaheuristics, Cloud Effciency","lastPublishedDoi":"10.21203/rs.3.rs-7829113/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7829113/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Cloud computing has become the backbone of modern data management, yet the exponential growth of unstructured data from IoT devices, virtual machines, and enterprise systems has created excessive redundancy. Conventional deduplication techniques, such as fixed-size and content-defined chunking, either miss shifted duplicates or impose heavy computational overhead, limiting their scalability. Bio-inspired approaches (GA, PSO, IA) introduce adaptability but suffer from slow convergence and suboptimal trade-offs between deduplication ratio, execution time, and memory usage. To address these gaps, this paper proposes ADD-QIA, an Adaptive Data Deduplication framework based on a Quantum Immune Algorithm. By combining quantum-inspired probabilistic encoding with immune clonal selection, ADD-QIA dynamically adjusts chunking strategies to workload variations. Extensive evaluation on VM snapshots, enterprise backups, and cloud traces demonstrates that ADD-QIA achieves a deduplication ratio of 5.3:1, reduces execution time by 20%, and lowers memory usage by 15%, while sustaining throughput above 300 MB/s. The strength and scalability of the method is statistically validated. These findings make ADD-QIA a viable and scalable model of removing redundancy in the cloud.","manuscriptTitle":"ADD-QIA: An Adaptive Data Deduplication Framework Based on Quantum Immune Algorithm","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-10-22 18:49:17","doi":"10.21203/rs.3.rs-7829113/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"5a39f202-0693-4ea4-a245-2849faa98bb5","owner":[],"postedDate":"October 22nd, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2025-10-22T18:49:17+00:00","versionOfRecord":[],"versionCreatedAt":"2025-10-22 18:49:17","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-7829113","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7829113","identity":"rs-7829113","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00