| 921 |
Table inheritance |
Find inheritance between base tables. Use table inheritance carefully because, for instance, certain constraints are not inherited and must be redefined on child tables. |
General |
system catalog base tables only |
2020-11-15 13:02 |
MIT License |
View |
| 922 |
Multiple inheritance |
Find instances of multiple inheriance of base tables. Make sure that multiple inheritance is indeed needed. |
General |
system catalog base tables only |
2020-11-15 12:20 |
MIT License |
View |
| 923 |
The number of direct and indirect child tables (table inheritance) |
Find the number of direct and all (direct+indirect) child tables of a base table based on the table inheritance. |
Sofware measure |
system catalog base tables only |
2020-11-14 19:59 |
MIT License |
View |
| 924 |
Depth of relational tree of a table |
Depth of relational tree of a table T (DRT(T)) is defined by Piattini et al. (2001) as "the longest referential path between tables, from the table T to any other table in the schema". The result may help to classify the data. If the depth is 0, then probably the table contains classifers. Tables with the largest depth probably contain some extra information about main entities. |
Sofware measure |
system catalog base tables only |
2020-11-14 16:13 |
MIT License |
View |
| 925 |
The number of direct and indirect child tables (foreign keys) |
Find the number of direct and all (direct+indirect) child tables of a base table based on the foreign keys. The result may help to classify the data. If the number of direct children is small but the number of all children is large, then the table probably contains classifiers. If both the number of direct and all children is large, then the table probably contains master data. If the number of all children is small, then the table probably contains transactional data, logs, or descriptive information of main entities. |
Sofware measure |
system catalog base tables only |
2020-11-14 16:10 |
MIT License |
View |
| 926 |
The longest referential paths |
Find the longest referential paths between the tables regardless of the schema that contain the tables. |
Sofware measure |
system catalog base tables only |
2020-11-14 15:42 |
MIT License |
View |
| 927 |
Depth of referential tree of a schema |
Depth of referential tree of a database schema is the longest referential path between the tables in this schema (Piattini et al., 2001). In other words, it is the biggest value among the DRT(T) values of all the tables of the schema. |
Sofware measure |
system catalog base tables only |
2020-11-14 15:28 |
MIT License |
View |
| 928 |
Referential degree of a schema |
Referential degree of a schema is defined as the number of foreign keys in the database schema. |
Sofware measure |
INFORMATION_SCHEMA only |
2020-11-13 11:30 |
MIT License |
View |
| 929 |
All user mappings |
Find all user mappings for foreign servers and tables |
General |
system catalog base tables only |
2020-11-11 17:00 |
MIT License |
View |
| 930 |
Are the passwords hashed? |
Find base table columns that name refers to the possibility that these are used to register passwords. Return a value from each such column. Make sure that the password is not registered as open text. |
General |
INFORMATION_SCHEMA+system catalog base tables |
2020-11-10 12:14 |
MIT License |
View |
| 931 |
All domains |
Find all domains. |
General |
INFORMATION_SCHEMA only |
2020-11-10 11:49 |
MIT License |
View |
| 932 |
The number and percentage of optinal columns in base tables |
Find the number and percentage of optinal columns in base tables |
Sofware measure |
INFORMATION_SCHEMA only |
2020-11-08 21:17 |
MIT License |
View |
| 933 |
Percentage of optional columns in each base table |
What is the percentage of optional columns (that permit NULLs) in case of each base table? It is better to prohibit the use of NULLs in as many columns as possible. Otherwise the results of queries may be misleading. |
Sofware measure |
INFORMATION_SCHEMA only |
2020-11-08 20:55 |
MIT License |
View |
| 934 |
The number and percentage of base tables where all the non-primary key columns are optional |
Find the number and percentage of base tables where all the non-primary key columns are optional |
Sofware measure |
INFORMATION_SCHEMA only |
2020-11-08 19:57 |
MIT License |
View |
| 935 |
The number and percentage of base tables without keys |
Find the extent in which repeating rows are permitted in the database. Find the number and percentage (from the total number of base tables) of base tables that do not have the PRIMARY KEY constraint and also do not have any UNIQUE constraints. |
Sofware measure |
INFORMATION_SCHEMA only |
2020-11-08 19:16 |
MIT License |
View |
| 936 |
The number and percentage of base tables without CHECK constraints |
Find the extent in which data integrity is checked at the database level. Find the number and percentage of base tables that do not have any associated CHECK constraints. |
Sofware measure |
INFORMATION_SCHEMA only |
2020-11-08 19:15 |
MIT License |
View |
| 937 |
Updataple foreign tables that refer to another PostgreSQL table |
Find foreign tables that have been defined based on postgresql_fwd foreign data wrapper and that are updatable. Make sure that updatability is in this case needed. |
General |
INFORMATION_SCHEMA only |
2020-11-06 17:15 |
MIT License |
View |
| 938 |
All foreign tables |
Find all foreign tables. |
General |
INFORMATION_SCHEMA only |
2020-11-06 15:20 |
MIT License |
View |
| 939 |
All declaratively partitioned tables |
Find partitioned tables that have been implemented by using the declarative approach. Declarative partitioning is implemented in PostgreSQL starting from PostgreSQL 10. |
General |
INFORMATION_SCHEMA+system catalog base tables |
2020-11-06 15:13 |
MIT License |
View |
| 940 |
All CHECK constraints of domains that are not associated with any table |
Find all CHECK constraints (except NOT NULL) of domains that are not associated with any column. |
General |
INFORMATION_SCHEMA only |
2020-11-06 14:51 |
MIT License |
View |