Partitioned storage for temporal databases
Information SystemsPublished 1 January 1988
Ilsoo Ahn, Richard T. Snodgrass
Citations67
SJR quartileQ1
SJR score0.89
SNIP1.96
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Various issues on the temporally partitioned store are discussed, several formats for the history store are investigated, and their performance on a set of sample queries are evaluated.
Abstract
J6k-O8
Keywords
Computer Science
Acta InformaticaOrganization and maintenance of large ordered indexes
1,345 Citations1972Raymond Bayer, Edward M. McCreight
The index organization described allows retrieval, insertion, and deletion of keys in time proportional to logkI where I is the size of the index and k is a device dependent natural number such that the performance of the scheme becomes near optimal.
ACM Transactions on Database SystemsThe Grid File
1,149 Citations1984J. Nievergelt, Hans Hinterberger +1 more
This work discusses in detail the design decisions that led to the grid file, present simulation results of its behavior, and compare it to other multikey access file structures.
The K-D-B-tree
885 Citations1981John T. Robinson
A new data structure, the K-D-B-tree, is presented as a solution to the problem of retrieving multikey records via range queries from a large, dynamic index, and it is expected that the multidimensional search effieciency of balanced K-Ds and the I/O efficiency of B-trees should both be approximated in this structure.
ACM Transactions on Database SystemsThe design and implementation of INGRES
884 Citations1976Michael Stonebraker, Gerald Held +2 more
The currently operational (March 1976) version of the INGRES database management system is described, giving a relational view of data, supports two high level nonprocedural data sublanguages, and runs as a collection of user processes on top of the UNIX operating system for Digital Equipment Corporation PDP 11/40, 11/45, and 11/70 computers.
ACM Transactions on Database SystemsExtendible hashing—a fast access method for dynamic files
669 Citations1979Ronald Fagin, Jürg Nievergelt +2 more
This work studies, by analysis and simulation, the performance of extendible hashing and indicates that it provides an attractive alternative to other access methods, such as balanced trees.
ACM Transactions on Database SystemsThe temporal query language TQuel
607 Citations1987Richard T. Snodgrass
The language informally is discussed, the semantics of the TQuel statements that differ from their Quel counterparts are provided, including the modification statements, and TQuel is compared with ten other query languages supporting time.
Communications of the ACMApproximating block accesses in database organizations
385 Citations1977S. Bing Yao
Linear hashing: a new tool for file and table addressing
384 Citations1980Witold Litwin
ACM Transactions on Database SystemsDifferential files
302 Citations1976Dennis G. Severance, Guy M. Lohman
This paper describes a differential database representation which is shown to be an efficient method for storing large and volatile databases.
Communications of the ACMScatter storage techniques
193 Citations1983Robert Morris
L'article donne une presentation didactique sur les methodes connues utilisees par ceux qui ecrivent les assembleurs and compilateurs de maniere a reduire les temps de recherche dans les tables de symboles.
BIT Numerical MathematicsDynamic hashing
184 Citations1978Per-Åke Larson
A new file organisation called dynamic hashing is presented, based on normal hashing, but the allocated storage space can easily be increased and decreased without reorganising the file, according to the number of records actually stored in the file.
Communications of the ACMScatter storage techniques
178 Citations1968Robert Morris
C is a fuI1 word comparison which sets the condition codE; this example could be modified for a halfword ~able by changing (3 to CH and "4" to "2" throughout the instructions above).
IEEE Transactions on Software EngineeringDatabase Support for Versions and Alternatives of Large Design Files
125 Citations1984Randy H. Katz, Tobin J. Lehman
A B-tree-based storage structures to encode versions as ``negative'' differential files to keep the disk requirements small and discusses the effect of enormous amounts of cheap archival storage (write-once optical digital disks) on the proposed structures.
The time relational model
112 Citations1982Jacov Ben-Zvi
The central idea is to gain more functions and solutions based on the presence of time related information and, thus, spread the overall operational and implementation cost across multiple sources.
Very Large Data BasesIntegration of Time Versions into a Relational Database System
93 Citations1984Peter Dadam, Vincent Y. Lum +1 more
This paper presents the design considerations for a database system currently under implementation, that integrates time version support as a normal database function.
Bibliography: Temporal Databases.
78 Citations1986L. Edwin McKenzie
Very Large Data BasesVirtual hashing: a dynamically changing hashing
70 Citations1978Witold Litwin
This work defines virtual hashings which practically independently of the number of such records find in one disk access almost each record of the file, such that several accesses would be needed if the function initially chosen for the file was used.
Towards an implementation of database management systems with temporal support
63 Citations1986Ilsoo Ahn
Criteria of tuple versioning vs. attribute versioning is discussed, various forms of two level storage structures tailored for databases with temporal support are presented, and two distinct representation schemes for temporal versions are presented.
ACM SIGMOD RecordPerformance evaluation of a temporal database management system
55 Citations1986Ilsoo Ahn, Richard T. Snodgrass
Communications of the ACMLaser optical disk
51 Citations1984Larry Fujitani
Commercially available only recently, the optical disk drive uses a laser beam to burn impressions onto a plastic disk that yields storage densities up to 10 times those of magnetic disks.
Informatik-FachberichteDesign of an Integrated DBMS to Support Advanced Applications
44 Citations1985Vincent Y. Lum, Peter Dadam +6 more
New applications of DBMS’s in areas of sciences, engineering and offices have produced new requirements that are not satisfied in current DBMSs, and it is believed that much can be gained by designing a new system to satisfy the new requirements more directly.
ACM SIGART BulletinThe role of time in information processing
43 Citations1982Azad Bolour, Thomas L. Anderson +2 more
This chapter discusses the analysis of tensed statements in natural language and the need for a realistic world model to include representations not only for snapshot descriptions of the real world, but also for histories, or the evolution of such descriptions over time.
ACM Transactions on Database SystemsAnalysis of retrieval performance for records and objects using optical disk technology
37 Citations1987Stavros Christodoulakis
An optical disk model and an optimal schedule for retrieval of records and objects which qualify in a single query on a file stored on an optical disk device are presented and exact and approximate analytic results for evaluating the retrieval performance for objects from an optical disks are provided.
Information SciencesPerformance analysis of temporal queries
21 Citations1989Ilsoo Ahn, Richard T. Snodgrass
A model that takes a temporal query and a database schema as input, and outputs the estimated I/O cost for the query on that database, and can be used to analyze the performance of conventional databases.
Performance modeling and access methods for temporal database management systems
13 Citations1986Ilsoo Ahn
This research investigates the temporally partitioned store to provide fast response for various temporal queries without penalizing conventional non-temporal queries and analyzed the performance of TQuel queries on various access methods.