Query processing issues in object-oriented database system-preliminary ideas
Bibliographic record
Abstract
Object-oriented database technology is being developed to provide support for advanced applications such as engineering databases, office information systems, and knowledge bases. Successful deployment of these systems requires the provision of full set of features and capabilities found in traditional data managers (e.g., relational systems). An important feature is a declarative query language and its associated query processor. Development of query models and design of query processors is well understood in traditional database management systems. However, the task is complicated in object-oriented systems due to the richness of the data model. The query models necessarily become more complex and their optimization significantly more difficult. The author discusses the issues that need to be considered in the development of query models and in the implementation of query processors in object-oriented database systems.>
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.013 | 0.019 |
| Meta-epidemiology (narrow) | 0.001 | 0.002 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.002 | 0.004 |
| Science and technology studies | 0.002 | 0.007 |
| Scholarly communication | 0.012 | 0.022 |
| Open science | 0.004 | 0.002 |
| Research integrity | 0.004 | 0.005 |
| Insufficient payload (model declined to judge) | 0.005 | 0.002 |
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".