.png){kind=icon}
返回
Evaluating aggregate operations over imprecise data
.png){kind=icon}
PRE
AI
DOI：10.1109/69.494166.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Imprecise data in databases were originally denoted as null values, which represent the meaning of ''values unknown at present.'' More generally, a partial value corresponds to a finite set of possible values for an attribute in which exactly one of the values is the ''true'' value. In this paper, we define a set of extended aggregate operations, namely sum, average, count, maximum, and minimum, which can be applied to an attribute containing partial values. Two types of aggregate operators are considered: scalar aggregates and aggregate functions. We study the properties of the aggregate operations and develop efficient algorithms for count, maximum and minimum. However, for sum and average, we point out that in general it takes exponential time complexity to do the computations.
Keyword:
relational databases
null values
partial values
scalar aggregates
aggregate functions
graph theory
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容