Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

M. W. Bright

dblp:73/1842 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1994
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data integration and cleaning · 44% Distributed and cloud data management · 44% Query processing and optimization · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed and cloud data management
multidatabase systems
0.011994
Automated Resolution of Semantic Heterogeneity in Multidatabases · ACM Trans. Database Syst. 1994
Data integration and cleaning
schema matching
0.011994
Automated Resolution of Semantic Heterogeneity in Multidatabases · ACM Trans. Database Syst. 1994
Query processing and optimization › uncertain data query processing
imprecise query answering
0.011994
Automated Resolution of Semantic Heterogeneity in Multidatabases · ACM Trans. Database Syst. 1994

Methods — techniques the papers use, named apart from their topics

summary schemas model · 0.0simulation · 0.0
YearPublicationVenuePosition
1994 Automated Resolution of Semantic Heterogeneity in Multidatabases
abstract
A multidatabase system provides integrated access to heterogeneous, autonomous local databases in a distributed system. An important problem in current multidatabase systems is identification of semantically similar data in different local databases. The Summary Schemas Model (SSM) is proposed as an extension to multidatabase systems to aid in semantic identification. The SSM uses a global data structure to abstract the information available in a multidatabase system. This abstracted form allows users to use their own terms (imprecise queries) when accessing data rather than being forced to use system-specified terms. The system uses the global data structure to match the user's terms to the semantically closest available system terms. A simulation of the SSM is presented to compare imprecise-query processing with corresponding query-processing costs in a standard multidatabase system. The costs and benefits of the SSM are discussed, and future research directions are presented.
M. W. Bright, Ali R. Hurson, Simin H. Pakzad
ACM Trans. Database Syst.1