ACM DL

Database Systems (TODS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Database Systems (TODS), Volume 2 Issue 4, Dec. 1977

Analysis of aarchitectural features for enhancing the performance of a database machine
E. A. Ozkarahan, K. C. Sevcik
Pages: 297-316
DOI: 10.1145/320576.320577
RAP (Relational Associative Processor) is a “back-end” database processor that is intended to take over much of the effort of database management in a computer system. In order to enhance RAP's performance its design includes...

Independent components of relations
Jorma Rissanen
Pages: 317-325
DOI: 10.1145/320576.320580
In a multiattribute relation or, equivalently, a multicolumn table a certain collection of the projections can be shown to be independent in much the same way as the factors in a Cartesian product or orthogonal components of a vector. A precise...

A transformational grammar-based query processor for access control in a planning system
Robert H. Bonczek, James I. Cash, Andrew B. Whinston
Pages: 326-338
DOI: 10.1145/320576.320582
Providing computer facilities and data availability to larger numbers of users generates increased system vulnerability which is partially offset by software security systems. Much too often these systems are presented as ad hoc additions to the...

Database buffer paging in virtual storage systems
Tomás Lang, Christopher Wood, Eduardo B. Fernández
Pages: 339-351
DOI: 10.1145/320576.320585
Three models, corresponding to different sets of assumptions, are analyzed to study the behavior of a database buffer in a paging environment. The models correspond to practical situations and vary in their search strategies and replacement...

Validation algorithms for pointer values in DBTG databases
D. A. Thomas, B. Pagurek, R. J. Buhr
Pages: 352-369
DOI: 10.1145/320576.320589
This paper develops algorithms for verifying pointer values in DBTG (Data Base Task Group) type databases. To validate pointer implemented access paths and set structures, two algorithms are developed. The first procedure exploits the...

A facility for defining and manipulating generalized data structures
Billy G. Claybrook
Pages: 370-406
DOI: 10.1145/320576.320591
A data structure definition facility (DSDF) is described that provides definitions for several primitive data types, homogeneous and heterogeneous arrays, cells, stacks, queues, trees, and general lists. Each nonprimitive data structure consists...