Downloads & Free Reading Options - Results

Relational database technology is examined as a means to support computer Risk Assessment at the Naval Postgraduate School. The current methodology for conducting computer Risk Assessment within the Department of the Navy is used to construct an initial design for a relational database system. The initial design focuses on computer asset identification and valuation as the first step of the computer Risk Assessment process. Additional keywords: user needs; requirements; data processing security; systems engineering. (Author).

The New Jersey Water-Transfer Data System (NJWaTr) is a database design for the storage and retrieval of water-use data. NJWaTr can manage data encompassing many facets of water use, including (1) the tracking of various types of water-use activities (withdrawals, returns, transfers, distributions, consumptive- use, wastewater collection, and treatment); (2) the storage of descriptions, classifications and locations of places and organizations involved in water-use activities; (3) the storage of details about measured or estimated volumes of water associated with water-use activities; and (4) the storage of information about data sources and water resources associated with water use. In NJWaTr, each water transfer occurs unidirectionally between two site objects, and the sites and conveyances form a water network. The core entities in the NJWaTr model are site, conveyance, transfer/volume, location, and owner. Other important entities include water resource (used for withdrawals and returns), data source, permit, and alias. Multiple water-exchange estimates based on different methods or data sources can be stored for individual transfers. Storage of user-defined details is accommodated for several of the main entities. Many tables contain classification terms to facilitate the detailed description of data items and can be used for routine or custom data summarization. NJWaTr accommodates single-user and aggregate-user water-use data, can be used for large or small water-network projects, and is available as a stand-alone Microsoft Access database. Data stored in the NJWaTr structure can be retrieved in user-defined combinations to serve visualization and analytical applications. Users can customize and extend the database, link it to other databases, or implement the design in other relational database applications.

The New Jersey Water-Transfer Data System (NJWaTr) is a database design for the storage and retrieval of water-use data. NJWaTr can manage data encompassing many facets of water use, including (1) the tracking of various types of water-use activities (withdrawals, returns, transfers, distributions, consumptive- use, wastewater collection, and treatment); (2) the storage of descriptions, classifications and locations of places and organizations involved in water-use activities; (3) the storage of details about measured or estimated volumes of water associated with water-use activities; and (4) the storage of information about data sources and water resources associated with water use. In NJWaTr, each water transfer occurs unidirectionally between two site objects, and the sites and conveyances form a water network. The core entities in the NJWaTr model are site, conveyance, transfer/volume, location, and owner. Other important entities include water resource (used for withdrawals and returns), data source, permit, and alias. Multiple water-exchange estimates based on different methods or data sources can be stored for individual transfers. Storage of user-defined details is accommodated for several of the main entities. Many tables contain classification terms to facilitate the detailed description of data items and can be used for routine or custom data summarization. NJWaTr accommodates single-user and aggregate-user water-use data, can be used for large or small water-network projects, and is available as a stand-alone Microsoft Access database. Data stored in the NJWaTr structure can be retrieved in user-defined combinations to serve visualization and analytical applications. Users can customize and extend the database, link it to other databases, or implement the design in other relational database applications.

This paper repeats in detail the algorithm earlier employed in the database computer (DBC) in order to perform relational equality joins. Two improvements of the algorithm are proposed herein. The first improvement is achieved by adding a new memory component, called the C-memory, for each processor of the algorithm. The C-memory is used to store the results of the join operation. Also, it is a vital component during the execution of a m-way join operation. The second improvement involves the replacement of a single associative memory (AM) by several smaller associative memories (ams). Two advantages accrue as a result of this replacement. First, we show that each of the ams needs to operate at a slower rate than the single AM. This implies that we may use random-access memory (RAM) to realize ams, instead of the true and expensive associative hardware. The second advantage is due to an improvement in the complexity of the join operation when the ams are used. It is shown that the time complexity of the join is linear in the cardinalities of the source, target and result sets (relations). We therefore postulate that no join algorithm can have better time complexity than this. The paper also provides a thorough queueing analysis of the join algorithm as it is carried out in a specialized DBC component known as the post processor (PP).

This paper repeats in detail the algorithm earlier employed in the database computer (DBC) in order to perform relational equality joins. Two improvements of the algorithm are proposed herein. The first improvement is achieved by adding a new memory component, called the C-memory, for each processor of the algorithm. The C-memory is used to store the results of the join operation. Also, it is a vital component during the execution of a m-way join operation. The second improvement involves the replacement of a single associative memory (AM) by several smaller associative memories (ams). Two advantages accrue as a result of this replacement. First, we show that each of the ams needs to operate at a slower rate than the single AM. This implies that we may use random-access memory (RAM) to realize ams, instead of the true and expensive associative hardware. The second advantage is due to an improvement in the complexity of the join operation when the ams are used. It is shown that the time complexity of the join is linear in the cardinalities of the source, target and result sets (relations). We therefore postulate that no join algorithm can have better time complexity than this. The paper also provides a thorough queueing analysis of the join algorithm as it is carried out in a specialized DBC component known as the post processor (PP).

This paper repeats in detail the algorithm earlier employed in the database computer (DBC) in order to perform relational equality joins. Two improvements of the algorithm are proposed herein. The first improvement is achieved by adding a new memory component, called the C-memory, for each processor of the algorithm. The C-memory is used to store the results of the join operation. Also, it is a vital component during the execution of a m-way join operation. The second improvement involves the replacement of a single associative memory (AM) by several smaller associative memories (ams). Two advantages accrue as a result of this replacement. First, we show that each of the ams needs to operate at a slower rate than the single AM. This implies that we may use random-access memory (RAM) to realize ams, instead of the true and expensive associative hardware. The second advantage is due to an improvement in the complexity of the join operation when the ams are used. It is shown that the time complexity of the join is linear in the cardinalities of the source, target and result sets (relations). We therefore postulate that no join algorithm can have better time complexity than this. The paper also provides a thorough queueing analysis of the join algorithm as it is carried out in a specialized DBC component known as the post processor (PP).

Perma.cc archive of https://www3.ntu.edu.sg/home/ehchua/programming/sql/Relational_Database_Design.html created on 2022-09-01 15:27:51.193846+00:00.

This thesis extends the Graphical User Interface of a prototype multi-relational database front-end system, called Amadeus. System enhancements are realized through the application of Object-Oriented Programming (OOP) and Human-Computer Interface (HCI) design principles. Knowledge gained from each topic has been incorporated into the design and implementation of a Form-based interface for database data entry and display. The focus of this thesis is divided between two issues: the development of a set of tools for creating and using Form objects; and the design of the Form object itself. Form creation is accomplished using an application program called the Interface Editor module. The Interface Editor is one of six modules which, together, comprise the Amadeus system. Form manipulation occurs in a second application which implements basic program methods for controlling Data entry and display processes. Design and implementation of this thesis was accomplished using the Prograph programming language and development environment, which provided a basic set of system classes essential to the implementation of the Form object and Graphical User Interfaces.... Object-Oriented Programming, User interface design, Prograph, Visual programming, Form-based interface, Database systems

Available from National Technical Information Service, Springfield, Va

The purpose of this study was to evaluate the feasibility of implementing a computerized database management system to support the AFIT thesis process. A database was designed and implemented using a relational database management system. Although the database was limited to thesis topics and advisors, this system would be useful for other supervisory and administrative functions.

The purpose of this study was to evaluate the feasibility of implementing a computerized database management system to support the AFIT thesis process. A database was designed and implemented using a relational database management system. Although the database was limited to thesis topics and advisors, this system would be useful for other supervisory and administrative functions.

The problem addressed in this thesis effort concerns the design and implementation of the nested relational data model. The data model is designed within the Exodus extensible architecture. Although a large amount of theory exists with the model, no vehicle has been available to implement the concepts. The objective of the model is to increase performance of non-traditional databases by modeling real-world objects in the problem domain into nested relations within the software domain of Exodus. Exodus is used to implement several components essential to the data model. First, the concept of nested relations is realized, and then a parser is developed to create and maintain a data dictionary. The Colby relational algebra is used to form the query tree for the query optimizer, and a plan tree permits the code to be generated for the query. Operator methods are developed for the query to be subsequently executed. The nested relational data model was implemented using the Exodus architecture. The nested relational data model was implemented using the Exodus architecture. The query tree was built and the code generated for the architecture's compiler. Operator methods were implemented for the project, select, and natural join operators. Because the data model can be implemented, more non-traditional databases can be developed with efficient components. (KT)

The problem addressed in this thesis effort concerns the design and implementation of the nested relational data model. The data model is designed within the Exodus extensible architecture. Although a large amount of theory exists with the model, no vehicle has been available to implement the concepts. The objective of the model is to increase performance of non-traditional databases by modeling real-world objects in the problem domain into nested relations within the software domain of Exodus. Exodus is used to implement several components essential to the data model. First, the concept of nested relations is realized, and then a parser is developed to create and maintain a data dictionary. The Colby relational algebra is used to form the query tree for the query optimizer, and a plan tree permits the code to be generated for the query. Operator methods are developed for the query to be subsequently executed. The nested relational data model was implemented using the Exodus architecture. The nested relational data model was implemented using the Exodus architecture. The query tree was built and the code generated for the architecture's compiler. Operator methods were implemented for the project, select, and natural join operators. Because the data model can be implemented, more non-traditional databases can be developed with efficient components. (KT)

The problem addressed in this thesis effort concerns the design and implementation of the nested relational data model. The data model is designed within the Exodus extensible architecture. Although a large amount of theory exists with the model, no vehicle has been available to implement the concepts. The objective of the model is to increase performance of non-traditional databases by modeling real-world objects in the problem domain into nested relations within the software domain of Exodus. Exodus is used to implement several components essential to the data model. First, the concept of nested relations is realized, and then a parser is developed to create and maintain a data dictionary. The Colby relational algebra is used to form the query tree for the query optimizer, and a plan tree permits the code to be generated for the query. Operator methods are developed for the query to be subsequently executed. The nested relational data model was implemented using the Exodus architecture. The nested relational data model was implemented using the Exodus architecture. The query tree was built and the code generated for the architecture's compiler. Operator methods were implemented for the project, select, and natural join operators. Because the data model can be implemented, more non-traditional databases can be developed with efficient components. (KT)

The problem addressed in this thesis effort concerns the design and implementation of the nested relational data model. The data model is designed within the Exodus extensible architecture. Although a large amount of theory exists with the model, no vehicle has been available to implement the concepts. The objective of the model is to increase performance of non-traditional databases by modeling real-world objects in the problem domain into nested relations within the software domain of Exodus. Exodus is used to implement several components essential to the data model. First, the concept of nested relations is realized, and then a parser is developed to create and maintain a data dictionary. The Colby relational algebra is used to form the query tree for the query optimizer, and a plan tree permits the code to be generated for the query. Operator methods are developed for the query to be subsequently executed. The nested relational data model was implemented using the Exodus architecture. The nested relational data model was implemented using the Exodus architecture. The query tree was built and the code generated for the architecture's compiler. Operator methods were implemented for the project, select, and natural join operators. Because the data model can be implemented, more non-traditional databases can be developed with efficient components. (KT)

The Roth Relational Database System is a database system designed and implemented for teaching and research purposes at the Air Force Institute of Technology. During this thesis effort, an investigation into the design and implementation of the Roth Relational Database System is made in order to continue the design and implementation of the AFIT Relational Database System. Additional research was done to assess the feasibility of suggestions made by Roth concerning the continued development of the system. Specifically, an investigation was made concerning Theo Haerder's access structure and an investigation was made concerning the interface between the editor and the low level access mechanism. With this research accomplished, a top down structured design was completed for the edit functions and the low level access structure. Once this was accomplished an algorithm was developed, implemented and tested for the insertion and deletion of values into a B-tree. (Author)

Performance measurements of a database machine reflect not only the processing power of the machine, but also the size and structure of the database. It is therefore useful to construct databases for performance measurements of database machines. Furthermore, it is useful to utilize synthetic data, such that the volume of the reply can be predicted for a given query and the structure and attributes of the database can be varied for intended test queries. Conducting measurement studies using a synthetic database contributes to the generality of the results when different test queries are employed. A parameterized program is described herein which can be used to generate various relations for a synthetic database. The experiences in constructing and using the database generator are described. It is suggested that given sufficient information on real-world databases the generator may be useful for modeling them as well as for creating databases for benchmark tests. (Author)

Performance measurements of a database machine reflect not only the processing power of the machine, but also the size and structure of the database. It is therefore useful to construct databases for performance measurements of database machines. Furthermore, it is useful to utilize synthetic data, such that the volume of the reply can be predicted for a given query and the structure and attributes of the database can be varied for intended test queries. Conducting measurement studies using a synthetic database contributes to the generality of the results when different test queries are employed. A parameterized program is described herein which can be used to generate various relations for a synthetic database. The experiences in constructing and using the database generator are described. It is suggested that given sufficient information on real-world databases the generator may be useful for modeling them as well as for creating databases for benchmark tests. (Author)

This thesis extends the Graphical User Interface of a prototype multi-relational database front-end system, called Amadeus. System enhancements are realized through the application of Object-Oriented Programming (OOP) and Human-Computer Interface (HCI) design principles. Knowledge gained from each topic has been incorporated into the design and implementation of a Form-based interface for database data entry and display. The focus of this thesis is divided between two issues: the development of a set of tools for creating and using Form objects; and the design of the Form object itself. Form creation is accomplished using an application program called the Interface Editor module. The Interface Editor is one of six modules which, together, comprise the Amadeus system. Form manipulation occurs in a second application which implements basic program methods for controlling data entry and display processes. Design and implementation of this thesis was accomplished using the Prograph programming language and development environment, which provided a basic set of system classes essential to the implementation of the Form object and the Graphical User Interfaces developed for this thesis.

This thesis extends the Graphical User Interface of a prototype multi-relational database front-end system, called Amadeus. System enhancements are realized through the application of Object-Oriented Programming (OOP) and Human-Computer Interface (HCI) design principles. Knowledge gained from each topic has been incorporated into the design and implementation of a Form-based interface for database data entry and display. The focus of this thesis is divided between two issues: the development of a set of tools for creating and using Form objects; and the design of the Form object itself. Form creation is accomplished using an application program called the Interface Editor module. The Interface Editor is one of six modules which, together, comprise the Amadeus system. Form manipulation occurs in a second application which implements basic program methods for controlling data entry and display processes. Design and implementation of this thesis was accomplished using the Prograph programming language and development environment, which provided a basic set of system classes essential to the implementation of the Form object and the Graphical User Interfaces developed for this thesis.

A translation program was implemented for the translation of generic relational queries into the Data Management Language (DML) of the TOTAL data base management system. The objectives of this thesis were to propose and detail a method of supporting a global relational query language for a heterogeneous distributed database management system (DDBMS), design generic query translators for the translation of global relational queries into local hierarchical and network DML, and partially implement translation software for the conversion of relational queries into TOTAL DML. The initial portion of the thesis presents an overall analysis of data partitioning, query decomposition and global query management in the DDBMS. Specific proposals are advocated concerning the specific approach to be taken toward a global query manager and the design of the global schema over current databases. The second portion formalizes the assumptions and constraints present in the global relational model, and presents generic algorithms for the translation of relational queries into hierarchical and network DML. The last portion details the implementation and testing of the relational to TOTAL translator. The approach used was to take information returned from the local data directory of the distributed database in response to a relational query, and compile that information into a generated Pascal program containing the TOTAL DML commands.

A translation program was implemented for the translation of generic relational queries into the Data Management Language (DML) of the TOTAL data base management system. The objectives of this thesis were to propose and detail a method of supporting a global relational query language for a heterogeneous distributed database management system (DDBMS), design generic query translators for the translation of global relational queries into local hierarchical and network DML, and partially implement translation software for the conversion of relational queries into TOTAL DML. The initial portion of the thesis presents an overall analysis of data partitioning, query decomposition and global query management in the DDBMS. Specific proposals are advocated concerning the specific approach to be taken toward a global query manager and the design of the global schema over current databases. The second portion formalizes the assumptions and constraints present in the global relational model, and presents generic algorithms for the translation of relational queries into hierarchical and network DML. The last portion details the implementation and testing of the relational to TOTAL translator. The approach used was to take information returned from the local data directory of the distributed database in response to a relational query, and compile that information into a generated Pascal program containing the TOTAL DML commands.

The design of faster relational database query processors to improve the data retrieval capability of a database was the goal of this research. The emphasis was on evaluating the potential of parallel implementations to allow use of multiprocessing. First, the theoretical properties of applying relational operations to distributed data were considered to provide an underlying data distribution and parallel processing environment model. Next, analytical models were constructed to evaluate various implementations of the select, project, and join relational operations and the update operations of addition, deletion, and modification for a range of data structures and architectural configurations. To simulate the performance of the query processor for all cases, the individual operator models needed to be extended for complex queries consisting of several relational operations. A solution to modeling multi-step queries was the use of a general normal form to express a query. This normal form query tree used combined operations to express relational algebra equivalent queries in a standard form. This standard tree form was then used to construct analytical models for multi-step queries. These models provide the capability to simulate the potential of different forms of parallelism in solving complex queries. The analysis of results of the analytical models presents a logical design for a multiprocessor query processor. This logical query processor using multiple processors and employing parallelism illustrated the potential for an improved query processor when the analytical model results of complex queries were compared to a benchmark of some current database systems. Keywords: Parallel processing; Theses.

Data Dictionary is defined to be the set of all data attributes, which describe data objects in terms of their intrinsic attributes, such as name, type, size, format and definition. It is recognized as the data base for the Information Resource Management, to facilitate understanding and communication about the relationship between systems applications and systems data usage and to help assist in achieving data independence by permitting systems applications to access data knowledge of the location or storage characteristics of the data in the system. A research and development effort to use Ada has produced a data dictionary with data base design capabilities. This project supports data specification and analysis and offers a choice of the relational, network, and hierarchical model for logical data based design. It provides a highly integrated set of analysis and design transformation tools which range from templates for data element definition, spreadsheet for defining functional dependencies, normalization, to logical design generator.

Thesis (M.S. in Computer Science)--Naval Postgraduate School, 1984

This thesis defines the analysis and design necessary to automate the current manual procedures for the inventory, requisitioning, and reporting of shipboard ammunition. After verifying data and functional requirements of the system, this study specifies the logical database design and application design of a relational shipboard ammunition management database application. In addition, the PARADOX relational database management system software package is used to implement the relations and specify the required reports for a prototype application. The potential for integrating an expert system with this shipboard ammunition relational database is discussed and other areas for future work are suggested.

A relational database system was designed with the goal of obtaining as near optimal behavior from the system as possible. In addition, the database was to be implemented as a general purpose system but with specific provisions for its use as a pedagogical tool for teaching database management and manipulation. The advantages and disadvantages of relational systems were explored, and based on a certain criteria a relational algebra was chosen as the basis for the data manipulation and definition language. With this background, a top-down structured design of the system was completed. Techniques used to manage data entry; i.e., the user interface, and techniques to transform those inputs in order to optimize their execution were developed and implemented.

A relational database system was designed with the goal of obtaining as near optimal behavior from the system as possible. In addition, the database was to be implemented as a general purpose system but with specific provisions for its use as a pedagogical tool for teaching database management and manipulation. The advantages and disadvantages of relational systems were explored, and based on a certain criteria a relational algebra was chosen as the basis for the data manipulation and definition language. With this background, a top-down structured design of the system was completed. Techniques used to manage data entry; i.e., the user interface, and techniques to transform those inputs in order to optimize their execution were developed and implemented.

Thesis (M.S. in Comp. Sci.)--Naval Postgraduate School, 1983

Thesis (M.S. in Comp. Sci.)--Naval Postgraduate School, 1983

A computer Security/Recovery System (CS/RS) model was designed with the goal of implementing it into a Relational Database Management System. In addition, the relational database was to serve as a pedagogical tool for teaching database management and manipulation techniques as well as security measures and issues. Toward these goals, an extensive literature search and analysis of the current state of the art Computer Security models was required in order to identify current unresolved issues and areas of research. The advantages and disadvantages associated with six computer security models were explored and addressed in this thesis. Then the requirements for a CS/RS model were indentified and defined, and based on certain favorable criteria, one of the computer security models analyzed was selected. Further, only one of the six models had ever been implemented using a relational database and none had ever been implemented using a microcomputer. Consequently, the ability to take one of the existing computer security models and to apply the security concepts used within this model was not an easy task and in some instances was not possible. Finally, the CS/RS model designed did not include the hierarchically ordered military security sensitivity levels. (Author)

Includes bibliographical references (p. 253-254) and index

Includes bibliographical references (p. 253-254) and index

Includes bibliographical references (p. 253-254) and index

Thesis advisor, C. Thomas Wu

Thesis advisor, R.L. Knight

Thesis advisor, R.L. Knight

Thesis advisor, R.L. Knight

Thesis advisor, R.L. Knight

Thesis advisor, R.L. Knight

Thesis advisor, R.L. Knight

This thesis defines the analysis and design necessary to automate the current manual procedures for the inventory, requisitioning, and reporting of shipboard ammunition. After verifying data and functional requirements of the system, this study specifies the logical database design and application design of a relational shipboard ammunition management database application. In addition, the PARADOX relational database management system software package is used to implement the relations and specify the required reports for a prototype application. The potential for integrating an expert system with this shipboard ammunition relational database is discussed and other areas for future work are suggested.

In an era of diminishing budgets, information technology must help direct operational commanders in the maximum utilization of their available resources. The institution of a relational database management system to identify and exploit an organization's strengths will aid in keeping forces combat ready at all times. The design and implementation of ZTRAX; a training, readiness and flight hour relational database management system. ZTRAX is expected to provide historical information of home and deployed, operational and training flight evolutions which will aid in the process of training and readiness planning. The ZTRAX application was implemented in November, 1991 and is a menu driven program which permits the addition, editing and querying of data contained on two source documents: the Monthly Training and Readiness Report and the Monthly Flight Hour Report. ZTRAX is run concurrently from within the Paradox program to permit a vast array of ad hoc queries, reports and the importation of graphical display mechanisms.

Relational database technology is examined as a means to cupport computer Risk Assessment at the Naval Postgraduate School. The current methodology for conducting computer Risk Assessment within the Department of the Navy is used to construct an initial design for a relational database system. The initial design focuses on computer asset identification and valuation as the first step of the computer Risk Assessment process.

Relational database technology is examined as a means to cupport computer Risk Assessment at the Naval Postgraduate School. The current methodology for conducting computer Risk Assessment within the Department of the Navy is used to construct an initial design for a relational database system. The initial design focuses on computer asset identification and valuation as the first step of the computer Risk Assessment process.

Relational database technology is examined as a means to cupport computer Risk Assessment at the Naval Postgraduate School. The current methodology for conducting computer Risk Assessment within the Department of the Navy is used to construct an initial design for a relational database system. The initial design focuses on computer asset identification and valuation as the first step of the computer Risk Assessment process.

Relational database technology is examined as a means to cupport computer Risk Assessment at the Naval Postgraduate School. The current methodology for conducting computer Risk Assessment within the Department of the Navy is used to construct an initial design for a relational database system. The initial design focuses on computer asset identification and valuation as the first step of the computer Risk Assessment process.

This work examines the application of Internet software technologies to provide access to remote relational databases via the World Wide Web. The research applies these software technologies to assist the Air Force Institute of Technology Civilian Institute Program in improving operations and student to staff communication. An analysis of the existing Internet software technologies revealed several competing technologies capable of performing the same database access functions. The analysis further revealed weaknesses and inconsistencies in the existing AFIT/CI database. A methodology is proposed to assist in analyzing an existing development environment and in selecting among the competing technologies to provide the web based database access. The methodology is applied to the AFIT/CI test case to demonstrate a technique of analyzing and designing web software components that will create new and improved uses for the existing CI database. Additional recommendations are also offered to improve the existing database operations. The results of applying the methodology demonstrated that it effectively focuses the developer on the key areas of the development environment necessary to choose among competing software technologies. Additionally, the methodology was proven to be flexible in response to changes in implementation technologies.

Traditionally, the design and implementation o-f a conventional database system begins with the choice o-f a data model followed by the specification of a model -based data language. Thus, the database system is restricted to a single data model and a specific data language. An alternative to this traditional approach to database—system development is the multi-lingual database system (MLDS) . This alternative approach enables the user to access and manage a large collection of databases via several data models and their corresponding data languages without the aforementioned restriction. In this thesis we present the specification and implementation of a relational /SQL language interface for the MLDS. Specifically, we present the specification and implementation of an interface which translates SQL language calls into attribute-based data language (ABDL) requests. We describe the software engineering aspects of our implementation and an overview of the four modules which comprise our relational /SQL language interface.

This project was initiated in response to the Congressionally mandated Defense Women's Health Research Program to advance women's health research and to design, develop, and maintain databases necessary to support research in women's health. An Institute of Medicine report in response to this mandate recommended that such databases should include armed services women in epidemiological research on gynecological conditions and other disorders of special concern to women. Close collaboration with the Air Force on data architecture and design was initiated and maintained throughout the project. The Navy research database has been completely assessed, documented, tri-service mapping of variables has been completed, and parallel databases have been developed for Navy officers and the Marine Corps. The services (Navy, Air Force, Army) cooperated in developing common terminology and procedures for tri-service reporting of incidence rates of first hospitalizations of active-duty women, including common algorithms and a standard population for determination of age standardization incidence ratios and a collaborative tri-service prototype epidemiological study was developed.