Pourquoi ce travail est dans la base
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Notice bibliographique
Résumé
The overwhelming acceptance of the SQL standard \cite{Date94} has curtailed continuing research work in relational database query languages and processing. Since all commercial relational database systems conform with the SQL standard, there is little motivation for developing new query languages. Despite its benefits and wide-spread acceptance, SQL is not a perfect query language. Complex database schema challenge even experienced database users during query formulation. As increasing numbers of less sophisticated users access numerous data sources within an organization or across the Internet, their ability to accurately construct queries with the appropriate structure and semantics diminishes. SQL can be hard to use as it provides only physical access transparency not logical transparency. That is, a user is responsible for mapping the semantics of their query to the semantics and structure of the database. Although graphical tools for query construction and high-level programming languages mask some of the complexity, the notion of querying by structure is intrinsic to most forms of data access. In this work, we overview a new query language developed in conjunction with our integration architecture for automatically integrating relational schema. Although the major focus of this work is on database interoperability, the contribution of this paper is a language for specifying queries on the integrated view produced. The complexities of querying across database systems and resolving conflicts are too numerous to be fully described here, so this paper will discuss querying the integrated view of a single database. The integration architecture integrates database schema information into a context view (CV). The context view is a high-level view of database semantics which allows logically and physically transparent access to the underlying data source(s). Since this context view is an entirely new way of organizing and categorizing database information, a new query language is developed. However, we demonstrate that the context view has similar properties as the Universal Relational Model and thus can benefit from its associated algorithms and ideas. By allowing the user to query by context and semantic connotation, a whole new level of query complexity arises. Mapping of queries from semantic concepts to physical tables, fields, and relationships must be automatically performed. We will demonstrate that specific relational calculus expressions or SQL queries can be generated from abstract concepts which are rigorous enough for use in industrial applications and systems. Specifically, SQL generation and join discovery are overviewed. Thus, the query language can be mapped to SQL allowing backwards compatibility with existing systems. Notes: Joint released technical report. Released as TR-00-16 for the University of Manitoba, and 2000-663-15 for the University of Calgary.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,002 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle