Recommending Join Queries Based on Path Frequency

Man Yu, Shupeng Han, Yale Chai, Y. Zhang, Yanlong Wen
{"title":"Recommending Join Queries Based on Path Frequency","authors":"Man Yu, Shupeng Han, Yale Chai, Y. Zhang, Yanlong Wen","doi":"10.1109/WISA.2015.52","DOIUrl":null,"url":null,"abstract":"Real databases often consist of hundreds of innerlinked tables, which makes posing a complex join query a really hard task for common users. Join query recommendation is an effective technique to help users formulate better join queries and explore their information demand. In this paper, we propose a novel approach to automatically create join query recommendations based on path frequency. Our approach generates recommendations by analyzing the database schema and underlying data. First, we exploit join queries which are likely to be queried by considering both the importance and the connectivity of tables. Second, we provide users two recommendation forms. One needs no input information and the other allows users to input incomplete information. Users can choose one according to their knowledge. Extensive evaluations demonstrate the effectiveness of our approach and show that our method is helpful to formulate good join queries in practice.","PeriodicalId":198938,"journal":{"name":"2015 12th Web Information System and Application Conference (WISA)","volume":"220 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 12th Web Information System and Application Conference (WISA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WISA.2015.52","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Real databases often consist of hundreds of innerlinked tables, which makes posing a complex join query a really hard task for common users. Join query recommendation is an effective technique to help users formulate better join queries and explore their information demand. In this paper, we propose a novel approach to automatically create join query recommendations based on path frequency. Our approach generates recommendations by analyzing the database schema and underlying data. First, we exploit join queries which are likely to be queried by considering both the importance and the connectivity of tables. Second, we provide users two recommendation forms. One needs no input information and the other allows users to input incomplete information. Users can choose one according to their knowledge. Extensive evaluations demonstrate the effectiveness of our approach and show that our method is helpful to formulate good join queries in practice.
基于路径频率推荐连接查询
真实的数据库通常由数百个内链接表组成,这使得普通用户很难执行复杂的连接查询。连接查询推荐是一种帮助用户制定更好的连接查询和探索其信息需求的有效技术。本文提出了一种基于路径频率自动创建连接查询推荐的新方法。我们的方法通过分析数据库模式和底层数据来生成建议。首先,通过考虑表的重要性和连通性,我们利用可能被查询的连接查询。第二,我们为用户提供两种推荐表单。一个不需要输入信息,另一个允许用户输入不完整的信息。用户可以根据自己的知识选择一个。大量的评估证明了我们方法的有效性,并表明我们的方法有助于在实践中制定良好的连接查询。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信