A dynamic data structure for top-k queries on uncertain data
نویسندگان
چکیده
منابع مشابه
Dynamic Structures for Top- k Queries on Uncertain Data
In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i ∈ S with score f(i) appears independently with probability p(i). The top-k query on S asks for the set of k elements that has the maximum probability of appearing to be the k elements with the highest scores in a random ...
متن کاملFully Dynamic Data Structure for Top-k Queries on Uncertain Data
Top-k queries allow end-users to focus on the most important (top-k) answers amongst those which satisfy the query. In traditional databases, a user defined score function assigns a score value to each tuple and a top-k query returns k tuples with the highest score. In uncertain database, top-k answer depends not only on the scores but also on the membership probabilities of tuples. Several top...
متن کاملA Review on Top-K Dominating Queries on Incomplete Data
Data mining is a powerful way to discover knowledge within the large amount of the data. Incomplete data is general, finding out and querying these type of data is important recently. The top-k dominating (TKD) queries return k objects that overrides maximum number of objects in a given dataset. It merges the advantages of skyline and top-k queries. This plays an important role in many decision...
متن کاملA Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries
We consider the scenario of n sensor nodes observing streams of data. The nodes are connected to a central server whose task it is to compute some function over all data items observed by the nodes. In our case, there exists a total order on the data items observed by the nodes. Our goal is to compute the k currently lowest observed values or a value with rank in [(1−ε)k, (1+ε)k] with probabili...
متن کاملEfficiently Answering Probabilistic Threshold Top - k Queries on Uncertain Data ( Extended Abstract )
In this paper, we propose a novel type of probabilistic threshold top-k queries on uncertain data, and give an exact algorithm. More details can be found in [4]. I. PROBABILISTIC THRESHOLD TOP-k QUERIES We consider uncertain data in the possible worlds semantics model [1], [5], [7], which is also adopted by some recent studies on uncertain data processing, such as [8], [2], [6]. Generally, an u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.06.016