學術產出-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

  • No doi shows Citation Infomation
題名 Aggregate functions over probabilistic data
作者 陳良弼
Chang,Chih-Shyang
Chen,Arbee L.P
貢獻者 資科系
日期 1996-01
上傳時間 28-Aug-2014 10:14:48 (UTC+8)
摘要 Various extended relational data models were proposed to handle uncertain data including possibilistic and probabilistic data. Query processing involving aggregate functions over uncertain data is rarely considered. In this paper, we define a set of extended aggregate functions over probabilistic data. The time complexity of the computations for these extended aggregate functions is, in general, exponential. We develop two efficient algorithms for the computation of the maximum and minimum aggregate functions. The worst-case time complexity of the algorithms are O(n2). These algorithms can be extended to handle the possibilistic data. That is, our work is devoted to the accommodation of uncertain data in database systems with an elaboration on speeding up the processing efficiency of the aggregate functions.
關聯 Information Sciences,88(1-4),15-45
資料類型 article
dc.contributor 資科系en_US
dc.creator (作者) 陳良弼zh_TW
dc.creator (作者) Chang,Chih-Shyangen_US
dc.creator (作者) Chen,Arbee L.Pen_US
dc.date (日期) 1996-01en_US
dc.date.accessioned 28-Aug-2014 10:14:48 (UTC+8)-
dc.date.available 28-Aug-2014 10:14:48 (UTC+8)-
dc.date.issued (上傳時間) 28-Aug-2014 10:14:48 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/69381-
dc.description.abstract (摘要) Various extended relational data models were proposed to handle uncertain data including possibilistic and probabilistic data. Query processing involving aggregate functions over uncertain data is rarely considered. In this paper, we define a set of extended aggregate functions over probabilistic data. The time complexity of the computations for these extended aggregate functions is, in general, exponential. We develop two efficient algorithms for the computation of the maximum and minimum aggregate functions. The worst-case time complexity of the algorithms are O(n2). These algorithms can be extended to handle the possibilistic data. That is, our work is devoted to the accommodation of uncertain data in database systems with an elaboration on speeding up the processing efficiency of the aggregate functions.en_US
dc.format.extent 1223901 bytes-
dc.format.mimetype application/pdf-
dc.language.iso en_US-
dc.relation (關聯) Information Sciences,88(1-4),15-45en_US
dc.title (題名) Aggregate functions over probabilistic dataen_US
dc.type (資料類型) articleen