Logo des Repositoriums
 

Partitioned B-trees – a user's guide

Kurzanzeige
dc.contributor.authorGraefe, Goetz
dc.contributor.editorWeikum, Gerhard
dc.contributor.editorSchöning, Harald
dc.contributor.editorRahm, Erhard
dc.date.accessioned2019-11-14T12:34:31Z
dc.date.available2019-11-14T12:34:31Z
dc.date.issued2003
dc.description.abstractA recent article introduced partitioned B-trees, in which partitions are defined not in the catalogs but by distinct values in an artificial leading key column. As there usually is only a single value in this column, there usually is only a single partition, and queries and updates perform just like in traditional B-tree indexes. By temporarily permitting multiple values, at the expense of reduced query performance, interesting database usage scenarios become possible, in particular for bulk insert (database load). The present paper guides database administrators to exploiting partitioned B-trees even if they are not implemented by their DBMS vendor.en
dc.identifier.isbn3-88579-355-5
dc.identifier.pissn1617-5468
dc.identifier.urihttps://dl.gi.de/handle/20.500.12116/30089
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofBTW 2003 – Datenbanksysteme für Business, Technologie und Web, Tagungsband der 10. BTW Konferenz
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-26
dc.titlePartitioned B-trees – a user's guideen
dc.typeText/Conference Paper
gi.citation.endPage671
gi.citation.publisherPlaceBonn
gi.citation.startPage668
gi.conference.date26.-28. Februar 2003
gi.conference.locationLeipzig
gi.conference.sessiontitleRegular Research Papers

Dateien

Originalbündel
1 - 1 von 1
Vorschaubild
Name:
GI-Proceedings.26-47.pdf
Größe:
34.4 KB
Format:
Adobe Portable Document Format
Herunterladen

Sammlungen

P026 - BTW 2003 – Datenbanksysteme für Business, Technologie und Web