...
首页> 外文期刊>International Journal of Uncertainty, Fuzziness, and Knowledge-based Systems >WD-PWS: THE FIRST SEMANTICS FOR QUERYING OVER PROBABILISTIC DATA STREAMS WITH CONTINUOUS DISTRIBUTIONS
【24h】

WD-PWS: THE FIRST SEMANTICS FOR QUERYING OVER PROBABILISTIC DATA STREAMS WITH CONTINUOUS DISTRIBUTIONS

机译:WD-PWS:查询具有连续分布的概率数据流的第一种方法

获取原文
获取原文并翻译 | 示例
           

摘要

Many emerging applications need continuous querying over uncertain event streams, mostly for online monitoring. These streaming uncertain events may come from radars, sensors, or even software hooks. The uncertainty is usually due to measurement errors, inherent ambiguities and privacy preserving reasons. To cover new requirements, we have designed and implemented a new system called Probabilistic Data Stream Management System (PDSMS) in Ref. 1. PDSMS is a data processing engine which runs continuous queries over probabilistic streams. However, lack of a semantics for probabilistic databases which supports continuous distributions prevented us from having a strong foundation for our query operators. It also precludes us from proving consistency and correctness of query operations especially after optimization and adaption. In fact, in the probabilistic database literature, there is no semantics available which covers continuous distributions. This limitation is very restrictive as in real-world, uncertainty is usually modeled by continuous distributions. In this paper, after presenting a basic probabilistic data model for PDSMS, we focus on querying and formally present the first semantics for probabilistic query operations which supports continuous distributions as well as discrete ones. Using this new semantics, we define our query operators (e.g. select, project, and join) formally without ambiguity and compatible with operators in relational algebra. Thus, we can leverage many transformation rules in relational algebra as well. This new semantics allows us to have different strictness levels and consistency between operators. We also proved many strictness theorems about different alternatives for query operators.
机译:许多新兴应用程序需要对不确定的事件流进行连续查询,主要是用于在线监视。这些不确定的流事件可能来自雷达,传感器甚至软件挂钩。不确定性通常是由于测量误差,固有的模糊性和隐私保护原因所致。为了满足新的要求,我们在参考资料中设计并实现了一个称为概率数据流管理系统(PDSMS)的新系统。 1. PDSMS是一种数据处理引擎,可对概率流进行连续查询。但是,概率数据库缺乏支持连续分布的语义,这使我们无法为查询运算符奠定坚实的基础。这也使我们无法证明查询操作的一致性和正确性,尤其是在优化和适应之后。实际上,在概率数据库文献中,没有可用于覆盖连续分布的语义。这种限制非常严格,因为在现实世界中,不确定性通常是通过连续分布来建模的。在本文中,在介绍了PDSMS的基本概率数据模型之后,我们集中于查询,并正式提出了概率查询操作的第一个语义,该语义支持连续分布和离散分布。使用这种新的语义,我们正式定义了查询运算符(例如选择,投影和联接),而没有歧义并且与关系代数中的运算符兼容。因此,我们也可以在关系代数中利用许多变换规则。这种新的语义使我们能够在运算符之间具有不同的严格性级别和一致性。我们还证明了关于查询运算符不同选择的许多严格性定理。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号