English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  The LHAM Log-Structured History Data Access Method

Muth, P., O'Neil, P. E., Pick, A., & Weikum, G. (2000). The LHAM Log-Structured History Data Access Method. The VLDB Journal, 8(3-4), 199-221. Retrieved from http://portal.acm.org/ft_gateway.cfm?id=764216&type=pdf&coll=portal&dl=ACM&CFID=68309836&CFTOKEN=24564657.

Item is

Files

show Files
hide Files
:
MuthOPW00.pdf (Any fulltext), 484KB
 
File Permalink:
-
Name:
MuthOPW00.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Muth, Peter, Author
O'Neil, Patrick E., Author
Pick, Achim, Author
Weikum, Gerhard1, Author           
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2006-03-282000
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 520335
URI: http://portal.acm.org/ft_gateway.cfm?id=764216&type=pdf&coll=portal&dl=ACM&CFID=68309836&CFTOKEN=24564657
Other: Local-ID: C1256DBF005F876D-14008BBD691C7183C125713F00489B29-MuthOPW00
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: The VLDB Journal
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 8 (3-4) Sequence Number: - Start / End Page: 199 - 221 Identifier: ISSN: 1066-8888