Os-ETL: A High-Efficiency, Open-Scala Solution for Integrating Heterogeneous Data in Large-Scale Data Warehousing
Bibliographic record
Abstract
The surge in data volume necessitates the integration of Resource Description Framework (RDF) data within corporate environments.While Extract, Transform, Load (ETL) processes exhibit proficiency with conventional data sources, their scalability diminishes when applied to large and highly varied data sources, inclusive of RDF data.The latter constitutes a wealth of knowledge that, when harnessed via data warehouse technology, can augment corporate value in a fiercely competitive milieu.The advent of platforms like polystore offers opportunities for advanced hardware deployment.ETL processes necessitate two crucial phases: Partitioning and data allocation.Concurrently, the scientific community is spurred to innovate ETL processes that support real-time analytics.This study proposes a novel architecture for ETL processes, named Open-Scala-ETL (Os-ETL).Equipped with a method for deploying a data warehouse based on a polystore, Os-ETL enables real-time analysis.The primary objective of the Os-ETL solution is to resolve the complexities in deploying a graph structure data warehouse on a polystore-a process that involves partitioning and data allocation.Os-ETL is a distributed solution that supports both batch and streaming processing using the Spark framework.Scala scripts are executed within this framework to partition RDF graphs and distribute the resultant fragments across various sites.The implementation of Os-ETL is based on Apache Spark, with ETL deployment on a Spark SQL polystore.This solution empowers companies with data warehouse technology to improve performance, scalability, and latency between a data warehouse and its data sources.The approach has been assessed and validated using largescale, heterogeneous data, encompassing the LUBM benchmark, CSV files, an Oracle database, and a Neo4j graph database.The results corroborate its superior performance in terms of scalability and optimization.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.005 | 0.008 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.003 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.002 | 0.003 |
| Scholarly communication | 0.004 | 0.008 |
| Open science | 0.007 | 0.009 |
| Research integrity | 0.001 | 0.004 |
| Insufficient payload (model declined to judge) | 0.007 | 0.005 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".