Incremental Organization for Data Recording and Warehousing.
H. V. Jagadish, P. P. S. Narayan, S. Seshadri, S. Sudarshan, Rama Kanneganti:
Incremental Organization for Data Recording and Warehousing.
VLDB 1997: 16-25@inproceedings{DBLP:conf/vldb/JagadishNSSK97,
author = {H. V. Jagadish and
P. P. S. Narayan and
S. Seshadri and
S. Sudarshan and
Rama Kanneganti},
editor = {Matthias Jarke and
Michael J. Carey and
Klaus R. Dittrich and
Frederick H. Lochovsky and
Pericles Loucopoulos and
Manfred A. Jeusfeld},
title = {Incremental Organization for Data Recording and Warehousing},
booktitle = {VLDB'97, Proceedings of 23rd International Conference on Very
Large Data Bases, August 25-29, 1997, Athens, Greece},
publisher = {Morgan Kaufmann},
year = {1997},
isbn = {1-55860-470-7},
pages = {16-25},
ee = {db/conf/vldb/JagadishNSSK97.html},
crossref = {DBLP:conf/vldb/97},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
Data warehouses and recording systems typically have a large continuous
stream of incoming data, that must be stored in a manner suitable for future access.
Access to stored records is usually based on a key.
Organizing the data on disk as the data arrives
using standard techniques would result in
either (a) one or more I/Os to store each incoming record (to keep the
data clustered by the key), which is too expensive when data arrival rates
are very high, or (b) many I/Os to locate records
for a particular customer (if data is stored clustered by arrival order).
We study two techniques, inspired by external sorting algorithms,
to store data incrementally as it arrives,
simultaneously providing good performance for recording
and querying.
We present concurrency control and recovery schemes for both techniques.
We show the benefits of our techniques both analytically and
experimentally.
Copyright © 1997 by the VLDB Endowment.
Permission to copy without fee all or part of this material is granted provided that the copies are not made or
distributed for direct commercial advantage, the VLDB
copyright notice and the title of the publication and
its date appear, and notice is given that copying
is by the permission of the Very Large Data Base
Endowment. To copy otherwise, or to republish, requires
a fee and/or special permission from the Endowment.
Online Paper
CDROM Version: Load the CDROM "Volume 1 Issue 5, VLDB '89-'97" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
Matthias Jarke, Michael J. Carey, Klaus R. Dittrich, Frederick H. Lochovsky, Pericles Loucopoulos, Manfred A. Jeusfeld (Eds.):
VLDB'97, Proceedings of 23rd International Conference on Very Large Data Bases, August 25-29, 1997, Athens, Greece.
Morgan Kaufmann 1997, ISBN 1-55860-470-7
Contents
Electronic Edition
References
- [JMS95]
- H. V. Jagadish, Inderpal Singh Mumick, Abraham Silberschatz:
View Maintenance Issues for the Chronicle Data Model.
PODS 1995: 113-124
- [Knu73]
- Donald E. Knuth:
The Art of Computer Programming, Volume III: Sorting and Searching.
Addison-Wesley 1973, ISBN 0-201-03803-X
- [Moh90]
- C. Mohan:
ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes.
VLDB 1990: 392-405
- [MHL+92]
- C. Mohan, Donald J. Haderle, Bruce G. Lindsay, Hamid Pirahesh, Peter M. Schwarz:
ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging.
ACM Trans. Database Syst. 17(1): 94-162(1992)
- [OCGO96]
- Patrick E. O'Neil, Edward Cheng, Dieter Gawlick, Elizabeth J. O'Neil:
The Log-Structured Merge-Tree (LSM-Tree).
Acta Inf. 33(4): 351-385(1996)
- [OW93]
- Patrick E. O'Neil, Gerhard Weikum:
A Log-Structured History Data Access Method (LHAM).
HPTS 1993: 0-
- [SKS96]
- Abraham Silberschatz, Henry F. Korth, S. Sudarshan:
Database System Concepts, 3rd Edition.
McGraw-Hill Book Company 1997, ISBN 0-07-044756-X
- [SL76]
- Dennis G. Severance, Guy M. Lohman:
Differential Files: Their Application to the Maintenance of Large Databases.
ACM Trans. Database Syst. 1(3): 256-267(1976)
- [SC91]
- V. Srinivasan, Michael J. Carey:
On-Line Index Construction Algorithms.
HPTS 1991: 0-
Copyright © Fri Mar 12 17:22:55 2010
by Michael Ley (ley@uni-trier.de)