Journal Article
@Article
Artikel in Fachzeitschrift


Show entries of:

this year (2020) | last year (2019) | two years ago (2018) | Notes URL

Action:

login to update

Options:








Author, Editor(s)

Author(s):

Muth, Peter
O'Neil, Patrick E.
Pick, Achim
Weikum, Gerhard

dblp
dblp
dblp
dblp

Not MPG Author(s):

Muth, Peter
O'Neil, Patrick E.
Pick, Achim

BibTeX cite key*:

MuthOPW00

Title

Title*:

The LHAM Log-Structured History Data Access Method


MuthOPW00.pdf (483.16 KB)

Journal

Journal Title*:

The VLDB Journal

Journal's URL:

http://portal.acm.org/toc.cfm?id=764212&coll=portal&dl=ACM&type=issue&idx=J869&part=periodical&WantType=periodical&title=The%20VLDB%20Journal%20%26mdash%3B%20The%20International%20Journal%20on%20Very%20Large%20Data%20Bases&CFID=68309836&CFTOKEN=24564657

Download URL
for the article:

http://portal.acm.org/ft_gateway.cfm?id=764216&type=pdf&coll=portal&dl=ACM&CFID=68309836&CFTOKEN=24564657

Language:

English

Publisher

Publisher's
Name:

Springer

Publisher's URL:


Publisher's
Address:

Berlin, Germany

ISSN:

1066-8888

Vol, No, pp, Date

Volume*:

8

Number:

3-4

Publishing Date:

February 2000

Pages*:

199-221

Number of
VG Pages:


Page Start:


Page End:


Sequence Number:


DOI:


Note, Abstract, ©

Note:


(LaTeX) Abstract:

Numerous applications such as stock market or medical information systems require that both historical and current data be logically integrated into a temporal database. The underlying access method must support different forms of “time-travel” queries, the migration of old record versions onto inexpensive archive media, and high insertion and update rates. This paper presents an access method for transaction-time temporal data, called the log-structured history data access method (LHAM) that meets these demands. The basic principle of LHAM is to partition the data into successive components based on the timestamps of the record versions. Components are assigned to different levels of a storage hierarchy, and incoming data is continuously migrated through the hierarchy. The paper discusses the LHAM concepts, including concurrency control and recovery, our full-fledged LHAM implementation, and experimental performance results based on this implementation. A detailed comparison with the TSB-tree, both analytically and based on experiments with real implementations, shows that LHAM is highly superior in terms of insert performance, while query performance is in almost all cases at least as good as for the TSB-tree; in many cases it is much better.

URL for the Abstract:


Categories,
Keywords:

Data warehouses, Index structures, Performance, Storage systems, Temporal databases

HyperLinks / References / URLs:


Copyright Message:


Personal Comments:


Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Databases and Information Systems Group

Audience:

Expert

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort


BibTeX Entry:

@ARTICLE{MuthOPW00,
AUTHOR = {Muth, Peter and O'Neil, Patrick E. and Pick, Achim and Weikum, Gerhard},
TITLE = {The {LHAM} Log-Structured History Data Access Method},
JOURNAL = {The VLDB Journal},
PUBLISHER = {Springer},
YEAR = {2000},
NUMBER = {3-4},
VOLUME = {8},
PAGES = {199--221},
ADDRESS = {Berlin, Germany},
MONTH = {February},
ISBN = {1066-8888},
}


Entry last modified by Adriana Davidescu, 03/28/2006
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Adriana Davidescu
Created
03/28/2006 03:13:03 PM
Revision
0.



Editor
Adriana Davidescu



Edit Date
28.03.2006 15:35:02



Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section
MuthOPW00.pdf
View attachments here: