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