NonStop SQL [TM] achieves high performance through an implementation which integrates SQL record access with the pre-existing disk I/O and transaction management subsystems, and moves SQL function downward from the client to the server level of these subsystems. System integration and movement of function to the server reduce message traffic and CPU consumption by putting SQL optimizations at the lower levels of the system. Examples of such optimizations are message traffic savings by filtering data and applying updates at the data source, I/O savings by SQL-optimized buffer pool management, and locking and transaction journaling techniques which take advantage of SQL semantics. Achieving message traffic reduction is particularly important in a distributed, non shared-memory architecture such as the Tandem NonStop System. The result of this implementation is an SQL system which matches the performance of the pre-existing DBMS, while inheriting such pre-existing architecturally-derived features as high availability, transaction-based data integrity, and distribution of both data and execution.
[1]
이헌,et al.
[기술동향 소개]Fault Tolerant Computing System
,
1985
.
[2]
Andreas Reuter,et al.
Tandem Database Group - NonStop SQL: A Distributed, High-Performance, High-Availability Implementation of SQL
,
1987,
HPTS.
[3]
Andrea J. Borr.
Transaction Monitoring in ENCOMPASS: Reliable Distributed Transaction Processing
,
1981,
VLDB.
[4]
Andreas Reuter,et al.
Group Commit Timers and High Volume Transaction Systems
,
1987,
HPTS.
[5]
Michael Stonebraker,et al.
Database Portals: A New Application Program Interface
,
1984,
VLDB.
[6]
Jim Gray,et al.
Notes on Data Base Operating Systems
,
1978,
Advanced Course: Operating Systems.
[7]
Andrea J. Borr.
Robustness to Crash in a Distributed Database: A Non Shared-memory Multi-Processor Approach
,
1984,
VLDB.
[8]
Joel F. Bartlett,et al.
A NonStop kernel
,
1981,
SOSP.