Auto-Indexing Selection Technique in Databases under Space Usage Constraint Using FP-Growth and Dynamic Programming

K. Nimkanjana, S. Vanichayobon, W. Wettayaprasit
{"title":"Auto-Indexing Selection Technique in Databases under Space Usage Constraint Using FP-Growth and Dynamic Programming","authors":"K. Nimkanjana, S. Vanichayobon, W. Wettayaprasit","doi":"10.1109/ICCEE.2008.132","DOIUrl":null,"url":null,"abstract":"This paper presents an auto-indexing selection technique to improve query processing time under indices' space usage limitation. The technique is composed of two steps: candidate extraction and index selection. In the candidate extraction step, data mining technique called FP-growth is used to find relationships among attributes. Then candidate indices are extracted. By giving space usage constraint on the index selection step, the dynamic programming approach combined with memory functions technique is used to find the most valuable subset of the indices among the candidates.","PeriodicalId":365473,"journal":{"name":"2008 International Conference on Computer and Electrical Engineering","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Computer and Electrical Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCEE.2008.132","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper presents an auto-indexing selection technique to improve query processing time under indices' space usage limitation. The technique is composed of two steps: candidate extraction and index selection. In the candidate extraction step, data mining technique called FP-growth is used to find relationships among attributes. Then candidate indices are extracted. By giving space usage constraint on the index selection step, the dynamic programming approach combined with memory functions technique is used to find the most valuable subset of the indices among the candidates.
空间约束下基于fp增长和动态规划的数据库自动索引选择技术
在索引空间使用有限的情况下,提出了一种自动索引选择技术,以提高查询处理时间。该技术由两个步骤组成:候选提取和索引选择。在候选提取步骤中,使用FP-growth数据挖掘技术查找属性之间的关系。然后提取候选索引。通过对索引选择步骤施加空间使用约束,利用动态规划方法结合内存函数技术,从候选索引中找出最有价值的索引子集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信