UPDATE TRANSLATION IN INSTANCE MAPPED HETEROGENEOUS PEER DATABASES
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In data sharing systems, peers are acquainted through pair-wise data sharing settings/mappings for sharing and exchanging data. Besides query processing, supporting update exchange for interchanging data between peers is one of the challenging problems in data sharing systems. In update exchange, an update action posed to a peer is applied to the peer's local database instance and then the update is propagated to the related peers. Previous work on update exchange have considered update propagation considering schema-level mappings between peers, which are conceptually similar to the view maintenance problem. However, there are data sharing systems, where peers are acquainted by instance-level mappings. In such a system, peers use different schemas and data vocabularies to represent semantically same real world entities. The instance-level mappings express how data in one peer relate to data in another peer. One of the problems in exchanging updates in instance-mapped data sharing systems is to translate updates correctly between heterogeneous peers. The translation should be such that insertions, deletions, and modifications of the tuples made by an update in a peer and by the translated version of the update in an acquainted peer are related through the mappings between them. In this paper, we investigate such a mechanism for translating update actions between heterogeneous peer data sources. Before discussing the translation mechanism, the paper first formalize the notion of update translation and derive conditions under which the translation mechanism will produce correct translations of updates.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 it