ACM DL

Database Systems (TODS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Database Systems (TODS), Volume 11 Issue 2, June 1986

Fragmentation: a technique for efficient query processing
Giovanni Maria Sacco
Pages: 113-133
DOI: 10.1145/5922.5638
A “divide and conquer” strategy to compute natural joins by sequential scans on unordered relations is described. This strategy is shown to always he better than merging SCBIIS when both relations must he sorted before joining, and...

An integrated approach to logical design of relational database schemes
Catriel Beeri, Michael Kifer
Pages: 134-158
DOI: 10.1145/5922.214291

  1. We propose a new approach to the design of relational database schemes. The main features of the approach are the following:
  2. A combination of the traditional decomposition and synthesis approaches, thus allowing the use of both...

    Incomplete information costs and database design
    Haim Mendelson, Aditya N. Saharia
    Pages: 159-185
    DOI: 10.1145/5922.5678
    This paper presents a methodology for trading-off the cost of incomplete information against the data-related costs in the design of database systems. It investigates how the usage patterns of the database, defined by the characteristics of...

    Computation-tuple sequences and object histories
    Seymour Ginsburg, Katsumi Tanaka
    Pages: 186-212
    DOI: 10.1145/5922.5924
    A record-based, algebraically-oriented model is introduced for describing data for “object histories” (with computation), such as checking accounts, credit card accounts, taxes, schedules, and so on. The model consists of sequences...

    Order-preserving key transformations
    Anil K. Garg, C. C. Gotlieb
    Pages: 213-234
    DOI: 10.1145/5922.5923
    File organizations based on conventional hash functions provide faster access to the stored records in comparison with tree-like file structures. Tree structures such as B+-trees and ISAM do provide for sequential...