A towards an extended relational algebra for software architecture
Bibliographic record
Abstract
Software architecture is often structured as box-and-arrow graphs and has important implications for system development and maintenance. We propose an extended relational algebra to support presentation and manipulation of both architectural structures and implications. The core structure of this algebra is the extended architectural relation (EAR). An EAR is a mapping from an architectural relation (AR) to a multi-set of attributes (M), where the AR is an ordinary relation representing an architectural structure, and the M represents a multi-set representing a type of architectural implication. A set of EAR operations is then defined to support EAR manipulations. The main advantage of this extended algebra over ordinary relational algebras is that the architectural implications (the M part) are presented and manipulated together with the architectural structures (the AR part). This paper first discusses why we propose the algebra, then briefly introduces what the algebra is, and finally describes how to use the algebra in a real scenario.
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.007 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.004 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.002 | 0.004 |
| Scholarly communication | 0.006 | 0.014 |
| Open science | 0.003 | 0.004 |
| Research integrity | 0.002 | 0.005 |
| Insufficient payload (model declined to judge) | 0.006 | 0.003 |
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".