ACM DL

Database Systems (TODS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Database Systems (TODS), Volume 10 Issue 1, March 1985

Limitations of concurrency in transaction processing
Peter Franaszek, John T. Robinson
Pages: 1-28
DOI: 10.1145/3148.3160
Given the pairwise probability of conflict p among transactions in a transaction processing system, together with the total number of concurrent transactions n, the effective level of concurrency E(n,p) is defined as the expected number of the n...

Database partitioning in a cluster of processors
Domenico Sacca, Gio Wiederhold
Pages: 29-56
DOI: 10.1145/3148.3161
In a distributed database system the partitioning and allocation of the database over the processor nodes of the network can be a critical aspect of the database design effort. In this paper we develop and evaluate algorithms that perform this...

Use of graph-theoretic models for optimal relational database accesses to perform join
Sakti Pramanik, David Ittner
Pages: 57-74
DOI: 10.1145/3148.3325
A graph model is presented to analyze the performance of a relational join. The amount of page reaccesses, the page access sequence, and the amount of buffer needed are represented in terms of graph parameters. By using the graph model formed...

Linear hashing with overflow-handling by linear probing
Per-Åke Larson
Pages: 75-89
DOI: 10.1145/3148.3324
Linear hashing is a file structure for dynamic files. In this paper, a new, simple method for handling overflow records in connection with linear hashing is proposed. The method is based on linear probing and does not rely on chaining. No...

Analysis of dynamic hashing with deferred splitting
Eugene Veklerov
Pages: 90-96
DOI: 10.1145/3148.318987
Dynamic hashing with deferred splitting is a file organization scheme which increases storage utilization, as compared to standard dynamic hashing. In this scheme, splitting of a bucket is deferred if the bucket is full but its brother can...

Expressions for batched searching of sequential and hierarchical files
Prashant Palvia
Pages: 97-106
DOI: 10.1145/3148.3326
Batching yields significant savings in access costs in sequential, tree structured, and random files. A direct and simple expression is developed for computing the average number of records/pages accessed to satisfy a batched query of a...

Database hosting in strongly-typed programming languages
Martin Bever, Peter C. Lockemann
Pages: 107-126
DOI: 10.1145/3148.3327
Database system support has become an essential part of many computer applications, which have extended beyond the more traditional commercial applications to, among others, engineering applications. Correspondingly, application programming with...