Computation-tuple sequences and object histories

  title={Computation-tuple sequences and object histories},
  author={S. Ginsburg and Katsumi Tanaka},
  journal={ACM Trans. Database Syst.},
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 of computation tuples defined by a computation-tuple sequence scheme (CSS). The CSS has three major features (in addition to input data): computation (involving previous computation tuples), “uniform” constraints (whose satisfaction by a computation-tuple sequence u… 
Decision Problems of Object histories
The present investigation considers decision problems related to two of these properties, namely “local” constraints and “bad-subsequence’ constraints, as well as decision problems for several set-theoretic relations concerning the sets of object histories described by CSS.
Object Histories Which Avoid Certain Subsequences
In the present investigation the notion of bad-subsequence constraint is defined and CSS in which each constraint is of this kind are studied, and the results are reported on Necessary and sufficient conditions for a set of object histories described by a given CSS to be described by another CSS having only bad- Subsequence constraints.
Input-Dependent-Only Object Histories
This notion of input-dependent-only (IDO) constraint is abstracted and CSS in which each constraint is IDO are studied, and necessary and sufficient conditions are obtained for a set of object histories described by an arbitrary CSS to be described by another CSS having only IDO constraints.
Cohesion of Object Histories
The problem of combining the global information residing in a number of object histories in a distributed system is considered and a suggested solution is in the form of an operation called “cohesion”, which is the analogue for object histories of join for relational databases.
Interval Queries on Object Histories: Extended Abstract
This extended abstract introduces the notion of ’ interval queries ’ on historical data for objects (here, called ‘object histories’) and explores a certain closure property and provides conditions under which an interval query applied to object histories described by one CSS yields, as its answers.
Projection of Object Histories
The present paper studies the effect of projections on object histories, and looks at when the projection of the set of all valid object histories described by one CSS is the set by some other CSS.
Computation-Tuple Sequences and Object Histories: Extended Abstract
The purpose of the present paper is to introduce a mathematical model allowing such an investigation as the identification and analysis of relevant issues in database aspects of office automation and their associated research problems.
Regular Sequence Operations and Their Use in Database Queries
A family of regular sequence operations (called rs-operations) to be used in database queries is introduced, based on a simple pattern matching mechanism using regular expressions as its patterns, and includes most of the “natural” operations on sequences.
Extending Functional Dependencies in Indefinite Sequence Relations
This work introduces the concept of an indefinite sequence relation r over a relation schema R in order to capture the semantics of sequence data having indefinite values and establishes a formal hierarchical structure over the class of indefinite sequence relations having a fixed schema and cardinality which can be employed to classify the relations into different levels of precision.
Ordered Functional Dependencies in Relational Databases
This work formally defines Ordered Functional Dependencies (OFDs) for the extended model by means of two possible extensions of domains, pointwise-orderings and lexicographical orderings, and establishes a sound and complete set of chase rules for OFDs in the case of lexicographic orderings.


Formal semantics for time in databases
The concept of a historical database is introduced as a tool for modeling the dynamic nature of some part of the real world and the modal concepts of intensional and extensional data constraints and queries are introduced and contrasted.
Principles of Database Systems
A large part is a description of relations, their algebra and calculus, and the query languages that have been designed using these concepts. There are explanations of how the theory can be used to
The design of Star's records processing: data processing for the noncomputer professional
Star's records processing feature integrates traditional data processing functionality into this user model, using standard Star documents for data de£mition, entry, display, update, and report generation.
Document processing in a relational database system
{PG,1 A new variety of Asiatic hybrid lily plant bearing large clusters of medium-sized flowers of excellent form, strong color, and long persistence, both on the plant and as a cut flower; the
Limitations of record-based information models
Record structures are generally efficient, familiar, and easy to use for most current data processing applications. But they are not complete in their ability to represent information, nor are they
Office Information Systems and Computer Science
Office information systems are defined as entities which perform document storage, retrieval, manipulation, and control within a distributed environment.
defined for each u in Dom(( V)) by&u) = u[( U,)]. Clearly, T' locally bisimulates T via (k
  • ACM Transactions on Database Systems
  • 1986
Received November
  • Received November
  • 1983
SIGMOD: Proceedings on Datdmses for BLlsiness and Office Applicntiom
  • SIGMOD: Proceedings on Datdmses for BLlsiness and Office Applicntiom
  • 1983
Principles of Dntahse System
  • Principles of Dntahse System
  • 1982