Optimal Top-k,m Queries Processing: Algorithms and Applications
发布时间: 2011-05-23 11:10:00 浏览次数: 供稿:未知
演讲人:参考下方
讲座时间:0000-00-00 00:00:00
讲座地点:--
讲座内容

演讲人: 陆嘉恒

讲座时间: 5月24日下午16点

讲座地点: 信息楼417室

讲座内容:

报告人:陆嘉恒

摘要:In this talk, I will first introduce three research topics I am

doing currently: XML data management, Similarity search and cloud data

management. Then I will introduce our new work: top-k,m query

processing. Suppose we are given a set of groups where each attribute

in one group is associated with a list whose tuples are equipped with

IDs and scores. The goal is to return the top-k combinations of

attributes with the highest overall scores from the respective top-m

scores from lists. Top-k,m queries are different from regular top-k

queries in nature and useful in various emerging scenarios, including

recommendation systems, query refinement and medical data mining.

演讲人简介