An Architecture for Integrating Images and Text in a Database Environment

Modern textual database management systems are designed to promote the controlled sharing of information. Different users have their own view of the centrally managed data and act as if the system were designed specifically for them. Recently, there has been much interest in various sorts of non-textual database management systems, especially those which handle image data and support retrieval of information by content.

[1]  William I. Grosky,et al.  Towards a data model for integrated pictorial databases , 1983, Comput. Vis. Graph. Image Process..

[2]  Gregory Y. Tang,et al.  A management system for an integrated database of pictures and alphanumerical data , 1981 .

[3]  Thomas G. Szymanski,et al.  A fast algorithm for computing longest common subsequences , 1977, CACM.

[4]  Robert M. Haralick,et al.  Structural Descriptions and Inexact Matching , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  William I. Grosky,et al.  Iconic Indexing using Gener-alised Pattern Matching Techniques , 1986 .

[6]  Larry S. Davis,et al.  Shape Matching Using Relaxation Techniques , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  E. F. Codd,et al.  Extending the database relational model to capture more meaning , 1979, ACM Trans. Database Syst..

[8]  A. Blaser,et al.  Data Base Techniques for Pictorial Applications , 1980, Lecture Notes in Computer Science.

[9]  King-Sun Fu,et al.  Query-by-Pictorial-Example , 1980, IEEE Trans. Software Eng..

[10]  David Maier,et al.  On Finding Minimal Length Superstrings , 1980, J. Comput. Syst. Sci..

[11]  Daniel S. Hirschberg,et al.  Algorithms for the Longest Common Subsequence Problem , 1977, JACM.