MétaCan
Menu
Back to cohort
Record W1991007986 · doi:10.1145/1764810.1764823

A towards an extended relational algebra for software architecture

2010· article· en· W1991007986 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueACM SIGSOFT Software Engineering Notes · 2010
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Software Engineering Methodologies
Canadian institutionsWestern University
Fundersnot available
KeywordsRelation (database)Computer scienceSet (abstract data type)Relational algebraAlgebra over a fieldArchitecture description languageSoftwareArchitectureSoftware architectureProgramming languageMathematicsRelational databasePure mathematicsReference architectureDatabase

Abstract

fetched live from OpenAlex

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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.311
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch, Meta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.485
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.311
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0030.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.031
GPT teacher head0.285
Teacher spread0.254 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it