top2-k查询：一种top-k查询结果简化查询算法word论文.docxVIP

降低了查询时间。最后，针对基于多用户的top-k查询以及top2-k查询进行了实验。通过IBM的数据生成器给出了可靠的模拟数据。在多用户的top-k查询实验中，针对不同维度的数据进行了多组k值不同的实验。实验表明，多用户偏好的两个查询算法VBA算法及LBA算法查询效率理想。在top2-k查询查询的实验中，针对二维情况，做了不同k值得多组实验，结果表明，优化算法OTop2-k的效率优于算法WTop2-k及算法 STop2-k。本文在传统的top-k查询的基础之上定义了多用户的top-k查询，并提出解决该查询的两个查询算法，即VBA算法和LBA算法，理论论证了其正确性与完备性，实验结果表明，VBA算法及LBA算法的查询效率高。在多用户的top-k查询的基础上提出了top2-k查询，并给出了两种方式的top2-k查询算法，即先从用户的角度进行top-k查询的WTop2-k算法与先从旅馆的角度进行top-k查询的STop2-k算法。为了提高top2-k查询的查询效率，提出了优化算法OTop2-k。对优化算法OTop2-k做了正确性和完备性的理论证明并进行了实验，结果表明，算法OTop2-k与算法WTop2-k和算法STop2-k相比在查询效率方面有了很大提高。关键词：top2-k查询，top-k查询，查询处理IITOP2-KONEKINDOFQUERYALGORITHMTOSIMPLIFYTOP-KQUERYRESULTSABSTRACTWiththepopularityofthenetwork,moreandmorenetworkserviceshavesprungupin peoplesvision.Althoughtheseservicesareuser-friendly,usersarehardtogettheinformation whichmeetstheirrequirementsconvenientlyaswiththeincreasingnumberofinformation providedtothem.Evenifusinguserqueryconstraints,itisstillnotabletoprovideaccurate informationtousersintodayseraoflargedatanetwork.Orderonlinehotelreservations,for example,althoughtheusercansearchtheInternetalotofhotelinformationbasedonsearch criteria,thehotelinformationistoomuchthatitisparticularlyimportanttohelpusersbetterto choosethemostsuitablehotel.top-kqueryisanimportantdataminingmethodtothesolutionof theproblem.Accordingtothesurvey,liveoff,Ctripandotherwell-knownInternetcompaniesare usingtop-kquerytoprovidepersonalizedrecommendationsforregisteredusersatpresent. However,thecurrenttop-kquerycontainsadefectwhichcannotbeignoredinsolvingthese problems; itignorestheinterestsofthehotels,recommendhotelstothenon-potentialusers,which increasestheusers’choosingdifficulty.Asaresult,itisanurgentproblemtobesolvedtoavoid the hotels recommended to non-potentialusers.Inordertosolvetheaboveproblem,first,wedefinethemulti-userpreferencesbasedtop-k querybasedonthetraditionaltop-kquery,whichgivesusersacustomizedtop-kqueryresultstomeetthediverseneedsoftheuserqueryresults.Accordingtothequeryproblem,wegivetwo top-kqueryalgorithms,thatis,theVBAa