ویراساینس.
سند علمی

Top-k best probability queries and semantics ranking properties on probabilistic databases

Trieu Minh Nhut Le, Jinli Cao, Zhen He

چکیده

There has been much interest in answering top-k queries on probabilistic data in various applications such as market analysis, personalised services, and decision making. In probabilistic relational databases, the most common problem in answering top-k queries (ranking queries) is selecting the top-k result based on scores and top-k probabilities. In this paper, we firstly propose novel answers to top-k best probability queries by selecting the probabilistic tuples which have not only the best top-k scores but also the best top-k probabilities. An efficient algorithm for top-k best probability queries is introduced without requiring users to define a threshold. The top-k best probability approach is a more efficient and effective than the probability threshold approach (PT-k) [1, 2]. Second, we add the “k-best ranking score” into the set of semantic properties for ranking queries on uncertain data proposed by [3, 4]. Then, our proposed method is analysed, which meets the semantic ranking properties on uncertain data. In addition, it proves that the answers to the top-k best probability queries overcome drawbacks of previous definitions of the top-k queries on probabilistic data in terms of semantic ranking properties. Lastly, we conduct an extensive experimental study verifying the effectiveness of answers to the top-k best probability queries compared to PT-k queries on uncertain data and the efficiency of our algorithm against the state-of-the-art execution of the PT-k algorithm using both real and synthetic data sets. c ⃝ 2011 Published by Elsevier Ltd.

اسناد مشابه

  • Top-k Best Probability Queries on Probabilistic Data

    سند علمی۲۰۱۲DASFAATrieu Minh Nhut Le, Jinli Cao

    There has been much interest in answering top-k queries on probabilistic data in various applications such as market analysis, personalised services, and decision making. In relation to probabilistic data, the most common problem in answering top-k queries is selecting the semant

  • Most Probable Explanations for Probabilistic Database Queries (Extended Abstract)

    سند علمی۲۰۱۷İsmail İlkan Ceylan, Stefan Borgwardt, Thomas Lukasiewicz

    Probabilistic databases (PDBs) have been widely studied in the literature, as they form the foundations of large-scale probabilistic knowledge bases like NELL and Google’s Knowledge Vault. In particular, probabilistic query evaluation has been investigated intensively as a centra

  • Most Probable Explanations for Probabilistic Database Queries

    سند علمی۲۰۱۷IJCAIIsmail Ilkan Ceylan, Stefan Borgwardt, Thomas Lukasiewicz

    Forming the foundations of large-scale knowledge bases, probabilistic databases have been widely studied in the literature. In particular, probabilistic query evaluation has been investigated intensively as a central inference mechanism. However, despite its power, query evaluati

  • Probabilistic top-k range query processing for uncertain databases

    سند علمی۲۰۱۶Journal of Intelligent and Fuzzy SystemsGuoqing Xiao, Fan Wu, Xu Zhou, Keqin Li

    Query processing over uncertain data is very important in many applications due to the existence of uncertainty in real-world data. In this paper, we propose a novel and important query for uncertain data, namely probabilistic top-(k, l) range (PTR) query, which retrieves l uncer

  • Effective Top-k Keyword Search in Relational Databases Considering Query Semantics

    سند علمی۲۰۰۹APWeb/WAIM WorkshopsYanwei Xu, Yoshiharu Ishikawa, Jihong Guan

    Keyword search in relational databases has recently emerged as a new research topic. As a search result is often assembled from multiple relational tables, existing IR-style ranking strategies can not be applied directly. In this paper, we propose a novel IR ranking strategy cons

  • Semantics and evaluation of top-k queries in probabilistic databases

    مقاله‌ی دسترسی آزاد۲۰۰۹Distributed and Parallel DatabasesXiZhang, JanChomicki