lecturer: jiaheng lu
lecture time: may 24th 4:00pm
lecture place: information building, room 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.
