A domain based internal schema for relational database machines

ABSTRACT

In this paper a method for relational database storage organization is presented.The method is based upon a disaggregation of the relations and a subsequent reaggregation to form the domains on which the relations are defined.A hierarchical organization of the domain is proposed in order to keep track of the relational entities (i.e. relations, tuples and attributes) that insist on the values present in the domains.Then we introduce an implementation technique, referred to as Data Pool, suitable to be processed by a database machine capable of "on the fly" track processing.Finally we present an analytic evaluation of the DP method and an example of database and query with performance comparison of the DP method with the most common flat file technique.The proposed method appears to be generally advantageous in storage occupancy; in data retrieval operations it is extremely effective when joins between permanent relations are performed. Good performances can be achieved with other relational operations using proper parallel architectures and, when temporary relations are involved, using special purpose devices.

REFERENCES

• 1: S.Y.W.Su, G.J.Lipovski: CASSM: a Cellular System for Very Large Data Bases. 1975 VLDB, Framingham.
• 2: S.Y.W.Su: Cellular Logic Devices: concepts and applications. IEEE Computer Marzo 1979.
• 3: Chyuan Shiun Lin , Diane C. P. Smith , John Miles Smith, The design of a rotating associative memory for relational database applications, ACM Transactions on Database Systems (TODS), v.1 n.1, p.53-65, March 1976 [doi>10.1145/320434.320447]
• 4: S.A.Schuster, H.B.Nguyen, E.A.Ozkarahan, K.C.Smith: RAP2: an Associative Processor for Database and its Applications. IEEE Trans. on Computers, June 1979.
• 5: Jayanta Banerjee , David K. Hsiao , Richard I. Baum, Concepts and capabilities of a database computer\, ACM Transactions on Database Systems (TODS), v.3 n.4, p.347-384, Dec. 1978 [doi>10.1145/320289.320292]
• 6: J.Banerjee, D.K.Hsiao, K.Kannan: DBC --- a Database Computer for Very Large Database. IEEE Trans. on Computers, vol. CZ8, n. 6.
• 7: François Bancilhon , Micheł Scholl, Design of a backend processor for a data base machine, Proceedings of the 1980 ACM SIGMOD international conference on Management of data, May 14-16, 1980, Santa Monica, California [doi>10.1145/582250.582265]
• 8: K.Karlsson: Reduced Cover trees and Their Applications in the SABRE Access Path Model. Proc. of 81 VLDB Conf., Cannes Sept. 1981.
• 9: Michael Hammer , Bahram Niamir, A heuristic approach to attribute partitioning, Proceedings of the 1979 ACM SIGMOD international conference on Management of data, May 30-June 01, 1979, Boston, Massachusetts [doi>10.1145/582095.582110]
• 10: Jair M. Babad, A record and file partitioning model, Communications of the ACM, v.20 n.1, p.22-31, Jan. 1977 [doi>10.1145/359367.359418]
• 11: D.S.Batory: On Searching Transposed Files. Proc. of Intern. Conf. on VLDB, 1978.
• 12: D.J.De Witt: DIRECT --- a Multiprocessor Organization for Supporting a Relational Database Management System. IEEE Trans. on Computer, vol. CZ8, n. 6.
• 13: M.Missikoff, M.Terranova: An overview of the project DBMAC for a Relational Database Machine. Proceedings of 6° Workshop on Computer Architectures for Non-Numeric Processing, Hyère, 1981.
• 14: M.Missikoff: RELOB: a Relational Storage System. Proc. of International Conference on Data Base Management Systems, Milano june 1978.
• 15: R.Pinzani, F.Pippolini: Organizzazione Fisica dei Dati su una Macchina per Basi di Dati. Proc. Conference AICA 80, Bologna, Oct. 1980.
• 16: D.J.Dewitt, P.B.Hawthorn: A Performance Evaluation of Database Machine Architectures. Proc. of 81 VLDB Conf., Cannes, Sept. 81.