Relational Information Systems |
Common terms and phrases
ACCTCR ACCTDB Algorithm ASSEMBLY Attrib axis B-tree binary binary relation block blocksize Bloom filter boundary bytes Cartesian product cell Chapter closure Codd constraint cost CUSTOMER database defined deletions DEPT differential file direct access discussed disk domain algebra edges entries Equation equiv equivalence reduction example Exercise fanout functional dependence give graph Hannah Trainman hash function histogram ijoin implementation instance internal nodes ITEM join attribute linear probing load factor Locomotive main file matrix merge method natural join null value number of different number of tuples operand operations ORDERBOOK ORDLINE overflow partition path pointer processing projection query relational algebra requires result SALESMAN search key secondary storage Section segment selection sequential file shown in Exhibit shows sort-merge specified split stored tidy function tion topological sort TOTOUT Toy Train transactions tree trie tuples ujoin update virtual hashing