The universal B-tree for multidimensional indexing:
Abstract: "Today almost all database systems use B-trees as their main access method. One of the main drawbacks of the classical B-tree is, however, that it works well only for one-dimensional data. In this paper we present a new access structure, called UB-tree (for universal B-tree) for multi...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
München
1996
|
| Schriftenreihe: | Technische Universität <München>: TUM-I
9637 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Today almost all database systems use B-trees as their main access method. One of the main drawbacks of the classical B-tree is, however, that it works well only for one-dimensional data. In this paper we present a new access structure, called UB-tree (for universal B-tree) for multidimensional data. The UB-tree is balanced and has all the guaranteed performance characteristics of B-trees, i.e. it requires linear space for storage and logarithmic time for the basic operations of INSERT FIND DELETE. In addition the UB-tree has the fundamental property, that it preserves clustering of objects w.r. to Cartesian distance. Therefore, the UB-tree shows its main strengths for multidimensional data. It has very high potential for parallel processing. With the new method, a single UB- tree can replace an arbitrary number of secondary indexes. For updates this means that only one UB-tree must be managed instead of several secondary indexes. This reduces runtime and storage requirements substantially. For queries and in particular range queries the UB-tree has muliplicative complexity instead of the additive complexity of multiple secondary indexes. This results in dramatic performance improvements over secondary indexes. The UB-tree is obviously useful for geometric databases, datawarehousing and datamining applications, but even more for databases in general, where multiple secondary indexes are widespread, which can all be replaced by a single UB-tree index." |
| Beschreibung: | 14 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011712912 | ||
| 003 | DE-604 | ||
| 005 | 20040416 | ||
| 007 | t | ||
| 008 | 971222s1996 gw d||| t||| 00||| ger d | ||
| 016 | 7 | |a 952261219 |2 DE-101 | |
| 035 | |a (OCoLC)38894102 | ||
| 035 | |a (DE-599)BVBBV011712912 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-12 | ||
| 088 | |a TUM I 9637 | ||
| 100 | 1 | |a Bayer, Rudolf |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The universal B-tree for multidimensional indexing |c Rudolf Bayer |
| 264 | 1 | |a München |c 1996 | |
| 300 | |a 14 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Technische Universität <München>: TUM-I |v 9637 | |
| 520 | 3 | |a Abstract: "Today almost all database systems use B-trees as their main access method. One of the main drawbacks of the classical B-tree is, however, that it works well only for one-dimensional data. In this paper we present a new access structure, called UB-tree (for universal B-tree) for multidimensional data. The UB-tree is balanced and has all the guaranteed performance characteristics of B-trees, i.e. it requires linear space for storage and logarithmic time for the basic operations of INSERT FIND DELETE. In addition the UB-tree has the fundamental property, that it preserves clustering of objects w.r. to Cartesian distance. Therefore, the UB-tree shows its main strengths for multidimensional data. It has very high potential for parallel processing. With the new method, a single UB- tree can replace an arbitrary number of secondary indexes. For updates this means that only one UB-tree must be managed instead of several secondary indexes. This reduces runtime and storage requirements substantially. For queries and in particular range queries the UB-tree has muliplicative complexity instead of the additive complexity of multiple secondary indexes. This results in dramatic performance improvements over secondary indexes. The UB-tree is obviously useful for geometric databases, datawarehousing and datamining applications, but even more for databases in general, where multiple secondary indexes are widespread, which can all be replaced by a single UB-tree index." | |
| 650 | 4 | |a Automatic indexing | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Object-oriented programming (Computer science) | |
| 650 | 4 | |a Trees (Graph theory) | |
| 830 | 0 | |a Technische Universität <München>: TUM-I |v 9637 |w (DE-604)BV006185376 |9 9637 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007898606 | ||
Datensatz im Suchindex
| _version_ | 1804126250492493824 |
|---|---|
| any_adam_object | |
| author | Bayer, Rudolf |
| author_facet | Bayer, Rudolf |
| author_role | aut |
| author_sort | Bayer, Rudolf |
| author_variant | r b rb |
| building | Verbundindex |
| bvnumber | BV011712912 |
| ctrlnum | (OCoLC)38894102 (DE-599)BVBBV011712912 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02584nam a2200361 cb4500</leader><controlfield tag="001">BV011712912</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040416 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">971222s1996 gw d||| t||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">952261219</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38894102</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011712912</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">TUM I 9637</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bayer, Rudolf</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The universal B-tree for multidimensional indexing</subfield><subfield code="c">Rudolf Bayer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9637</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Today almost all database systems use B-trees as their main access method. One of the main drawbacks of the classical B-tree is, however, that it works well only for one-dimensional data. In this paper we present a new access structure, called UB-tree (for universal B-tree) for multidimensional data. The UB-tree is balanced and has all the guaranteed performance characteristics of B-trees, i.e. it requires linear space for storage and logarithmic time for the basic operations of INSERT FIND DELETE. In addition the UB-tree has the fundamental property, that it preserves clustering of objects w.r. to Cartesian distance. Therefore, the UB-tree shows its main strengths for multidimensional data. It has very high potential for parallel processing. With the new method, a single UB- tree can replace an arbitrary number of secondary indexes. For updates this means that only one UB-tree must be managed instead of several secondary indexes. This reduces runtime and storage requirements substantially. For queries and in particular range queries the UB-tree has muliplicative complexity instead of the additive complexity of multiple secondary indexes. This results in dramatic performance improvements over secondary indexes. The UB-tree is obviously useful for geometric databases, datawarehousing and datamining applications, but even more for databases in general, where multiple secondary indexes are widespread, which can all be replaced by a single UB-tree index."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic indexing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Object-oriented programming (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees (Graph theory)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9637</subfield><subfield code="w">(DE-604)BV006185376</subfield><subfield code="9">9637</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007898606</subfield></datafield></record></collection> |
| id | DE-604.BV011712912 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:14:28Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007898606 |
| oclc_num | 38894102 |
| open_access_boolean | |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | 14 S. graph. Darst. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| record_format | marc |
| series | Technische Universität <München>: TUM-I |
| series2 | Technische Universität <München>: TUM-I |
| spelling | Bayer, Rudolf Verfasser aut The universal B-tree for multidimensional indexing Rudolf Bayer München 1996 14 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Technische Universität <München>: TUM-I 9637 Abstract: "Today almost all database systems use B-trees as their main access method. One of the main drawbacks of the classical B-tree is, however, that it works well only for one-dimensional data. In this paper we present a new access structure, called UB-tree (for universal B-tree) for multidimensional data. The UB-tree is balanced and has all the guaranteed performance characteristics of B-trees, i.e. it requires linear space for storage and logarithmic time for the basic operations of INSERT FIND DELETE. In addition the UB-tree has the fundamental property, that it preserves clustering of objects w.r. to Cartesian distance. Therefore, the UB-tree shows its main strengths for multidimensional data. It has very high potential for parallel processing. With the new method, a single UB- tree can replace an arbitrary number of secondary indexes. For updates this means that only one UB-tree must be managed instead of several secondary indexes. This reduces runtime and storage requirements substantially. For queries and in particular range queries the UB-tree has muliplicative complexity instead of the additive complexity of multiple secondary indexes. This results in dramatic performance improvements over secondary indexes. The UB-tree is obviously useful for geometric databases, datawarehousing and datamining applications, but even more for databases in general, where multiple secondary indexes are widespread, which can all be replaced by a single UB-tree index." Automatic indexing Data structures (Computer science) Object-oriented programming (Computer science) Trees (Graph theory) Technische Universität <München>: TUM-I 9637 (DE-604)BV006185376 9637 |
| spellingShingle | Bayer, Rudolf The universal B-tree for multidimensional indexing Technische Universität <München>: TUM-I Automatic indexing Data structures (Computer science) Object-oriented programming (Computer science) Trees (Graph theory) |
| title | The universal B-tree for multidimensional indexing |
| title_auth | The universal B-tree for multidimensional indexing |
| title_exact_search | The universal B-tree for multidimensional indexing |
| title_full | The universal B-tree for multidimensional indexing Rudolf Bayer |
| title_fullStr | The universal B-tree for multidimensional indexing Rudolf Bayer |
| title_full_unstemmed | The universal B-tree for multidimensional indexing Rudolf Bayer |
| title_short | The universal B-tree for multidimensional indexing |
| title_sort | the universal b tree for multidimensional indexing |
| topic | Automatic indexing Data structures (Computer science) Object-oriented programming (Computer science) Trees (Graph theory) |
| topic_facet | Automatic indexing Data structures (Computer science) Object-oriented programming (Computer science) Trees (Graph theory) |
| volume_link | (DE-604)BV006185376 |
| work_keys_str_mv | AT bayerrudolf theuniversalbtreeformultidimensionalindexing |