Database processing (4th ed.): fundamentals, design & implementation
Database processing (4th ed.): fundamentals, design & implementation
Formal semantics for time in databases
ACM Transactions on Database Systems (TODS)
Limitations of record-based information models
ACM Transactions on Database Systems (TODS)
Office Information Systems and Computer Science
ACM Computing Surveys (CSUR)
The design of Star's records processing: data processing for the noncomputer professional
ACM Transactions on Information Systems (TOIS)
Document processing in a relational database system
ACM Transactions on Information Systems (TOIS)
Principles of Database Systems
Principles of Database Systems
An extension of the relational data model to incorporate ordered domains
ACM Transactions on Database Systems (TODS)
Interval Queries on Object Histories: Extended Abstract
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Extending Functional Dependencies in Indefinite Sequence Relations
ER '99 Proceedings of the 18th International Conference on Conceptual Modeling
| Hi-index | 0.00 |
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 implies satisfaction by every interval of u), and specific sequences with which to start the valid computation-tuple sequences. A special type of CSS, called “local,” is singled out for its relative simplicity in maintaining the validity of a computation-tuple sequence. A necessary and sufficient condition for a CSS to be equivalent to at least one local CSS is given. Finally, the notion of “local bisimulatability” is introduced for regarding two CSS as conveying the same information, and two results on local bisimulatability in connection with local CSS are established.