-
Notifications
You must be signed in to change notification settings - Fork 0
Operations on tables
A table can be constructed from a class or from a table definition comprising a set of attribute type pairs.
Table operations are best defined in C.J. Date’s writing on relational theory. The two key books to read are An Introduction to Database Systems (latest edition is eighth as of this writing) and Relational Theory for Computer Professionals. Here we’ll assume that you’ve read these or are somewhat familiar with the operations with only a very light treatment and a few simple examples.
Much of what you want to accomplish can be performed with instance sets, so you rarely need to explicitly construct tables. If you are not a relational algebra wizard, don’t worry. But Executable UML is rooted in relational theory and power modelers can sometimes specify complex computational activities more easily with table operations, as opposed to resorting to needlessly platform specific data structures.
Copyright 2020, 2021, 2022, 2023, 2025 © Leon Starr under MIT Open Source License
- Why they are problematic
- Instance attribute creation values
- Boolean values
- Special values
- Enumerated values
- Action block
- Statement
- Single line action
- Multiple dependent actions on a single line
- An action spread across multiple lines
- A conditional group of single line actions
- Comments
- Finding instances
- Attribute access
- Creation and deletion
- Subclass migration
- Creating a table from a class
- Creating a table with a definition
- Converting a table into a class
- Set operations on tables
- Set comparisons on tables
- Join
- Rename
- Extend
- Aggregation
- Rank
- Image
- Input values
- Signatures and name doubling
- Output values
- Execution order
- Sequential execution
- Conditional execution
- Signals
- Scrall has no for_each action
- Iteration