A Document Management System

  • Yahiko Kambayashi
Conference paper


In this paper, a document management system under development is discussed. Besides conventional relational database functions and word processing capabilities (a spell checker, a word index generator), the following functions are required.
  1. (1)

    History of documents, including merging and splitting of documents, must be handled.

  2. (2)

    The correspondences between two consecutive documents can be detected, so that the influence of changes on one document to the other can be calculated.

  3. (3)

    Since there may be a lot of similar documents, data compression facility is required.

  4. (4)

    Powerful retrieval functions as well as a user friendly interface are required. Especially, handling of time and versions is important.

  5. (5)

    Besides retrieval functions, we need functions to identify required documents among a set of candidate documents.

  6. (6)

    In order to handle related documents, a new authorization mechanism must be developed.



Database Management System Require Document Difference Information Grant Option Document Editor 
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. [CLIFW83]
    CLIFW83]J. Clifford and D. Warren, “Formal Semantics for Time in Databases,” ACM TODS, Vol. 8, No. 2, pp. 214–254, June 1983.CrossRefGoogle Scholar
  2. [FAGI7809]
    R. Fagin, “On an Authorization Mechanism,” ACM TODS, Vol 3, No. 3, pp. 310–319, Sep. 1978.CrossRefMathSciNetGoogle Scholar
  3. [GINST8408]
    S. Ginsburg and K. Tanaka, “Interval Queries on Object Histories: Extended Abstract,” Proc. 10th International Conference on VLDB, pp. 208–217, Aug. 1984.Google Scholar
  4. [GINST8505]
    S. Ginsburg and K. Tanaka, “Computation-tuple Sequence and Object Histories: Extended Abstract,” Proc. International Conference on Foundations of Data Organization, Kyoto, Japan, May 1985.Google Scholar
  5. [GRIF’W7609]
    P. P. Griffiths and B. W. Wade, “An Authorization Mechanism for a Relational Database System,” ACM TODS, Vol. 1, No. 3, pp. 242–255, Sep. 1976.CrossRefGoogle Scholar
  6. [KAMBT7710]
    Y. Kambayashi, K. Tanaka and S.Yajima, “A Relational Data Language with Simplified Binary Relation Handling Capability,” Proc. 3rd VLDB, pp. 338–350, Oct. 1977.Google Scholar
  7. [KAMB8010]
    Y. Kambayashi, “Generalized Dynamic Authorization Mechanisms,” Operating Systems Engineering (Lecture Notes in Computer Science 143), pp. 63–77, Springer-Verlag, Oct. 1980.Google Scholar
  8. [KAMBN8105]
    Y. Kambayashi, N. Nakatsu and S. Yajima, “Data Compression Procedures Utilizing the Similarity of Data,” AFIPS National Computer Conference, Vol. 50, pp. 555–562, May 1981.Google Scholar
  9. [KAMBT83]
    Y. Kambayashi, K. Tanaka and K. Takeda, “Synthesis of Unnormalized Relations Incorporating More Meaning,” Information Science, Vol. 29, pp. 201–247, 1983.CrossRefMATHGoogle Scholar
  10. [KITAK8111]
    H.Kitagawa, T.L.Kunii and Y.Ishii, “Design and Implementation of a Form Management System APAD Using ADABAS/INQ DBMS”, IEEE COMPSAC, pp. 324–334, Nov. 1981.Google Scholar
  11. [KITAK8201]
    H. Kitagawa and T.L. Kunii, “Form Transformer — Formal Aspect of Table Nests Manipulation”, Proc. Hawaii Conf., pp. 132–141, Jan. 1982.Google Scholar
  12. [KLOPL8310]
    M. R. Klopprogge and P. G. Lockemann, “Modeling Information Preserving Databases: Consequences of the Concept of Time,” Proc. 9th International Conference on VLDB, pp.399–417, Oct. 1983.Google Scholar
  13. [LUM 8405]
    V. Lum, P.Dadam, R. Erbe, J. Guenauer, P. Pistor, G. Walch, H. Werner and J. Woodfill, “Designing DBMS Support for the Temporal Dimension,” Proc. of SIGMOD International Conference on Management of Data, pp. 115–130, June 1984.Google Scholar
  14. [LUM 8505]
    V.Lum et. al., “Design of an Intergrated DBMS to Support Advanced Applications,” Proc. Foundation of Data Organization, pp. 21–31, May 1985.Google Scholar
  15. [MACDF8201]
    N.H. MacDonald, L.T. Frase, P.S. Gingrich and S.A. Keenan,“The writer’s workbench: Computer Aids for Text Analysis,” IEEE Trans. Vol. COM-30, No. 1, pp. 105–110, Jan. 1982.CrossRefGoogle Scholar
  16. [SHUL8209]
    N.C. Shu, V.Y. Lum, F.C. Tung and C.L. Chang, “Specification of Forms Processing and Business Procedures for Office Automation,” IEEE Trans. Vol.SE-8, No. 5, pp. 499–512, Sept. 1982.Google Scholar
  17. [SNOD8404]
    R. Snodgrass, “The Temporal Query Language TQuel,” Proc. ACM SIGACTSIGMOD International Symposium on PODS, pp. 204–213, Apr. 1984.Google Scholar

Copyright information

© Springer-Verlag Tokyo 1986

Authors and Affiliations

  • Yahiko Kambayashi
    • 1
  1. 1.Kyushu UniversityJapan

Personalised recommendations