A performance evaluation of OID mapping techniques:
Abstract: "In this paper, three techniques to implement logical OIDs are thoroughly evaluated: hashing, B-trees and a technique called direct mapping. Among these three techniques, direct mapping is the most robust; it induces at most one page fault to map an OID, and it scales very well to lar...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Passau
1995
|
| Schriftenreihe: | Universität <Passau> / Fakultät für Mathematik und Informatik: MIP
1995,07 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In this paper, three techniques to implement logical OIDs are thoroughly evaluated: hashing, B-trees and a technique called direct mapping. Among these three techniques, direct mapping is the most robust; it induces at most one page fault to map an OID, and it scales very well to large, rapidly growing databases. Furthermore, the clustering of handles that are used to map logical OIDs is studied. In particular, the performance of B-trees and direct mapping can improve significantly if the handles of objects that are frequently accessed by the same methods are clustered. For direct mapping, two placement policies are compared: linear and matrix clustering." |
| Beschreibung: | 21 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010133070 | ||
| 003 | DE-604 | ||
| 005 | 20220128 | ||
| 007 | t| | ||
| 008 | 950410s1995 xx d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)35571482 | ||
| 035 | |a (DE-599)BVBBV010133070 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-154 |a DE-739 |a DE-12 |a DE-384 |a DE-29T |a DE-91G |a DE-634 | ||
| 100 | 1 | |a Eickler, André |e Verfasser |0 (DE-588)113854692 |4 aut | |
| 245 | 1 | 0 | |a A performance evaluation of OID mapping techniques |c André Eickler ; Carsten A. Gerlhof ; Donald Kossmann |
| 264 | 1 | |a Passau |c 1995 | |
| 300 | |a 21 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Universität <Passau> / Fakultät für Mathematik und Informatik: MIP |v 1995,07 | |
| 520 | 3 | |a Abstract: "In this paper, three techniques to implement logical OIDs are thoroughly evaluated: hashing, B-trees and a technique called direct mapping. Among these three techniques, direct mapping is the most robust; it induces at most one page fault to map an OID, and it scales very well to large, rapidly growing databases. Furthermore, the clustering of handles that are used to map logical OIDs is studied. In particular, the performance of B-trees and direct mapping can improve significantly if the handles of objects that are frequently accessed by the same methods are clustered. For direct mapping, two placement policies are compared: linear and matrix clustering." | |
| 650 | 4 | |a File organization | |
| 650 | 4 | |a Object-oriented databases | |
| 650 | 4 | |a Object-oriented methods (Computer science) | |
| 650 | 4 | |a Object-oriented programming (Computer science) | |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematik |0 (DE-588)4037944-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | 1 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | 2 | |a Mathematik |0 (DE-588)4037944-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Gerlhof, Carsten |e Sonstige |0 (DE-588)1158279515 |4 oth | |
| 700 | 1 | |a Kossmann, Donald |d 1968- |e Sonstige |0 (DE-588)1071826786 |4 oth | |
| 810 | 2 | |a Fakultät für Mathematik und Informatik: MIP |t Universität <Passau> |v 1995,07 |w (DE-604)BV000905393 |9 1995,07 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006730211 | |
Datensatz im Suchindex
| _version_ | 1820882317018660864 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Eickler, André |
| author_GND | (DE-588)113854692 (DE-588)1158279515 (DE-588)1071826786 |
| author_facet | Eickler, André |
| author_role | aut |
| author_sort | Eickler, André |
| author_variant | a e ae |
| building | Verbundindex |
| bvnumber | BV010133070 |
| classification_rvk | SS 5600 |
| ctrlnum | (OCoLC)35571482 (DE-599)BVBBV010133070 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV010133070</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220128</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">950410s1995 xx d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35571482</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010133070</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-154</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Eickler, André</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)113854692</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A performance evaluation of OID mapping techniques</subfield><subfield code="c">André Eickler ; Carsten A. Gerlhof ; Donald Kossmann</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Passau</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">21 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">Universität <Passau> / Fakultät für Mathematik und Informatik: MIP</subfield><subfield code="v">1995,07</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper, three techniques to implement logical OIDs are thoroughly evaluated: hashing, B-trees and a technique called direct mapping. Among these three techniques, direct mapping is the most robust; it induces at most one page fault to map an OID, and it scales very well to large, rapidly growing databases. Furthermore, the clustering of handles that are used to map logical OIDs is studied. In particular, the performance of B-trees and direct mapping can improve significantly if the handles of objects that are frequently accessed by the same methods are clustered. For direct mapping, two placement policies are compared: linear and matrix clustering."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">File organization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Object-oriented databases</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Object-oriented methods (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Object-oriented programming (Computer science)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gerlhof, Carsten</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1158279515</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kossmann, Donald</subfield><subfield code="d">1968-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1071826786</subfield><subfield code="4">oth</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fakultät für Mathematik und Informatik: MIP</subfield><subfield code="t">Universität <Passau></subfield><subfield code="v">1995,07</subfield><subfield code="w">(DE-604)BV000905393</subfield><subfield code="9">1995,07</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006730211</subfield></datafield></record></collection> |
| id | DE-604.BV010133070 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T17:04:58Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006730211 |
| oclc_num | 35571482 |
| open_access_boolean | |
| owner | DE-154 DE-739 DE-12 DE-384 DE-29T DE-91G DE-BY-TUM DE-634 |
| owner_facet | DE-154 DE-739 DE-12 DE-384 DE-29T DE-91G DE-BY-TUM DE-634 |
| physical | 21 S. graph. Darst. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | Universität <Passau> / Fakultät für Mathematik und Informatik: MIP |
| spelling | Eickler, André Verfasser (DE-588)113854692 aut A performance evaluation of OID mapping techniques André Eickler ; Carsten A. Gerlhof ; Donald Kossmann Passau 1995 21 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Universität <Passau> / Fakultät für Mathematik und Informatik: MIP 1995,07 Abstract: "In this paper, three techniques to implement logical OIDs are thoroughly evaluated: hashing, B-trees and a technique called direct mapping. Among these three techniques, direct mapping is the most robust; it induces at most one page fault to map an OID, and it scales very well to large, rapidly growing databases. Furthermore, the clustering of handles that are used to map logical OIDs is studied. In particular, the performance of B-trees and direct mapping can improve significantly if the handles of objects that are frequently accessed by the same methods are clustered. For direct mapping, two placement policies are compared: linear and matrix clustering." File organization Object-oriented databases Object-oriented methods (Computer science) Object-oriented programming (Computer science) Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Mathematik (DE-588)4037944-9 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 s Informatik (DE-588)4026894-9 s Mathematik (DE-588)4037944-9 s DE-604 Gerlhof, Carsten Sonstige (DE-588)1158279515 oth Kossmann, Donald 1968- Sonstige (DE-588)1071826786 oth Fakultät für Mathematik und Informatik: MIP Universität <Passau> 1995,07 (DE-604)BV000905393 1995,07 |
| spellingShingle | Eickler, André A performance evaluation of OID mapping techniques File organization Object-oriented databases Object-oriented methods (Computer science) Object-oriented programming (Computer science) Theoretische Informatik (DE-588)4196735-5 gnd Informatik (DE-588)4026894-9 gnd Mathematik (DE-588)4037944-9 gnd |
| subject_GND | (DE-588)4196735-5 (DE-588)4026894-9 (DE-588)4037944-9 |
| title | A performance evaluation of OID mapping techniques |
| title_auth | A performance evaluation of OID mapping techniques |
| title_exact_search | A performance evaluation of OID mapping techniques |
| title_full | A performance evaluation of OID mapping techniques André Eickler ; Carsten A. Gerlhof ; Donald Kossmann |
| title_fullStr | A performance evaluation of OID mapping techniques André Eickler ; Carsten A. Gerlhof ; Donald Kossmann |
| title_full_unstemmed | A performance evaluation of OID mapping techniques André Eickler ; Carsten A. Gerlhof ; Donald Kossmann |
| title_short | A performance evaluation of OID mapping techniques |
| title_sort | a performance evaluation of oid mapping techniques |
| topic | File organization Object-oriented databases Object-oriented methods (Computer science) Object-oriented programming (Computer science) Theoretische Informatik (DE-588)4196735-5 gnd Informatik (DE-588)4026894-9 gnd Mathematik (DE-588)4037944-9 gnd |
| topic_facet | File organization Object-oriented databases Object-oriented methods (Computer science) Object-oriented programming (Computer science) Theoretische Informatik Informatik Mathematik |
| volume_link | (DE-604)BV000905393 |
| work_keys_str_mv | AT eicklerandre aperformanceevaluationofoidmappingtechniques AT gerlhofcarsten aperformanceevaluationofoidmappingtechniques AT kossmanndonald aperformanceevaluationofoidmappingtechniques |