Efficient support for multi-attribute top-k relational queries: a cost-based approach
Efficient support for multi-attribute top-k relational queries: a cost-based approach
批准号:
328087-2006
负责人:
Ayanso, Anteneh
金额:
$0.95万
依托单位:
依托单位国家:
加拿大
项目类别:
Discovery Grants Program - Individual
财政年份:
2007
资助国家:
加拿大
项目状态:
已结题
起止时间:
2007-01-01 至 2008-12-31
中文摘要
点击翻译按钮获取中文摘要
英文摘要
Querying for "approximate matches" is very common in document and multimedia retrieval systems. In search engines, for example, users specify a set of keywords and expect in return a ranking of relevant pages or documents related to the keywords. In contrast, the querying methods available in relational database management systems (RDBMSs) are designed to return only results found within specified selection conditions. Due to this, users of online business applications such as product recommendation systems, price comparison and shopping agents routinely face the challenge of specifying value ranges of attributes in search of relevant results. Often, they get either too few or too many results that are of limited relevance to their request. This conventional querying process is very frustrating for the user and extremely inefficient for the system. Alternatively, users of the above applications should be able to specify target values of attributes and expect to obtain a ranked set of a desired number of results that best match the specified values across all the attributes (e.g., the top 10 best matches). In this type of querying, also known as top-k querying, results are not limited to exact matches but include close matches around the target values of interest. This research studies cost-based strategies for efficient support of this class of queries in RDBMSs. The objective is to provide methods that work within the technical constraints of the existing design of RDBMSs but avoid a full sequential scan of the database to obtain the top-k set. In particular, the proposed research introduces techniques that systematically incorporate the relevant performance cost factors and their underlying trade-offs for efficient top-k retrieval. The methodology encompasses analytical modelling and extensive computational and experimental analyses using real and synthetic data sets over a wide range of experimental settings.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Efficient Strategies and Analytics Solutions for Social Media Targeting via Text Mining
-
批准号:522170-2018
-
项目类别:Engage Grants Program
-
资助金额:$1.82万
-
财政年份:2018
-
负责人:Ayanso, Anteneh
-
依托单位:
Efficient support for multi-attribute top-k relational queries: a cost-based approach
-
批准号:328087-2006
-
项目类别:Discovery Grants Program - Individual
-
资助金额:$0.95万
-
财政年份:2008
-
负责人:Ayanso, Anteneh
-
依托单位:
Efficient support for multi-attribute top-k relational queries: a cost-based approach
-
批准号:328087-2006
-
项目类别:Discovery Grants Program - Individual
-
资助金额:$0.95万
-
财政年份:2006
-
负责人:Ayanso, Anteneh
-
依托单位:
国内基金
海外基金
两性离子载体(zwitterionic support)作为可溶性支载体在液相有机合成中的应用
-
批准号:21002080
-
项目类别:青年科学基金项目
-
资助金额:19.0万元
-
批准年份:2010
-
负责人:霍聪德
-
依托单位:
微生物发酵过程的自组织建模与优化控制
-
批准号:60704036
-
项目类别:青年科学基金项目
-
资助金额:21.0万元
-
批准年份:2007
-
负责人:高学金
-
依托单位:
基于Support Vector Machines(SVMs)算法的智能型期权定价模型的研究
-
批准号:70501008
-
项目类别:青年科学基金项目
-
资助金额:17.0万元
-
批准年份:2005
-
负责人:曹丽娟
-
依托单位: