{"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.