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 2, June 1985

An efficient I/O interface for optical disks
Jeffrey S. Vitter
Pages: 129-162
DOI: 10.1145/3857.3862
We introduce the notion of an I/O interface for optical digital (write-once) disks, which is quite different from earlier research. The purpose of an I/O interface is to allow existing operating systems and application programs that use magnetic...

Estimating the cost of updates in a relational database
M. Schkolnick, P. Tiberio
Pages: 163-179
DOI: 10.1145/3857.3863
In this paper, cost formulas are derived for the updates of data and indexes in a relational database. The costs depend on the data scan type and the predicates involved in the update statements. We show that update costs have a considerable...

Adaptive record clustering
C. T. Yu, Cheing-mei Suen, K. Lam, M. K. Siu
Pages: 180-204
DOI: 10.1145/3857.3861
An algorithm for record clustering is presented. It is capable of detecting sudden changes in users' access patterns and then suggesting an appropriate assignment of records to blocks. It is conceptually simple, highly intuitive, does not need...

Cautious transaction schedulers with admission control
Naoki Katoh, Toshihide Ibaraki, Tiko Kameda
Pages: 205-229
DOI: 10.1145/3857.3860
We propose a new class of schedulers, called cautious schedulers, that grant an input request if it will not necessitate any rollback in the future. In particular, we investigate cautious WRW-schedulers that output schedules in...

GALILEO: a strongly-typed, interactive conceptual language
Antonio Albano, Luca Cardelli, Renzo Orsini
Pages: 230-260
DOI: 10.1145/3857.3859
Galileo, a programming language for database applications, is presented. Galileo is a strongly-typed, interactive programming language designed specifically to support semantic data model features (classification, aggregation, and...

Height-balanced trees of order (β, γ, δ)
Shou-Hsuan S. Huang
Pages: 261-284
DOI: 10.1145/3857.3858
We study restricted classes of B-trees, called H(&bgr;, &ggr;, &dgr;) trees. A class is defined by three parameters: &bgr;, the size of a node; &ggr;, the minimal number of grandsons a node must have; and &dgr;, the minimal number of leaves...

Comments on batched searching of sequential and tree-structured files
Marek Piwowarski
Pages: 285-287
DOI: 10.1145/3857.214294
Exact formulas for the expected cost savings from batching requests against two types of j-ary trees are given. Approximate expressions are also presented.