MétaCan
Menu
Back to cohort
Record W2140192228 · doi:10.1109/kbse.1992.252906

Reusing database queries in analogical domains

2003· article· en· W2140192228 on OpenAlexaff
Hamid. Ould-Brahim, Stan Matwin

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Database Systems and Queries
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceDomain (mathematical analysis)PlannerSQLSimple (philosophy)DocumentationBase (topology)Programming languageReuseNatural languageInformation retrievalDatabaseTheoretical computer scienceArtificial intelligenceMathematics

Abstract

fetched live from OpenAlex

The authors develop an approach which reuses queries from a well known domain called the base domain in an unfamiliar one called the target domain. The objective is to model the behavior of naive users who often adapt queries from documentation examples to the problem at hand. They rely on a weak form of derivational analogy-traces of a planner operating in the base domain are used to derive a target domain query's implementation in SQL from its specification. The very simple planner used builds in the base domain plans that result in particularly simple, prototypical queries. Queries are specified in a high level subset of a natural language.>

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 imitation

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

metaresearch head score (Codex)0.006
metaresearch head score (Gemma)0.025
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.006
Threshold uncertainty score0.033

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0060.025
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0020.002
Science and technology studies0.0010.004
Scholarly communication0.0050.013
Open science0.0050.009
Research integrity0.0030.003
Insufficient payload (model declined to judge)0.0030.001

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.021
GPT teacher head0.264
Teacher spread0.243 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
Domainnot available
GenreMethods

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

Quick stats

Citations2
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Database Systems and QueriesFrench-language works237,207