Automatic Conflict Resolution to Integrate Relational Schema
Notice bibliographique
Résumé
With the constantly increasing reliance on database systems to store, process, and display data comes the additional problem of ensuring interoperability between these systems. On a wider scale, the World-Wide Web (WWW) provides users with the ability to access a vast number of data sources distributed across the planet. However, a fundamental problem with distributed data access is the determination of semantically equivalent data. Ideally, users should be able to extract data from multiple sites and have it automatically combined and presented to them in a usable form. No system has been able to accomplish these goals due to limitations in expressing and capturing data semantics. Schema integration is required to provide database interoperability and involves the resolution of naming, structural, and semantic conflicts. To this point, automatic schema integration has not been possible. This thesis demonstrates that integration may be increasingly automated by capturing data semantics using a standard dictionary. This thesis proposes an architecture for automatically constructing an integrated view by combining local views that are defined by independently expressing database semantics in XML documents (X-Specs) using only a pre-defined dictionary as a binding between integration sites. The dictionary eliminates naming conflicts and reduces semantic conflicts. Structural conflicts are resolved at query-time by translating from the semantic integrated view to structural queries. The system provides both logical and physical access transparency by mapping user queries on high-level concepts to schema elements in the underlying data sources. The architecture automatically integrates relational databases, and its application of standardization to the integration problem is unique. The architecture may be deployed in a centralized or distributed fashion, and preserves full database autonomy while allowing transparent access to all databases participating in a global federation without the user's knowledge of the underlying data sources, their location, and their structures. Thus, the contribution is a system which provides system transparency to users, while preserving autonomy for all systems. A distributed deployment allows integration using a web browser, and would have a major impact on how the Web is used and delivered. The integration software, Unity, is the bridge between concept and implementation. Unity is a complete software package for the construction and modification of standard dictionaries, parsing of database schema and metadata to construct X-Specs, combining X-Specs into an integrated view, and for transparent querying. Integration results obtained using Unity illustrate the usefulness of the approach.
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.
Comment cette classification a été obtenuedéplier
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,001 |
| 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,000 | 0,001 |
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écouleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».