The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Restructuring for large databases: three levels of abstraction
ACM Transactions on Database Systems (TODS)
EXPRESS: a data EXtraction, Processing, and Restructuring System
ACM Transactions on Database Systems (TODS)
CONVERT: a high level translation definition language for data conversion
Communications of the ACM
Deadlock detection and resolution in a CODASYL based data management system
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
A high-level data manipulation language for hierarchical data structures
Proceedings of the 1976 conference on Data : Abstraction, definition and structure
Generalized data base management system data structures and their mappingto physical storage
Generalized data base management system data structures and their mappingto physical storage
An approach to data description and conversion
An approach to data description and conversion
Automatic generation of data conversion-programs using a data description language (ddl)
Automatic generation of data conversion-programs using a data description language (ddl)
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Extracting unique rows of a bounded degree array using tries
AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
| Hi-index | 0.00 |
In the past several years much attention has been given to the problem of data translation. The focus has been mainly on methodologies and specification languages for accomplishing this task. Recently, several prototype systems have emerged, and now the issues of implementation and performance must be addressed. In general, a data restructuring specification may contain multiple source and target files. This specification can be viewed as a “process graph” which is a network of restructuring operations subject to precedence constraints. One technique used to achieve good performance is that of pipelining data in the process graph.In this paper we address a number of issues pertinent to a pipelining architecture. Specifically, we give algorithms for resolving deadlock situations which can arise, and partitioning the process graph to achieve an optimal schedule for executing the restructuring steps. In addition, we discuss how pipelining has influenced the design of the restructuring operations and the file structures used in an actual system.