Binary-Relational Storage Structures | Zendy

Richard Frost | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Binary-Relational Storage Structures

Author(s) -

Richard Frost

Publication year - 1982

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/25.3.358

Subject(s) - computer science , relational database , binary number , set (abstract data type) , data structure , computer data storage , database , theoretical computer science , binary relation , data mining , arithmetic , mathematics , programming language , operating system , discrete mathematics

Any database, no matter how complex, can be represented as a set of binary-relationships. Consequently, a structure which can store such binary-relationships is logically sufficient as the storage mechanism for a general purpose database management system. For certain applications, the advantages of using such a structure would appear to outweigh the disadvantages. Surprisingly, however, very few systems have been built which use a binary-relational storage structure. The main reason would appear to be the difficulty of implementing such structures efficiently.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research