A new range query algorithm for Universal B-trees
In multi-dimensional databases the essential tool for accessing data is the range query (or window query). In this paper we introduce a new algorithm of processing range query in universal B-tree (UB-tree), which is an index structure for searching in multi-dimensional databases. The new range query...
Gespeichert in:
| Veröffentlicht in: | Information systems (Oxford) 2006-09, Vol.31 (6), p.489-511 |
|---|---|
| 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 | 511 |
|---|---|
| container_issue | 6 |
| container_start_page | 489 |
| container_title | Information systems (Oxford) |
| container_volume | 31 |
| creator | Skopal, Tomáš Krátký, Michal Pokorný, Jaroslav Snášel, Václav |
| description | In multi-dimensional databases the essential tool for accessing data is the range query (or window query). In this paper we introduce a new algorithm of processing range query in universal B-tree (UB-tree), which is an index structure for searching in multi-dimensional databases. The new range query algorithm (called the DRU algorithm) works efficiently, even for processing high-dimensional databases. In particular, using the DRU algorithm many of the UB-tree inner nodes need not to be accessed. We explain the DRU algorithm using a simple geometric model, providing a clear insight into the problem. More specifically, the model exploits an interesting relation between the Z-curve and generalized quad-trees. We also present experimental results for the DRU algorithm implementation. |
| doi_str_mv | 10.1016/j.is.2004.12.001 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_57656975</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0306437905000116</els_id><sourcerecordid>57656975</sourcerecordid><originalsourceid>FETCH-LOGICAL-c367t-2a0524f1726828262eee1fc72f43d4cc07b00d94e73c767cf1f2370b18b35a493</originalsourceid><addsrcrecordid>eNp1kD1PwzAURS0EEqWwM3piS3j-iJ2wlYoCUiUWOluO81xcpUmx06L-e1KVleku9zy9ewi5Z5AzYOpxk4eUcwCZM54DsAsyYaUWmQKtLskEBKhMCl1dk5uUNgDAi6qaEDajHf7QaLs10u89xiO17bqPYfjaUt9HuurCAWOyLX3OhoiYbsmVt23Cu7-cktXi5XP-li0_Xt_ns2XmhNJDxi0UXHqmuSp5yRVHROad5l6KRjoHugZoKolaOK2088xzoaFmZS0KKysxJQ_nu7vYj4-lwWxDcti2tsN-n0yhVaEqXYxFOBdd7FOK6M0uhq2NR8PAnNyYjQnJnNwYxs3oZkSezgiOAw4Bo0kuYOewCRHdYJo-_A__AkjHaag</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>57656975</pqid></control><display><type>article</type><title>A new range query algorithm for Universal B-trees</title><source>Elsevier ScienceDirect Journals</source><creator>Skopal, Tomáš ; Krátký, Michal ; Pokorný, Jaroslav ; Snášel, Václav</creator><creatorcontrib>Skopal, Tomáš ; Krátký, Michal ; Pokorný, Jaroslav ; Snášel, Václav</creatorcontrib><description>In multi-dimensional databases the essential tool for accessing data is the range query (or window query). In this paper we introduce a new algorithm of processing range query in universal B-tree (UB-tree), which is an index structure for searching in multi-dimensional databases. The new range query algorithm (called the DRU algorithm) works efficiently, even for processing high-dimensional databases. In particular, using the DRU algorithm many of the UB-tree inner nodes need not to be accessed. We explain the DRU algorithm using a simple geometric model, providing a clear insight into the problem. More specifically, the model exploits an interesting relation between the Z-curve and generalized quad-trees. We also present experimental results for the DRU algorithm implementation.</description><identifier>ISSN: 0306-4379</identifier><identifier>EISSN: 1873-6076</identifier><identifier>DOI: 10.1016/j.is.2004.12.001</identifier><language>eng</language><publisher>Elsevier Ltd</publisher><subject>Algorithms ; Computer science ; DRU algorithm ; Multi-dimensional indexing ; Multidimensional databases ; Range query ; Space filling curves ; Spatial access methods ; UB-tree ; Z-region</subject><ispartof>Information systems (Oxford), 2006-09, Vol.31 (6), p.489-511</ispartof><rights>2005 Elsevier B.V.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c367t-2a0524f1726828262eee1fc72f43d4cc07b00d94e73c767cf1f2370b18b35a493</citedby><cites>FETCH-LOGICAL-c367t-2a0524f1726828262eee1fc72f43d4cc07b00d94e73c767cf1f2370b18b35a493</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0306437905000116$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27903,27904,65309</link.rule.ids></links><search><creatorcontrib>Skopal, Tomáš</creatorcontrib><creatorcontrib>Krátký, Michal</creatorcontrib><creatorcontrib>Pokorný, Jaroslav</creatorcontrib><creatorcontrib>Snášel, Václav</creatorcontrib><title>A new range query algorithm for Universal B-trees</title><title>Information systems (Oxford)</title><description>In multi-dimensional databases the essential tool for accessing data is the range query (or window query). In this paper we introduce a new algorithm of processing range query in universal B-tree (UB-tree), which is an index structure for searching in multi-dimensional databases. The new range query algorithm (called the DRU algorithm) works efficiently, even for processing high-dimensional databases. In particular, using the DRU algorithm many of the UB-tree inner nodes need not to be accessed. We explain the DRU algorithm using a simple geometric model, providing a clear insight into the problem. More specifically, the model exploits an interesting relation between the Z-curve and generalized quad-trees. We also present experimental results for the DRU algorithm implementation.</description><subject>Algorithms</subject><subject>Computer science</subject><subject>DRU algorithm</subject><subject>Multi-dimensional indexing</subject><subject>Multidimensional databases</subject><subject>Range query</subject><subject>Space filling curves</subject><subject>Spatial access methods</subject><subject>UB-tree</subject><subject>Z-region</subject><issn>0306-4379</issn><issn>1873-6076</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><recordid>eNp1kD1PwzAURS0EEqWwM3piS3j-iJ2wlYoCUiUWOluO81xcpUmx06L-e1KVleku9zy9ewi5Z5AzYOpxk4eUcwCZM54DsAsyYaUWmQKtLskEBKhMCl1dk5uUNgDAi6qaEDajHf7QaLs10u89xiO17bqPYfjaUt9HuurCAWOyLX3OhoiYbsmVt23Cu7-cktXi5XP-li0_Xt_ns2XmhNJDxi0UXHqmuSp5yRVHROad5l6KRjoHugZoKolaOK2088xzoaFmZS0KKysxJQ_nu7vYj4-lwWxDcti2tsN-n0yhVaEqXYxFOBdd7FOK6M0uhq2NR8PAnNyYjQnJnNwYxs3oZkSezgiOAw4Bo0kuYOewCRHdYJo-_A__AkjHaag</recordid><startdate>20060901</startdate><enddate>20060901</enddate><creator>Skopal, Tomáš</creator><creator>Krátký, Michal</creator><creator>Pokorný, Jaroslav</creator><creator>Snášel, Václav</creator><general>Elsevier Ltd</general><scope>AAYXX</scope><scope>CITATION</scope><scope>E3H</scope><scope>F2A</scope></search><sort><creationdate>20060901</creationdate><title>A new range query algorithm for Universal B-trees</title><author>Skopal, Tomáš ; Krátký, Michal ; Pokorný, Jaroslav ; Snášel, Václav</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c367t-2a0524f1726828262eee1fc72f43d4cc07b00d94e73c767cf1f2370b18b35a493</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Algorithms</topic><topic>Computer science</topic><topic>DRU algorithm</topic><topic>Multi-dimensional indexing</topic><topic>Multidimensional databases</topic><topic>Range query</topic><topic>Space filling curves</topic><topic>Spatial access methods</topic><topic>UB-tree</topic><topic>Z-region</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Skopal, Tomáš</creatorcontrib><creatorcontrib>Krátký, Michal</creatorcontrib><creatorcontrib>Pokorný, Jaroslav</creatorcontrib><creatorcontrib>Snášel, Václav</creatorcontrib><collection>CrossRef</collection><collection>Library & Information Sciences Abstracts (LISA)</collection><collection>Library & Information Science Abstracts (LISA)</collection><jtitle>Information systems (Oxford)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Skopal, Tomáš</au><au>Krátký, Michal</au><au>Pokorný, Jaroslav</au><au>Snášel, Václav</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A new range query algorithm for Universal B-trees</atitle><jtitle>Information systems (Oxford)</jtitle><date>2006-09-01</date><risdate>2006</risdate><volume>31</volume><issue>6</issue><spage>489</spage><epage>511</epage><pages>489-511</pages><issn>0306-4379</issn><eissn>1873-6076</eissn><abstract>In multi-dimensional databases the essential tool for accessing data is the range query (or window query). In this paper we introduce a new algorithm of processing range query in universal B-tree (UB-tree), which is an index structure for searching in multi-dimensional databases. The new range query algorithm (called the DRU algorithm) works efficiently, even for processing high-dimensional databases. In particular, using the DRU algorithm many of the UB-tree inner nodes need not to be accessed. We explain the DRU algorithm using a simple geometric model, providing a clear insight into the problem. More specifically, the model exploits an interesting relation between the Z-curve and generalized quad-trees. We also present experimental results for the DRU algorithm implementation.</abstract><pub>Elsevier Ltd</pub><doi>10.1016/j.is.2004.12.001</doi><tpages>23</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0306-4379 |
| ispartof | Information systems (Oxford), 2006-09, Vol.31 (6), p.489-511 |
| issn | 0306-4379 1873-6076 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_57656975 |
| source | Elsevier ScienceDirect Journals |
| subjects | Algorithms Computer science DRU algorithm Multi-dimensional indexing Multidimensional databases Range query Space filling curves Spatial access methods UB-tree Z-region |
| title | A new range query algorithm for Universal B-trees |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T06%3A19%3A49IST&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=A%20new%20range%20query%20algorithm%20for%20Universal%20B-trees&rft.jtitle=Information%20systems%20(Oxford)&rft.au=Skopal,%20Tom%C3%A1%C5%A1&rft.date=2006-09-01&rft.volume=31&rft.issue=6&rft.spage=489&rft.epage=511&rft.pages=489-511&rft.issn=0306-4379&rft.eissn=1873-6076&rft_id=info:doi/10.1016/j.is.2004.12.001&rft_dat=%3Cproquest_cross%3E57656975%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=57656975&rft_id=info:pmid/&rft_els_id=S0306437905000116&rfr_iscdi=true |