top-k query processingtop-k semanticsuncertain data settingsuncertain databasesTop-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interp
Soliman M, Ilyas I, Chang K. Top-k query processing in uncertain databases. ICDE, 2007. Google Scholar Soliman M, Ilyas I, Chang K. Probabilistic top-k and ranking-aggregate queries. ACM TODS, 2008. Google Scholar Soliman M, Ilyas I. Ranking with Uncertain Scores. ICDE, 2009. Google Sc...
Yi, K., Li, F., Srivastava, D., Kollios, G.: Efficient processing of top-k queries in uncertain databases. In: ICDE, pp. 385–394 (2000) Zakos, J., Verma, B.: A novel context-based technique for web information retrieval. World Wide Web 9(4), 485–503 (2006) Article Google...
Motivated by the shortcomings of both queries above, in this pa- per, we formulate an important query, namely probabilistic top- k dominating (PTD) query, in the context of uncertain databases. Specifically, a PTD query obtains k uncertain objects in an uncer- ...
Motivated by the shortcomings of both queries above, in this paper, we formulate an important query, namely probabilistic top-k dominating (PTD) query, in the context of uncertain databases. Specifically, a PTD query obtains k uncertain objects in an uncertain database that are expected to be ...
Sliding-windowTop-kQueriesonUncertainStreams,VLDB2008 2 PossibleWorldModel IDAsmallrecordsetofreadinglogs1234Tuples8,6,5,216possibleworldinstances8,58,26,55,2EmptyPr..064.096.016.144.096.036 Speed(*10)5682Tuples8,6,58,6,286,25 Prob.0.80.50.40.4Pr.TuplesPr..064.024.096.036.024 .0968,...
计算机研究与发展JournalofComputerResearchandDevelopmentISSN1000—139/CN11—1777/TP46Suppl.:80—86,009PP环境中不确定数据Top—k查询处理算法孙永佼东北大学信息科学与工程学院沈阳王国仁110004gence3@gmail.cornPPTop—kQueryProcessingAlgorithmsoverUncertain
One challenge in uncertain query answering is that one uncertain query may generate multiple mapping queries, which require a large amount of time and system resources to process [11], [12], [15], [16]. Another challenge is how to rank important tuples and return top-k answers to the ...
Probabilistic queries on uncertain data have been intensively investigated lately. Top-k dominating query is important in many applications, e.g., decision making, as it offers choices which are better than the most of others. In this paper, we study the
不确定数据库中概率top_k和排序查询算法