Array based HV/VH tree： an effective data structure for layout representation
We present a new data structure for the representation of an integrated circuit layout. It is a modified HV/VH tree using arrays as the primary container in bisector lists and leaf nodes. By grouping and sorting objects within these arrays together with a customized binary search algorithm, our new...
Gespeichert in:
| Veröffentlicht in: | Frontiers of information technology & electronic engineering 2012-03, Vol.13 (3), p.232-237 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 237 |
|---|---|
| container_issue | 3 |
| container_start_page | 232 |
| container_title | Frontiers of information technology & electronic engineering |
| container_volume | 13 |
| creator | Ren, Jie Pan, Wei-wei Zheng, Yong-jun Shi, Zheng Yan, Xiao-lang |
| description | We present a new data structure for the representation of an integrated circuit layout. It is a modified HV/VH tree using arrays as the primary container in bisector lists and leaf nodes. By grouping and sorting objects within these arrays together with a customized binary search algorithm, our new data structure provides excellent performance in both memory usage and region query speed. Experimental results show that in comparison with the original HV/VH tree, which has been regarded as the best layout data structure to date, the new data structure uses much less memory and can become 30% faster on region query. |
| doi_str_mv | 10.1631/jzus.C1100193 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1323231354</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>41132337</cqvip_id><sourcerecordid>1323231354</sourcerecordid><originalsourceid>FETCH-LOGICAL-c363t-6df1fd17efb40d9ea4af5d3d0052281c1848d12f9dba457efb44bb7cabd71fcf3</originalsourceid><addsrcrecordid>eNp1kMFKw0AQhoMoWGqP3le8eEm7k002ybEUtUKhFy3ewmZ3tqa0Sbu7Eeqj-Cy-k6_g1tYKgjOHmcP3_zP8QXAJtA-cwWDx1tr-CIBSyNlJ0IGM5yHk_Pn0uCdwHvSsXVBfLElyzjrBdGiM2JJSWFRkPBvMxsQZxM-PdyJqglqjdNUrEiWcINaZVrrWINGNIUuxbVpHDK4NWqydcFVTXwRnWiwt9g6zGzzd3T6OxuFkev8wGk5CyThzIVcatIIUdRlTlaOIhU4UU5QmUZSBhCzOFEQ6V6WIk28sLstUilKloKVm3eBm77s2zaZF64pVZSUul6LGprUFsMg3sCT26PUfdNG0pvbfFVEOWRoxzqmnwj0lTWOtQV2sTbUSZlsALXYJF7uEi5-EPd_f89Zz9RzNr-t_gqvDgZemnm-85nghht27LGVfhJGLJw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918723660</pqid></control><display><type>article</type><title>Array based HV/VH tree： an effective data structure for layout representation</title><source>SpringerLink Journals</source><source>ProQuest Central UK/Ireland</source><source>Alma/SFX Local Collection</source><source>ProQuest Central</source><creator>Ren, Jie ; Pan, Wei-wei ; Zheng, Yong-jun ; Shi, Zheng ; Yan, Xiao-lang</creator><creatorcontrib>Ren, Jie ; Pan, Wei-wei ; Zheng, Yong-jun ; Shi, Zheng ; Yan, Xiao-lang</creatorcontrib><description>We present a new data structure for the representation of an integrated circuit layout. It is a modified HV/VH tree using arrays as the primary container in bisector lists and leaf nodes. By grouping and sorting objects within these arrays together with a customized binary search algorithm, our new data structure provides excellent performance in both memory usage and region query speed. Experimental results show that in comparison with the original HV/VH tree, which has been regarded as the best layout data structure to date, the new data structure uses much less memory and can become 30% faster on region query.</description><identifier>ISSN: 1869-1951</identifier><identifier>ISSN: 2095-9184</identifier><identifier>EISSN: 1869-196X</identifier><identifier>EISSN: 2095-9230</identifier><identifier>DOI: 10.1631/jzus.C1100193</identifier><language>eng</language><publisher>Heidelberg: SP Zhejiang University Press</publisher><subject>Arrays ; Communications Engineering ; Computer Hardware ; Computer Science ; Computer Systems Organization and Communication Networks ; Customizing ; Data structures ; Electrical Engineering ; Electronics and Microelectronics ; Instrumentation ; Integrated circuits ; Layouts ; Lists ; Networks ; Query processing ; Representations ; Search algorithms ; Sorting algorithms ; Trees</subject><ispartof>Frontiers of information technology & electronic engineering, 2012-03, Vol.13 (3), p.232-237</ispartof><rights>Journal of Zhejiang University Science Editorial Office and Springer-Verlag Berlin Heidelberg 2012</rights><rights>Journal of Zhejiang University Science Editorial Office and Springer-Verlag Berlin Heidelberg 2012.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c363t-6df1fd17efb40d9ea4af5d3d0052281c1848d12f9dba457efb44bb7cabd71fcf3</citedby><cites>FETCH-LOGICAL-c363t-6df1fd17efb40d9ea4af5d3d0052281c1848d12f9dba457efb44bb7cabd71fcf3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/89589X/89589X.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1631/jzus.C1100193$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2918723660?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,777,781,21369,27905,27906,33725,41469,42538,43786,51300,64364,64368,72218</link.rule.ids></links><search><creatorcontrib>Ren, Jie</creatorcontrib><creatorcontrib>Pan, Wei-wei</creatorcontrib><creatorcontrib>Zheng, Yong-jun</creatorcontrib><creatorcontrib>Shi, Zheng</creatorcontrib><creatorcontrib>Yan, Xiao-lang</creatorcontrib><title>Array based HV/VH tree： an effective data structure for layout representation</title><title>Frontiers of information technology & electronic engineering</title><addtitle>J. Zhejiang Univ. - Sci. C</addtitle><addtitle>Journal of zhejiang university science</addtitle><description>We present a new data structure for the representation of an integrated circuit layout. It is a modified HV/VH tree using arrays as the primary container in bisector lists and leaf nodes. By grouping and sorting objects within these arrays together with a customized binary search algorithm, our new data structure provides excellent performance in both memory usage and region query speed. Experimental results show that in comparison with the original HV/VH tree, which has been regarded as the best layout data structure to date, the new data structure uses much less memory and can become 30% faster on region query.</description><subject>Arrays</subject><subject>Communications Engineering</subject><subject>Computer Hardware</subject><subject>Computer Science</subject><subject>Computer Systems Organization and Communication Networks</subject><subject>Customizing</subject><subject>Data structures</subject><subject>Electrical Engineering</subject><subject>Electronics and Microelectronics</subject><subject>Instrumentation</subject><subject>Integrated circuits</subject><subject>Layouts</subject><subject>Lists</subject><subject>Networks</subject><subject>Query processing</subject><subject>Representations</subject><subject>Search algorithms</subject><subject>Sorting algorithms</subject><subject>Trees</subject><issn>1869-1951</issn><issn>2095-9184</issn><issn>1869-196X</issn><issn>2095-9230</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kMFKw0AQhoMoWGqP3le8eEm7k002ybEUtUKhFy3ewmZ3tqa0Sbu7Eeqj-Cy-k6_g1tYKgjOHmcP3_zP8QXAJtA-cwWDx1tr-CIBSyNlJ0IGM5yHk_Pn0uCdwHvSsXVBfLElyzjrBdGiM2JJSWFRkPBvMxsQZxM-PdyJqglqjdNUrEiWcINaZVrrWINGNIUuxbVpHDK4NWqydcFVTXwRnWiwt9g6zGzzd3T6OxuFkev8wGk5CyThzIVcatIIUdRlTlaOIhU4UU5QmUZSBhCzOFEQ6V6WIk28sLstUilKloKVm3eBm77s2zaZF64pVZSUul6LGprUFsMg3sCT26PUfdNG0pvbfFVEOWRoxzqmnwj0lTWOtQV2sTbUSZlsALXYJF7uEi5-EPd_f89Zz9RzNr-t_gqvDgZemnm-85nghht27LGVfhJGLJw</recordid><startdate>20120301</startdate><enddate>20120301</enddate><creator>Ren, Jie</creator><creator>Pan, Wei-wei</creator><creator>Zheng, Yong-jun</creator><creator>Shi, Zheng</creator><creator>Yan, Xiao-lang</creator><general>SP Zhejiang University Press</general><general>Springer Nature B.V</general><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>~WA</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L6V</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>7SC</scope><scope>8FD</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20120301</creationdate><title>Array based HV/VH tree： an effective data structure for layout representation</title><author>Ren, Jie ; Pan, Wei-wei ; Zheng, Yong-jun ; Shi, Zheng ; Yan, Xiao-lang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c363t-6df1fd17efb40d9ea4af5d3d0052281c1848d12f9dba457efb44bb7cabd71fcf3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Arrays</topic><topic>Communications Engineering</topic><topic>Computer Hardware</topic><topic>Computer Science</topic><topic>Computer Systems Organization and Communication Networks</topic><topic>Customizing</topic><topic>Data structures</topic><topic>Electrical Engineering</topic><topic>Electronics and Microelectronics</topic><topic>Instrumentation</topic><topic>Integrated circuits</topic><topic>Layouts</topic><topic>Lists</topic><topic>Networks</topic><topic>Query processing</topic><topic>Representations</topic><topic>Search algorithms</topic><topic>Sorting algorithms</topic><topic>Trees</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ren, Jie</creatorcontrib><creatorcontrib>Pan, Wei-wei</creatorcontrib><creatorcontrib>Zheng, Yong-jun</creatorcontrib><creatorcontrib>Shi, Zheng</creatorcontrib><creatorcontrib>Yan, Xiao-lang</creatorcontrib><collection>中文科技期刊数据库</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>中文科技期刊数据库-7.0平台</collection><collection>中文科技期刊数据库- 镜像站点</collection><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Frontiers of information technology & electronic engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ren, Jie</au><au>Pan, Wei-wei</au><au>Zheng, Yong-jun</au><au>Shi, Zheng</au><au>Yan, Xiao-lang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Array based HV/VH tree： an effective data structure for layout representation</atitle><jtitle>Frontiers of information technology & electronic engineering</jtitle><stitle>J. Zhejiang Univ. - Sci. C</stitle><addtitle>Journal of zhejiang university science</addtitle><date>2012-03-01</date><risdate>2012</risdate><volume>13</volume><issue>3</issue><spage>232</spage><epage>237</epage><pages>232-237</pages><issn>1869-1951</issn><issn>2095-9184</issn><eissn>1869-196X</eissn><eissn>2095-9230</eissn><abstract>We present a new data structure for the representation of an integrated circuit layout. It is a modified HV/VH tree using arrays as the primary container in bisector lists and leaf nodes. By grouping and sorting objects within these arrays together with a customized binary search algorithm, our new data structure provides excellent performance in both memory usage and region query speed. Experimental results show that in comparison with the original HV/VH tree, which has been regarded as the best layout data structure to date, the new data structure uses much less memory and can become 30% faster on region query.</abstract><cop>Heidelberg</cop><pub>SP Zhejiang University Press</pub><doi>10.1631/jzus.C1100193</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1869-1951 |
| ispartof | Frontiers of information technology & electronic engineering, 2012-03, Vol.13 (3), p.232-237 |
| issn | 1869-1951 2095-9184 1869-196X 2095-9230 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1323231354 |
| source | SpringerLink Journals; ProQuest Central UK/Ireland; Alma/SFX Local Collection; ProQuest Central |
| subjects | Arrays Communications Engineering Computer Hardware Computer Science Computer Systems Organization and Communication Networks Customizing Data structures Electrical Engineering Electronics and Microelectronics Instrumentation Integrated circuits Layouts Lists Networks Query processing Representations Search algorithms Sorting algorithms Trees |
| title | Array based HV/VH tree： an effective data structure for layout representation |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T11%3A37%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Array%20based%20HV/VH%20tree%EF%BC%9A%20an%20effective%20data%20structure%20for%20layout%20representation&rft.jtitle=Frontiers%20of%20information%20technology%20&%20electronic%20engineering&rft.au=Ren,%20Jie&rft.date=2012-03-01&rft.volume=13&rft.issue=3&rft.spage=232&rft.epage=237&rft.pages=232-237&rft.issn=1869-1951&rft.eissn=1869-196X&rft_id=info:doi/10.1631/jzus.C1100193&rft_dat=%3Cproquest_cross%3E1323231354%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2918723660&rft_id=info:pmid/&rft_cqvip_id=41132337&rfr_iscdi=true |