An Approach to Optimize Query Using Rank Aware Scoring Function

Vivek Shrivastava, B. Patel
{"title":"An Approach to Optimize Query Using Rank Aware Scoring Function","authors":"Vivek Shrivastava, B. Patel","doi":"10.1109/CICN.2013.110","DOIUrl":null,"url":null,"abstract":"Information retrieving and storing are the basic tasks of the relational database. Query optimization is used for accessing database in an efficient manner, analyzing and choosing an optimized plan is a complex process. Today's end-users are more interested in specific results rather than getting response in short time. Ranking queries (or top-k queries) are support for accessing specific results based on user's demand. Efficient execution of top-k queries is becoming a major challenge for relational database. Ranking queries produce results that are ordered on some ranking attribute. This paper presents a scoring function based rank query optimization methodology where scoring function decide preference over conduction as per user demand and shows the result of both query without ranking and ranked query, the result of ranked query is better than without ranked query.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 5th International Conference on Computational Intelligence and Communication Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICN.2013.110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Information retrieving and storing are the basic tasks of the relational database. Query optimization is used for accessing database in an efficient manner, analyzing and choosing an optimized plan is a complex process. Today's end-users are more interested in specific results rather than getting response in short time. Ranking queries (or top-k queries) are support for accessing specific results based on user's demand. Efficient execution of top-k queries is becoming a major challenge for relational database. Ranking queries produce results that are ordered on some ranking attribute. This paper presents a scoring function based rank query optimization methodology where scoring function decide preference over conduction as per user demand and shows the result of both query without ranking and ranked query, the result of ranked query is better than without ranked query.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种基于等级感知评分函数的查询优化方法
信息检索和存储是关系数据库的基本任务。查询优化是一种高效访问数据库的方法,分析和选择优化方案是一个复杂的过程。今天的终端用户对具体的结果更感兴趣,而不是在短时间内得到响应。排名查询(或top-k查询)是基于用户需求访问特定结果的支持。高效执行top-k查询正成为关系数据库面临的主要挑战。排名查询产生的结果是按某些排名属性排序的。本文提出了一种基于评分函数的排序查询优化方法,其中评分函数根据用户需求决定偏好与传导,并同时显示不排序查询和排序查询的结果,排序查询的结果优于不排序查询的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Research on the Model of Legacy Software Reuse Based on Code Clone Detection QoS in Interconnection of Next Generation Networks Post Silicon Debugging Approach for USB2.0: Case Study of Enumeration Based on Fiber-Optic Sensor and the Light Intensity Changes Vehicle Dynamic Weighing System Comparison of AOMDV Routing Protocol under IEEE802.11 and TDMA Mac Layer Protocol
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1