Advertisement

PICCOLO: A Data Model for Picture Database Computers

  • K. Yamaguchi
  • T. L. Kunii
Part of the Springer Series in Information Sciences book series (SSINF, volume 6)

Abstract

A picture data model for use as the architectural basis of picture database computers is investigated. For a picture database, it is required to manipulate varieties of data structures efficiently. In this paper, an extension of the relational model named PICCOLO is proposed. Operations of PICCOLO are more powerful than a relational algebra or QBE (Query By Example); the graph isomorphism can be checked by the operations of PICCOLO. The operation can be specified in a structured way and shared among users. For a picture database, it is also required to carry out operations in parallel in order to accelerate the execution. It is shown that the data operation of PICCOLO can be performed in a highly parallel way.

Keywords

Minimum Span Tree Relational Algebra Physical Picture Dimensional Array Query Form 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    T. L. Kunii, et. al., “An Interactive Fashion Design System INFADS,” Proc. of Conference on Computer Graphics and Interactive Techniques, 1974.Google Scholar
  2. 2.
    T. L. Kunii, S. Weyl, and J. M. Tenenbaum, “A Relational Data Base Schema for Describing Complex Picture with Color and Texture,” Proc. of Second International Conference on Pattern Recognition, 1975.Google Scholar
  3. 3.
    E. Carlson and P. Manty, Tech. Reports from IBM San Jose Research Laboratory.Google Scholar
  4. 4.
    S. K. Chang, J. Reuss, and B. H. McCormick, “An Integrated Relational Database System for Pictures,” Proc. of IEEE Workshop on Picture Data Description and Management, IEEE Computer Society, 1977, PP. 49–60.Google Scholar
  5. 5.
    N. S. Chang and K. S. Fu, “Query-by-Pictorial-Example,” Proc. COMPSAC 79, Chicago, November, 1979, PP. 325–330.Google Scholar
  6. 6.
    N. Alexandridis and A. Klinger, “Picture Decomposition Tree Data-structures, and Identifying Directional Symmetries as Node Combinations,” Computer Graphics and Image Processing, 8, 1978, pp. 43–77.CrossRefGoogle Scholar
  7. 7.
    N. Ohbo, K. Shimizu, and T. L. Kunii, “A Graph-theoretical approach to region detection,” Proc. IEEE Computer Society’s Third International Computer Software & Applications Conference, Chicago, Nov., 1979, PP. 751–756.Google Scholar
  8. 8.
    ANSI/X3/SPARC Study Group on Data Base Management Systems Interim Report, 75–02-08, FDT-Bulletin of the ACM SIGMOD, Vol. 7, No. 2, 1975.Google Scholar
  9. 9.
    “Directions in Computer Architecture”, IEEE Computer, Oct., 1980.Google Scholar
  10. 10.
    E. F. Codd, “A Relational Model of Data for Large Shared Data Banks,” Comm. ACM 13, 1970, pp. 377–387.zbMATHCrossRefGoogle Scholar
  11. 11.
    K. Yamaguchi, N. Ohbo, T. L. Kunii, H. Kitagawa, and M. Harada, “ELF: Extended relational model for Large, Flexible picture databases,” Proc. IEEE Workshop on Picture Data Description and Management, Asilmar, California, Aug., 1980, pp. 95–100.Google Scholar
  12. 12.
    E. F. Codd, “Relational Completeness of Data Base Sublanguages,” in Data Base Systems, ed. R. Rustin, 1972, Prentice-Hall, pp. 65–98.Google Scholar
  13. 13.
    M. M. Zloof, “Query by Example,” Proc. AFIPS, NCC, Vol. 44, 1975, pp. 431–438.CrossRefGoogle Scholar
  14. 14.
    J. E. Hopcroft and J. D. Oilman, “Introduction to Automata Theory, Language, and Computations,” Addison-Wesley, 1979.Google Scholar
  15. 15.
    K. Jensen and N. Wirth, “PASCAL User Manual and Report,” second edition, Spring-Verlag, 1975.zbMATHGoogle Scholar
  16. 16.
    P. B. Hansen, “Concurrent PASCAL,” IEEE Trans. Software Eng., SE-1, 1975, pp. 199–207.Google Scholar
  17. 17.
    D. E. Knuth, “The Art of Computer Programming, Fundamental Algorithms,” second edition. Vol. 1, Addison-Wesley, 1973.Google Scholar
  18. 18.
    J. M. Smith and C. P. Smith, “Database Abstraction: Aggregation and Generalization,” ACM Transaction on Database Systems, Vol. 2, No. 2, June 1977, pp. 105–133.CrossRefGoogle Scholar
  19. 19.
    E. F. Codd, “Extending the Database Relational Model to Capture More Meaning,” ACM Transaction on Database Systems, Vol. 4, No. 4, June 1979, PP. 347–434.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • K. Yamaguchi
    • 1
  • T. L. Kunii
    • 1
  1. 1.Department of Information Science, Faculty of ScienceThe University of TokyoHongo, Tokyo 113Japan

Personalised recommendations