A Task-Regime Perspective on Zero-Knowledge Database Migration

preprint OA: closed
Full text JSON View at publisher
AI-generated deep summary by claude@2026-06, 2026-06-24 · read from full text

This preprint studies how to model database migration problems using graph neural networks versus non-graph approaches, framing schema learning tasks as either local (solvable from pairwise column features) or relational (requiring multi-hop structural reasoning). Using 11 controlled experiments across Spider, SchemaPile, and Stack Overflow, the authors compare MLPs, multiple GNN architectures, DeepSets, SQL baselines, and classical heuristics, finding that for local tasks like foreign key discovery an MLP on pairwise features outperforms GNNs by up to +129% F1 due to structural noise from non-relevant neighbors. For relational tasks such as propagation count and blast-radius estimation, GNNs are crucial (R² > 0.99) while MLPs plateau around R² ≈ 0.73, and under partial schema access GNN performance degrades gracefully whereas SQL traversal fails. The main caveat stated is that the work is a preprint and not peer reviewed. The paper does not explicitly discuss endometriosis or adenomyosis; it was included in the corpus via a keyword match in the upstream search index.

Read from the paper's body, not the abstract. Not a substitute for reading the paper. No clinical advice. How this works

Full text 12,720 characters · extracted from preprint-html · click to expand
A Task-Regime Perspective on Zero-Knowledge Database Migration | 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 A Task-Regime Perspective on Zero-Knowledge Database Migration Dr. Kirti Wanjale, Aadi Joshi, Kavya Bhand, Kabir Khanuja This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-9205841/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 Relational schemas are naturally graph-structured, motivating the widespread use of Graph Neural Networks (GNNs) for database migration tasks such as foreign key discovery, integrity validation, and impact analysis. However, we show that treating all schema learning problems as monolithic graph tasks conflates fundamentally different computational regimes. We introduce a principled taxonomy that decomposes migration tasks into local tasks, solvable from pairwise column features, and relational tasks, requiring multi-hop structural reasoning. Across three datasets - Spider (166 academic databases), SchemaPile (real-world GitHub schemas), and Stack Overflow (enterprise-scale schema) - we conduct 11 controlled experiments comparing MLPs, multiple GNN architectures, DeepSets, SQL baselines, and classical heuristics. We find that: (1) For local tasks such as foreign key discovery, a simple MLP on pairwise column features outperforms GNNs by up to +129% in F1 (p 0.99, while MLPs plateau at R² ≈ 0.73. (3) Under partial-access enterprise workflows (40 - 60% schema hidden), GNNs degrade gracefully (MAE ≈ 1.1), whereas SQL traversal fails catastrophically. We further formalize structural noise injection, proving that message passing reduces signal-to-noise ratio in sparse-FK schemas, explaining observed over-smoothing effects. Based on these findings, we propose a regime-aware hybrid pipeline that assigns inductive bias per task type and strictly dominates monolithic approaches. All experiments are fully reproducible, with code and results publicly released. Database Migration Graph Neural Networks Relational Reasoning Schema Learning Zero-Knowledge Databases Full Text Additional Declarations The authors declare no competing interests. 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-9205841","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":611041059,"identity":"12919c52-34cc-4c4d-8a1d-aa4d384299af","order_by":0,"name":"Dr. Kirti Wanjale","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA9ElEQVRIiWNgGAWjYBACCWYgkQBmHmA8wFDBwAMWJaCFsQGqBQjPMPDwENTCANQC4xxgbGNgIKhFsp33+YMHDIflzRkPPzjwcd5hGXsG5oO3efBokWZmNwQ67LDhzoZjBgdnbjsMdBhbsjU+LXLMbCC/3GbccOCAwWHebWlALTxm0sRosd9w4PiHw3/ngLTwf8OrRRqqJXHDgTMGhxkbbEC2sOHVItnMxjgjweB/MlBLwcGeY0Ath9mMLefg0SJx/hjDxx8VabYbbhzf+OBHjYQ9e3vzwxtv8GiBAAOQ5gNQDjNB5TDA30C00lEwCkbBKBhhAAA9wkttkVxcSgAAAABJRU5ErkJggg==","orcid":"","institution":"Vishwakarma Institute of Technology","correspondingAuthor":true,"prefix":"Dr.","firstName":"Kirti","middleName":"","lastName":"Wanjale","suffix":""},{"id":611041060,"identity":"3d47d085-d332-4668-82dc-f6063f791270","order_by":1,"name":"Aadi Joshi","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA5ElEQVRIiWNgGAWjYLACHgM2BgYJxsYHIDYfQdVIWpoNQGw24rSACAkGNgkQTVCLPXvzww9vCvjk5Gc3t1V+zbGTYWNgfvjoBj5beI4ZS84xYDM2uHOw7bbstmSgw9iMjXPwaZFIMJAG+iVxg0Ri223JbcxALTxs0vi1pH/+DdIyf0ZiW7HktnpitOSYgW1puJHYxvhx22EitJw5U2YJ9suNxGZpxm3HediYCfiFvb198403f47Jyc9If/jx57Zqe35gGD7GpwUKjoFJZnAEMRNWDgI1YJLxB3GqR8EoGAWjYIQBAMMiQS59F638AAAAAElFTkSuQmCC","orcid":"","institution":"Vishwakarma Institute of Technology","correspondingAuthor":true,"prefix":"","firstName":"Aadi","middleName":"","lastName":"Joshi","suffix":""},{"id":611041061,"identity":"0b35fe82-01e4-42a3-a83a-614f730af7ab","order_by":2,"name":"Kavya Bhand","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABFElEQVRIiWNgGAWjYBACCQh1IAFIGBz4YGAjB+Y+IFKL4cMZFWnGcC4xWoyNec4cSmwA8fFpkWw/Yybxg+FOHv/s5m2SM9sOpM8PO/wQaIKdnG4Ddi3SPDlmkj0Mz4ol7hwrk/jYdid34+00A6CWZGOzA9i1yDGkpUnwMBxObLgB1Duz7VnuxtkJIC0HErfh0sL/LE3yD1DLfKAWad62w+mGs9M/4NUiLZF8TBpky4YbOSDvH06Ql87Bb4vkjMeHrWUMniVuvJFWCApkww3SOQUHEgxw+0XifGLjzTcVdxLn3UjeAIpKefnZ6Zs/fKiwk8OlBQhYJBgMkLgGYJUG2NVCAfMHFK58A17Vo2AUjIJRMAIBAL0Mbc/ubFBfAAAAAElFTkSuQmCC","orcid":"","institution":"Vishwakarma Institute of Technology","correspondingAuthor":true,"prefix":"","firstName":"Kavya","middleName":"","lastName":"Bhand","suffix":""},{"id":611041062,"identity":"77dad204-6fbd-4fea-a927-e9c0a253b248","order_by":3,"name":"Kabir Khanuja","email":"","orcid":"","institution":"Vishwakarma Institute of Technology","correspondingAuthor":false,"prefix":"","firstName":"Kabir","middleName":"","lastName":"Khanuja","suffix":""}],"badges":[],"createdAt":"2026-03-24 02:43:36","currentVersionCode":1,"declarations":{"humanSubjects":false,"vertebrateSubjects":false,"conflictsOfInterestStatement":false,"humanSubjectEthicalGuidelines":false,"humanSubjectConsent":false,"humanSubjectClinicalTrial":false,"humanSubjectCaseReport":false,"vertebrateSubjectEthicalGuidelines":false},"doi":"10.21203/rs.3.rs-9205841/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-9205841/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":105368271,"identity":"48f4a2ad-c725-427c-a98b-e9770a1c34a7","added_by":"auto","created_at":"2026-03-25 08:59:13","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":899447,"visible":true,"origin":"","legend":"","description":"","filename":"view.pdf","url":"https://assets-eu.researchsquare.com/files/rs-9205841/v1_covered_9803bca0-a987-43ab-8b20-a23293250d15.pdf"}],"financialInterests":"The authors declare no competing interests.","formattedTitle":"\u003cp\u003eA Task-Regime Perspective on Zero-Knowledge Database Migration\u003c/p\u003e","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":"Database Migration, Graph Neural Networks, Relational Reasoning, Schema Learning, Zero-Knowledge Databases","lastPublishedDoi":"10.21203/rs.3.rs-9205841/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-9205841/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eRelational schemas are naturally graph-structured, motivating the widespread use of Graph Neural Networks (GNNs) for database migration tasks such as foreign key discovery, integrity validation, and impact analysis. However, we show that treating all schema learning problems as monolithic graph tasks conflates fundamentally different computational regimes. We introduce a principled taxonomy that decomposes migration tasks into local tasks, solvable from pairwise column features, and relational tasks, requiring multi-hop structural reasoning. Across three datasets - Spider (166 academic databases), SchemaPile (real-world GitHub schemas), and Stack Overflow (enterprise-scale schema) - we conduct 11 controlled experiments comparing MLPs, multiple GNN architectures, DeepSets, SQL baselines, and classical heuristics. We find that: (1) For local tasks such as foreign key discovery, a simple MLP on pairwise column features outperforms GNNs by up to +129% in F1 (p \u0026lt; 0.001), as message passing injects structural noise from non-FK neighbors. (2) For relational tasks such as propagation count and blast-radius estimation, GNNs are indispensable, achieving R² \u0026gt; 0.99, while MLPs plateau at R² ≈ 0.73. (3) Under partial-access enterprise workflows (40 - 60% schema hidden), GNNs degrade gracefully (MAE ≈ 1.1), whereas SQL traversal fails catastrophically. We further formalize structural noise injection, proving that message passing reduces signal-to-noise ratio in sparse-FK schemas, explaining observed over-smoothing effects. Based on these findings, we propose a regime-aware hybrid pipeline that assigns inductive bias per task type and strictly dominates monolithic approaches. All experiments are fully reproducible, with code and results publicly released.\u003c/p\u003e","manuscriptTitle":"A Task-Regime Perspective on Zero-Knowledge Database Migration","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-03-25 08:58:54","doi":"10.21203/rs.3.rs-9205841/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":"e64e3b17-eb4d-44e1-87ec-7200a8b59591","owner":[],"postedDate":"March 25th, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2026-03-25T08:58:54+00:00","versionOfRecord":[],"versionCreatedAt":"2026-03-25 08:58:54","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-9205841","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-9205841","identity":"rs-9205841","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","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 (2026) — 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