Backend Database System
Backend Database System
FRED J. MARYANSKI
Digital Equipment Corporation, 146 Main Street, Maynard, Massachusetts 01754
INTRODUCTION
and prototyped similar systems. However,
The introduction of generalized database according to the definitions presented here,
management systems in the late 1960s re- the author is unaware of any backend
sulted in a substantial increase in the ca- DBMS available in the marketplace. In this
pabilities of business data processing in- paper the structure and operation of back-
stallations. Unfortunately, this increase in end databases are presented, followed by a
data processing capability has stimulated a discussion of their economic and perform-
corresponding increment in the demand for ance characteristics. The intent of this tu-
services. As a result many installations have torial is to provide the reader with an un-
reached the point of resource saturation. derstanding of the concepts embodied in
The obvious, yet increasingly unappealing, backend databases and of the problems cur-
recourse to saturation is a mainframe up- rently impeding the progress toward their
grade. A recently devised alternative to emergence as commercially viable entities.
such an upgrade is the offloading of data- The concentration in this tutorial is on
base management functions from an exist- backend database systems realized in soft-
ing mainframe to a directly attached mini- ware on Von Neumann computers. The
computer. This alternative configuration is realization of backend systems using spe-
known as a backend database management cial-purpose database machines is a topic
system (DBMS). that also has attracted considerable atten-
Since the development of the first pro- tion and has been reported in depth re-
totype backend DBMS by Canaday et al. cently [BERR77, HSIA79, LANG79]. Many of
at Bell Laboratories [CANA74], many com- the issues discussed herein apply to both
mercial and research groups have evaluated software and hardware backend systems.
Permission to copy without fee all or part of this material is granted provided that the copies are not made or
distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its
date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To
copy otherwise, or to republish, requires a fee and/or specific permission.
© 1980 ACM 0010-4892/80/0300-0003 $00.75
Host
(APPLICATIONFUNCTION)
INTRODUCTION
1. BACKEND DBMS ARCHITECTURE
2. BEiNEFITS AND DRAWBACKS
Performance I INTER
Cost PROCESSOR
Reliability LINK
Security
AdditionalResources
Modularity
3. R E S E A R C H E F F O R T S
XDMS
BACKEND
IDMS (DATABASEFUNCTION)
KSU
MADMAN
Analysis of Prototypes
Additional Work
4. E X T E N S I O N S
Multiple-HostBackend D B M S
Multiple-ProcessorBackend D B M S
5. I M P L E M E N T A T I O N P R O B L E M S
Communication
Machine Code Conversion
Portability
Marketing
6. C O N C L U S I O N
ACKNOWLEDGMENTS
REFERENCES FIGURE 1. Backend D B M S .
However, the in-depth presentation and tion are presented, and their impact is an-
analysis will center on software database alyzed. The problems facing the implemen-
systems. tors of backend databases are described in
Similarly, a substantial number of the Section 5.
issues presented in this tutorial are also of
importance in the study of distributed data- 1. BACKEND DBMS ARCHITECTURE
base systems. Discussions of distributed
databases can be found in AscH74, DEPP76, In its most elementary form a backend
HARD78, LOWS77, MARY78a, MILL78, and DBMS consists of a locally connected pair
Roth77b, The reader wishing to acquire of computers, as shown in Figure 1. The
some basic information on database sys- application programs are executed by the
tems is referred to the tutorials in KIM79, host computer, while the backend machine
SHNE76, or SIBL76 or to recent textbooks controls access to the database. The soft-
on the subject [CARD79, DATE77, DEEN77, ware functions necessary to support data-
MART77, Ts]c77]. base application programs are divided be-
Section 1 presents the architecture of tween the host and backend computers ac-
backend database systems, considering cording to the above rule.
both hardware and software organization. In order to establish a foundation for
In the second section the expected benefits understanding the manner in which a back-
and drawbacks of the backend DBMS con- end DBMS functions, let us first consider
cept are described in detail. Section 3 dis- the operational sequence of application
cusses several research excursions into the programs and a database management sys-
area of backend databases. In Section 4 tem in a single-machine environment. Fig-
extensions to the basic backend configura- ure 2 depicts the software organization of
'APPLICATION PROGRAM K
WORK AREA
0
APPLICATION PROGRAM i E y
WORK AREA R
DBMS BUFFERS
G
1 K
FIGURE 2. Single-machine D B M S .
a single-machine DBMS. The major com- currently available data. If this is the case,
ponents of a single-machine database sys- Step 8 is executed next.
tem are 4. The DBMS requests that the operat-
ing system perform a transfer between the
(1) the database software (DBMS); secondary storage device containing the re-
(2) the application programs; quested data and the system buffers.
(3) the operating system and its buffers; 5. The operating system initiates the
(4) the schema, which is a logical descrip- transfer between secondary storage and pri-
tion of the entire database; mary memory.
(5) the subschemata, which describe the
6. The data are transferred from second-
portion of the database available to the ary storage into the system buffers. This
individual application programs and may require that a portion o f the existing
provide a mechanism for validating the contents of the buffer space be written onto
program's access rights to the data; and secondary storage in order to provide suf-
(6) the work areas, which are shared by the ficient space for the new data without loss
application programs and the DBMS.
of previous information.
The sequence of operations in a single- 7. The operating system notifies the
machine DBMS is described below. A re- DBMS that the transfer is complete.
trieval operation is presented for illustra- 8. The DBMS places the data and status
tive purposes. The same general opera- information in the work area of the appli-
tional sequence applies to the other opera- cation program that issued the request.
tions, such as storage, deletion, and modi-
fication. Completion
9. The application program may access
Origination and Validation the data and status information in the work
1. The application program issues a re- area in the course of its execution.
quest to the DBMS indicating the opera-
tion required and the data to be operated In order to form a backend database sys-
upon. tem, the functional modules of the single-
2. The request is validated against the machine DBMS must be distributed be-
subschema to ensure that the application tween the host and backend machines.
program has the right to issue the request. Communication and interface modules
must be added. Figure 3 illustrates the soft-
Data Access ware organization of a backend DBMS. The
3. The DBMS checks its buffers to de- new components include a communication
termine if the request can be satisfied with system that must exist on both computers,
COMMUNICATION SYSTEM
COMMUNICATION SYSTEM
host and backend interface routines, and The interprocessor link should be of at
the database tasks that reside on the back- least channel speed if intermachine com-
end computer. The functions of the com- munication is not to become a bottleneck
ponents required for extension into the [CANA74, MARY76b]. Simulation studies
backend environment are discussed in the have indicated that intermachine links with
following paragraphs. speeds of 1 Mbaud or greater will produce
The communication system must provide only minimal communication delays. Con-
the facilities for the transmission of com- figurations with the host and backend pro-
mands, data, and status information be- cessors sharing common memory have been
tween the host and backend machines. The proposed for situations in which quick re-
control of the physical links, proper utili- sponse is necessary.
zation of line protocols, transmission error The interface routines are the processes
detection and correction, processor and that exchange information via the commu-
task synchronization, and management of nication system. The host interface, HINT,
message buffers are among the responsibil- is the process that is called by the applica-
ities of the communication system. Since a tion program when access to the database
backend DBMS is a special case of a com- is desired. HINT must format the database
puter network, the communication facility request according to the requirements of
need not contain all the features of a fuU- the communication system and then trans-
scale network communication system. For mit the request as a message to the backend
example, a routing mechanism is unneces- interface via the communication system.
sary in a two-machine backend DBMS. When the database operation is complete,
XDMS AUGMENTED
META-4 BACKEND
SCHEMA
SYSTEM
TABLE
FIGURE 5. X D M S h a r d w a r e configuration.
MAIN I~
MEMORY I
TM
HOST
I
BACKEND
CONTROL
~1 SHARED
MEMORY
FIGURE 7. M A D M A N backend D B M S .
in Figure 8 [HuTc78], can be realized. This memory and CPU cycles were deemed to
arrangement permits high-speed interpro- be the critical resources in the MADMAN
cessor communication with minimal over- environment, only the CPU portion of the
head. In the configuration shown in Figure database activity is off-loaded to the back-
8, the disks remain connected to the host, end. Disk operations are still performed by
unlike the previously described backend the host. The M A D M A N designers felt that
database systems. In the M A D M A N back- primary memory and CPU cycles were the
end system, the host initiates the disk I/O key resources in this situation. In this sense,
operations, but the information is trans- the M A D M A N architecture diverges radi-
ferred to common memory, which is the cally from the organization of the other
PDP-11/70 main memory. The U N I B U S backend systems.
windows provide the backend with the abil- M A D M A N is built from smaller proces-
ity for simultaneous access to buffers con- sors than the other backend systems. It is
taining database requests and information the only system with a microprocessor
transferred to or from secondary storage. backend machine.
As with the backend processors in the Cost was the motivating factor in the
aforementioned systems, the LSI-11 is mul- selection of the LSI-11 as the backend ma-
tiprogrammed to permit overlap of I/O and chine for MADMAN. Another aim of the
CPU operations. system was portability among several exist-
MADMAN differs in several significant ing PDP-11 minicomputers. The intention
ways from the other backend systems. The is to be able to tie an LSI-11 to any of the
most important distinction is the direct minicomputers to form a backend D B M S
connection of the host and backend via system. In addition to cost and portability,
shared memory and bus linkages. This ar- a goal of the M A D M A N system is increased
chitecture provides faster physical com- performance. Although it appears that the
munication links than in the other backend design has accomplished the first two goals,
systems and also greatly simplifies the soft- extensive testing is still required to deter-
ware required to transmit information be- mine if the M A D M A N design is suitable
tween machines. Device-dependent driver- for the factory control environment.
type software is required for communica- The presence of a PDP-11 host, smaller
tion in MADMAN, while the other backend than a PDP-11/70, requires minor modifi-
systems are built with more sophisticated cations to the architecture of the
communication packages. Because primary MADMAN backend DBMS. These
UNIBUS
~L AL
II
÷ ~r
UNIBUS
PDP-i1/70 MAP
CACHE ~t
4-! CONTROL
UNIBUS UNIBUS
II WINDOW WINDOW
i DATA
BASE
MEMORY
~L
K MASS BUS ~F
Q-BUS
1 '''-'' l
FIGURE 8.
I I
M A D M A N shared-memory connection.
changes, along with a detailed account of The XDMS, IDMS, and KSU prototypes
the design of the system, are presented in all are limited by the speed of the machine
a paper by Hutchison and Roman interconnection. The use of a high-speed
[HuTc78]. line between the host and backend certainly
would increase the throughput of these sys-
Analysis of Prototypes tems. However the amount of the increase
is still unknown. The shared memory con-
In the second section of this paper, six nections of the MADMAN system have the
potential benefits of backend databases potential to minimize the communication
were identified. Since we have presented overhead. But thus far testing has not yet
four prototype systems, we can now deter- confirmed the viability of the MADMAN
mine how close these prototypes have come architecture.
to providing these benefits.
Performance Cost
Although improved performance is a neces- The studies supported by the U.S. Army
sity if backend database systems are to [CULL75, MARY76a] strongly endorsed a
become commercially viable, none of the backend system as an economic alternative
prototypes has exhibited this capability. to the upgrading of an overloaded main-
)
ration by Ozkarahan, Schuster, and Sevcik
[OZKA77] indicates that the response time
improvement is strongly dependent on the
type of database request. Operations such
as a simple retrieval or updates are very
FIGURE Ii. Multiple-processor backend D B M S . well suited for simultaneous execution by
multiple processors. However, an operation
such as relational cross-retrieval, which in-
chines. A high degree of concurrency can volves processing records (or tuples) se-
be achieved at a low cost, thus producing a quentially, is not performed more quickly
cost/performance ratio that makes this than in a single-processor configuration.
backend configuration economically at- A multiple-processor backend D B M S
tractive. distributed by function is pictured in Figure
A multiple-processor backend D B M S 13. In this configuration a number of spe-
can be realized in a number of configura- cial-purpose microprocessors are governed
tions. Three approaches--distribution by by the controlling processor. Each func-
tional processor performs a limited number
of database functions over the entire data-
FIGURE 12. Multiple-processor backend distributed by
base. As indicated in the figure, common
data.
functions such as retrievals may be embod-
ied in several processors. The controlling
processor performs the backend interface
CONTROLLER
function of parceling out the database re-
quests to the appropriate functional pro-
cessors and then transmitting the results to
the host. A functionally distributed multi-
ple-processor backend permits concurrent
execution of several database requests, thus
providing the potential for a high degree of
throughput. However, the problems asso-
TO
HOST
CONTROLLING
PROCESSOR
( DATABASE
0
FmURE 13. Multiple-processor backend distributed by function.
TO
HOST
CONTROLLING
PROCESSOR
CONCURRENCY
CONTROLLER
I DATA BASE 0
cording to the definitions presented in this be sufficiently general to permit the trans-
paper, are known to the author. Some in- mission of database commands, data, and
staUations are investigating home-grown status information without error between
backend implementations, but the concept the host and backend and also able to ac-
will not have a significant impact until a complish such transmissions with minimal
backend DBMS is marketed and supported overhead.
by a major vendor. A number of implemen- In order for the impact of the communi-
tation difficulties have hampered the com- cation delay between the host and backend
mercial development of backend databases. to be minimized, the interprocessor link
The more important of the implementation must be at least channel speed [MARY76b,
issues are discussed in this section. RosE77a]. None of the previously discussed
prototypes benefited from the luxury of
such a high-speed connection. In these sit-
Communication
uations the experimental nature of the pro-
A backend DBMS can be viewed as a two- totype backend DBMS precluded any
node local network. The means of commu- hardware modifications. Thus, although
nication between the two processors must performance benefits have been predicted
ComputingSurveys,Vol.12,No.1,March1980
22 F. J. Maryanski
MARY78C MARYANSKI, F. J., WALLENTINE, V. E., shop on Computer Architecture for Non-
FISHER, P. S., AND CALHOUN, Numeric Processing, May 1977, pp. 35-
M . A . "Distributed data base manage- 39.
ment using minicomputers," in Minis ver- ROTH77a ROTHNIE, J. B., AND GOODMAN,N. "An
sus Mainframes, Infotech State-of-the- overview of the preliminary design of
Art Rep., 1978, pp. 141-157. SDD-I: A system for distributed data-
MARY79 MARYANSKI,F. J., FISHER, P. S., HOUSH, bases," in Berkeley Workshop on Distrib-
R. D., AND SCHMIDT,D.A. "A prototype uted Data Management and Computer
distributed DBMS," in Hawaii Int. Conf. Networks, May 1977, pp. 38-57.
System Sciences, Jan. 1979, vol. 2, pp. ROTH77b ROTHNIE, J. B., AND GOODMAN, N. "A
205-214. survey of research and development in
MILL78 MILLER, M.W. "A survey of distributed distributed database management," in
data base management," Inf. Manage. 1, Conf. Very Large Data Bases, Oct. 1977,
6 (Dec. 1978) 243-264. pp. 48-62.
NOLA77 NOLAN, R. L. "Restructuring the data SAYA74 SAYANI,H . H . "Restart and recovery in
processing organization for data resource a transaction-oriented information pro-
management," Inf. Process. 77 (Aug. cessing system," in Proc. ACM SIGMOD
1977) 261-265. Conf., May 1974, pp. 351-366.
OZKA77 OZKARAHAN,E. A., SCHUSTER,S. A., AND SHNE76 SHNEIDERMAN, B., ED. Database man-
SEVCIK, K.C. "Performance evaluation agement systems, AFIPS Press, Arling-
of a relational associative processor," ton i Va., 1976.
ACM Trans. Database Syst. 2, 2 (June SIBLEY, E. H., ED. "Special issue on
SIBL76
1977) 175-195.
data base management systems," Comput.
PEEB75 PEEBLES, R., AND MANNING, E. "A Surv. 8, 1 (March 1976).
computer architecture for large (distrib-
uted) data bases," in Conf. Very Large Tsic77 TSICHRITZIS, V. C., AND LOCHOVSKY,
Data Bases, Sept. 1975, pp. 405-427. F. H. Data base management systems,
PEEB78 PEEBLES, R., AND MANNINGE. "System Academic Press, New York, 1977.
architecture for distributed data manage- VERH78 VERHOFSTAD, J. S . M . "Recovery tech-
ment," Computer (IEEE) 11, 1 (Jan. niques for database systems," Comput.
1978), 40-47. Surv. 10, 2 (June 1978) 167-196.
ROSE77a ROSENTHAL, R. S. "An evaluation of WALL76 WALLENTINE, V. E., HANKLEY, W. J.,
data base management machines," in An- FISHER, P. S., CALHOUN, M. A., AND
nual Computer Related Information Sys- MARYANSKI, F. J. "An overview of
tem Symp., U.S. Air Force Academy, 1977. MIMICS design," TRCS77-04, Computer
RosE77b ROSENTHAL, R. S. "The data manage- Science Dept., Kansas State Univ., Man-
ment machine, a classification," in Work- hattan, Kans., Dec. 1976.