Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/69380
DC FieldValueLanguage
dc.contributor資科系en_US
dc.creator陳良弼zh_TW
dc.creatorChen,Arbee L. P.;Tsai, Pauray S. M.;Koh, Jia-Lingen_US
dc.date1996-04en_US
dc.date.accessioned2014-08-28T02:14:42Z-
dc.date.available2014-08-28T02:14:42Z-
dc.date.issued2014-08-28T02:14:42Z-
dc.identifier.urihttp://nccur.lib.nccu.edu.tw/handle/140.119/69380-
dc.description.abstractIn a multidatabase system that consists of object databases, the same real-world entity can be stored as objects in different databases with incompatible object identifiers. How to identify and integrate these objects representing the same entities such that (a) object duplication in the query result can be avoided, (b) information for the entity can be gathered, and (c) the specialization of multiple classes can be built is an important issue to provide a well structured global object schema and a more informative query result. In this paper, we extend our results on probabilistic query processing and joining relations on incompatible keys to solve the problem. Various data and schema conflicts such as missing data, inconsistent data and domain mismatch which may exist in classes from different databases are considered in the process of identification.en_US
dc.format.extent117 bytes-
dc.format.mimetypetext/html-
dc.language.isoen_US-
dc.relationDISTRIBUTED AND PARALLEL DATABASES,4(2),143-168en_US
dc.subjectDatabase systems;Probability;Query languages;Interfaces (computer);Knowledge based systemsen_US
dc.titleIdentifying object isomerism in multidatabase systemsen_US
dc.typearticleen
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.languageiso639-1en_US-
item.openairetypearticle-
item.grantfulltextrestricted-
item.cerifentitytypePublications-
item.fulltextWith Fulltext-
Appears in Collections:期刊論文
Files in This Item:
File Description SizeFormat
index.html117 BHTML2View/Open
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.