1. NCCU Academic Hub
  2. 學術產出
  3. 資訊學院
  4. 期刊論文
  5. Item

學術產出-期刊論文

文章檢視/開啟

書目匯出

Google ScholarTM

政大圖書館

引文資訊

TAIR相關學術產出

題名 Searching a minimal semantically-equivalent subset of a set of partial values
作者 陳良弼
Tseng,Frank S. C. Ph.D.; Chen,Arbee L. P. Ph.D.; Yang,Wei-Pang Ph.D.
貢獻者 資科系
關鍵詞 Heterogeneous database systems;probabilistic partial values;schema integration problems;uncertain query answers
日期 1993-10
上傳時間 28-八月-2014 10:15:33 (UTC+8)
摘要 Imprecise data exist in databases due to their unavailability or to data/ schema incompatibilities in a multidatabase system. Partial values have been used to represent imprecise data. Manipulation of partial values is therefore necessary to process queries involving imprecise data. In this article, we study the problem of eliminating redundant partial values that result from a projection on an attribute with partial values. The redundancy of partial values is defined through the interpretation of a set of partial values. This problem is equivalent to searching a minimal semantically-equivalent subset of a set of partial values. A semantically-equivalent subset contains exactly the same information as the original set. We derive a set of useful properties and apply a graph matching technique to develop an efficient algorithm for searching such a minimal subset and therefore eliminating redundant partial values. By this process, we not only provide a concise answer to the user, but also reduce the communication cost when partial values are requested to be transmitted from one site to another site in a distributed environment. Moreover, further manipulation of the partial values can be simplified. This work is also extended to the case of multi-attribute projections.
關聯 The VLDB Journal, The VLDB Endowment,489-512
資料類型 article
dc.contributor 資科系en_US
dc.creator (作者) 陳良弼zh_TW
dc.creator (作者) Tseng,Frank S. C. Ph.D.; Chen,Arbee L. P. Ph.D.; Yang,Wei-Pang Ph.D.en_US
dc.date (日期) 1993-10en_US
dc.date.accessioned 28-八月-2014 10:15:33 (UTC+8)-
dc.date.available 28-八月-2014 10:15:33 (UTC+8)-
dc.date.issued (上傳時間) 28-八月-2014 10:15:33 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/69386-
dc.description.abstract (摘要) Imprecise data exist in databases due to their unavailability or to data/ schema incompatibilities in a multidatabase system. Partial values have been used to represent imprecise data. Manipulation of partial values is therefore necessary to process queries involving imprecise data. In this article, we study the problem of eliminating redundant partial values that result from a projection on an attribute with partial values. The redundancy of partial values is defined through the interpretation of a set of partial values. This problem is equivalent to searching a minimal semantically-equivalent subset of a set of partial values. A semantically-equivalent subset contains exactly the same information as the original set. We derive a set of useful properties and apply a graph matching technique to develop an efficient algorithm for searching such a minimal subset and therefore eliminating redundant partial values. By this process, we not only provide a concise answer to the user, but also reduce the communication cost when partial values are requested to be transmitted from one site to another site in a distributed environment. Moreover, further manipulation of the partial values can be simplified. This work is also extended to the case of multi-attribute projections.en_US
dc.format.extent 117 bytes-
dc.format.mimetype text/html-
dc.language.iso en_US-
dc.relation (關聯) The VLDB Journal, The VLDB Endowment,489-512en_US
dc.subject (關鍵詞) Heterogeneous database systems;probabilistic partial values;schema integration problems;uncertain query answersen_US
dc.title (題名) Searching a minimal semantically-equivalent subset of a set of partial valuesen_US
dc.type (資料類型) articleen