Realization of nested relation interfaces for relational and network databases

  • Yahiko Kambayashi
  • Tetsuya Furukawa
  • Hideki Yamamoto
Part III Database Modeling
Part of the Lecture Notes in Computer Science book series (LNCS, volume 361)


If a normalized relation satisfies a set of dependencies, it has some redundancy. In relational database design such redundancy is removed by decomposition of a relation. Nested relation approach is another way to reduce such redundancy. Since all the facts are shown in one relation, this method is suitable for user interface. In order to get a proper nested relation, we must consider the form defined by the user as well as dependencies (in relational databases) or structures (in network databases). Thus we have to solve the following problems.

(1) To check whether there is a contradiction between the user defined structure and the dependencies on the structure.

(2) To find an efficient procedure to produce a nested relation when there is no contradiction.

In this paper we will discuss the above two methods for relational and network databases.


Relational Database Query Processing Nest Structure Record Type Network Schema 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BERNC81]
    Bernstein, P.A. and Chiu, D.-M. W., “Using Semi-Joins to Solve Relational Queries,” J. ACM, Vol. 28, No. 1, pp. 25–41, Jan. 1981.Google Scholar
  2. [CHENK84]
    Chen, H. and Kuck, S. M., “Combining Relational and Network Retrieval Methods,” Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 131–141, June 1984.Google Scholar
  3. [DAYAG82]
    Dayal, U. and Goodman, N., “Query Optimization for CODASYL Database Systems,” Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 138–150, June 1982.Google Scholar
  4. [FISHS85]
    Fisher, P. C., Saxton, L. V., Thomas, S. J., and Van Gucht, D., “Interactions between Dependencies and Nested Relational Structures,” J. Comp. and Syst. Sci., Vol. 31, No. 3, pp. 343–354, Dec. 1985.Google Scholar
  5. [JAESS82]
    Jaeschke, G. and Scheck, H.-J., “Remarks on the Algebra of Non First Normal Form Relations,” Proc. the 1st ACM SIGACT-SIGMOD Symp. on Principles of Database Syst., pp. 124–138, March 1982.Google Scholar
  6. [KAMBT77]
    Kambayashi, Y., Tanaka, K., and Yajima, S., “A Relational Data Language with Simplified Binary Relation Handling Capability,” Proc. Int. Conf. on Very Large Data Bases, pp. 338–350, Oct. 1977.Google Scholar
  7. [KAMBT83]
    Kambayashi, Y, Tanaka, K. and Takeda, K., “Synthesis of Unnormalized Relations Incorporating More Meaning,” Information Science, Vol. 29, pp. 201–247, 1983.Google Scholar
  8. [OZSOY87]
    Ozsoyoglu, Z. M. and Yuan, L.-Y., “A New Normal Form for Nested Relations,” ACM Trans. Database Syst., Vol. 12, No. 1, pp. 111–136, March 1987.Google Scholar
  9. [ROTHK87]
    Roth, M. A. and Korth, H. F., “The Design of non-1NF Relational Databases into Nested Form,” Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 143–159, May 1987.Google Scholar
  10. [SHU-L82]
    Shu, N. C., Lum, V. Y., Tung, F. C., and Chang, C. L., “Specification of Forms Processing and Business Procedures for Office Automation,” IEEE Trans. Software Eng., Vol. SE-8, No. 5, pp. 499–512, 1982.Google Scholar
  11. [ULLM82]
    Ullman, J. D., Principles of Database Systems, Second Edition, Computer Science Press, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Yahiko Kambayashi
    • 1
  • Tetsuya Furukawa
    • 1
  • Hideki Yamamoto
    • 2
  1. 1.Department of Computer Science & Communication EngineeringKyushu UniversityFukuokaJapan
  2. 2.Sumitomo Electric IndustriesOsakaJapan

Personalised recommendations