Auto-Indexing Selection Technique in Databases under Space Usage Constraint Using FP-Growth and Dynamic Programming
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...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 935 |
|---|---|
| container_issue | |
| container_start_page | 932 |
| container_title | |
| container_volume | |
| creator | Nimkanjana, K. Vanichayobon, S. Wettayaprasit, W. |
| description | 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. |
| doi_str_mv | 10.1109/ICCEE.2008.132 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4741120</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4741120</ieee_id><sourcerecordid>4741120</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-621482175f992d5cc9bf92e15235cc11fc15835ac7cdf62029897a7c7bcb7803</originalsourceid><addsrcrecordid>eNotjMtqAjEYhQNFaLVuu-kmLzA2fy6TyVLGKwgVtGvJZDKa4mRsEml9-460Z3MufByEXoBMAIh6W5flfD6hhBQTYPQBDYnMlWCC8HyAhvddEcUZf0TjGD9JL6Y4yeEJxek1ddna1_bH-SPe2bM1yXUe7605efd1tdh5PNNJVzraiK89GfDuoo3FH1EfLS47H1PQzqd-uH8sttkydN_phLWv8ezmdesM3obuGHTb9sQzGjT6HO3430dov5jvy1W2eV-uy-kmcyBFynIKvKB9bJSitTBGVY2iFgRlfQFoDIiCCW2kqZucEqoKJbU0sjKVLAgbode_W2etPVyCa3W4HbjkAJSwX4tkWpU</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Auto-Indexing Selection Technique in Databases under Space Usage Constraint Using FP-Growth and Dynamic Programming</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Nimkanjana, K. ; Vanichayobon, S. ; Wettayaprasit, W.</creator><creatorcontrib>Nimkanjana, K. ; Vanichayobon, S. ; Wettayaprasit, W.</creatorcontrib><description>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.</description><identifier>ISBN: 0769535046</identifier><identifier>ISBN: 9780769535043</identifier><identifier>DOI: 10.1109/ICCEE.2008.132</identifier><identifier>LCCN: 2008909434</identifier><language>eng</language><publisher>IEEE</publisher><subject>auto-indexing selection ; Computer science ; Costs ; Data mining ; Dynamic programming ; Electronic mail ; FP-growth ; Indexes ; Indexing ; Itemsets ; Query processing ; Relational databases</subject><ispartof>2008 International Conference on Computer and Electrical Engineering, 2008, p.932-935</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4741120$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,778,782,787,788,2054,27908,54903</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4741120$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Nimkanjana, K.</creatorcontrib><creatorcontrib>Vanichayobon, S.</creatorcontrib><creatorcontrib>Wettayaprasit, W.</creatorcontrib><title>Auto-Indexing Selection Technique in Databases under Space Usage Constraint Using FP-Growth and Dynamic Programming</title><title>2008 International Conference on Computer and Electrical Engineering</title><addtitle>ICCEE</addtitle><description>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.</description><subject>auto-indexing selection</subject><subject>Computer science</subject><subject>Costs</subject><subject>Data mining</subject><subject>Dynamic programming</subject><subject>Electronic mail</subject><subject>FP-growth</subject><subject>Indexes</subject><subject>Indexing</subject><subject>Itemsets</subject><subject>Query processing</subject><subject>Relational databases</subject><isbn>0769535046</isbn><isbn>9780769535043</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjMtqAjEYhQNFaLVuu-kmLzA2fy6TyVLGKwgVtGvJZDKa4mRsEml9-460Z3MufByEXoBMAIh6W5flfD6hhBQTYPQBDYnMlWCC8HyAhvddEcUZf0TjGD9JL6Y4yeEJxek1ddna1_bH-SPe2bM1yXUe7605efd1tdh5PNNJVzraiK89GfDuoo3FH1EfLS47H1PQzqd-uH8sttkydN_phLWv8ezmdesM3obuGHTb9sQzGjT6HO3430dov5jvy1W2eV-uy-kmcyBFynIKvKB9bJSitTBGVY2iFgRlfQFoDIiCCW2kqZucEqoKJbU0sjKVLAgbode_W2etPVyCa3W4HbjkAJSwX4tkWpU</recordid><startdate>200812</startdate><enddate>200812</enddate><creator>Nimkanjana, K.</creator><creator>Vanichayobon, S.</creator><creator>Wettayaprasit, W.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200812</creationdate><title>Auto-Indexing Selection Technique in Databases under Space Usage Constraint Using FP-Growth and Dynamic Programming</title><author>Nimkanjana, K. ; Vanichayobon, S. ; Wettayaprasit, W.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-621482175f992d5cc9bf92e15235cc11fc15835ac7cdf62029897a7c7bcb7803</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>auto-indexing selection</topic><topic>Computer science</topic><topic>Costs</topic><topic>Data mining</topic><topic>Dynamic programming</topic><topic>Electronic mail</topic><topic>FP-growth</topic><topic>Indexes</topic><topic>Indexing</topic><topic>Itemsets</topic><topic>Query processing</topic><topic>Relational databases</topic><toplevel>online_resources</toplevel><creatorcontrib>Nimkanjana, K.</creatorcontrib><creatorcontrib>Vanichayobon, S.</creatorcontrib><creatorcontrib>Wettayaprasit, W.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Nimkanjana, K.</au><au>Vanichayobon, S.</au><au>Wettayaprasit, W.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Auto-Indexing Selection Technique in Databases under Space Usage Constraint Using FP-Growth and Dynamic Programming</atitle><btitle>2008 International Conference on Computer and Electrical Engineering</btitle><stitle>ICCEE</stitle><date>2008-12</date><risdate>2008</risdate><spage>932</spage><epage>935</epage><pages>932-935</pages><isbn>0769535046</isbn><isbn>9780769535043</isbn><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.</abstract><pub>IEEE</pub><doi>10.1109/ICCEE.2008.132</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 0769535046 |
| ispartof | 2008 International Conference on Computer and Electrical Engineering, 2008, p.932-935 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_4741120 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | auto-indexing selection Computer science Costs Data mining Dynamic programming Electronic mail FP-growth Indexes Indexing Itemsets Query processing Relational databases |
| title | Auto-Indexing Selection Technique in Databases under Space Usage Constraint Using FP-Growth and Dynamic Programming |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T20%3A02%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Auto-Indexing%20Selection%20Technique%20in%20Databases%20under%20Space%20Usage%20Constraint%20Using%20FP-Growth%20and%20Dynamic%20Programming&rft.btitle=2008%20International%20Conference%20on%20Computer%20and%20Electrical%20Engineering&rft.au=Nimkanjana,%20K.&rft.date=2008-12&rft.spage=932&rft.epage=935&rft.pages=932-935&rft.isbn=0769535046&rft.isbn_list=9780769535043&rft_id=info:doi/10.1109/ICCEE.2008.132&rft_dat=%3Cieee_6IE%3E4741120%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4741120&rfr_iscdi=true |