Applications of SPARCOM data base concepts to a crime combating environment

  • Authors:
  • Ron Ashany

  • Affiliations:
  • Thomas J. Watson Research Center, Yorktown Heights, New York

  • Venue:
  • AFIPS '77 Proceedings of the June 13-16, 1977, national computer conference
  • Year:
  • 1977

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper only certain aspects of a powerful Data Base System called SPARCOM, as reflected by some applications in a crime-combating environment are presented. SPARCOM stands for Sparse Associative Relational Connection Matrix. It is a method that was developed for the analysis, interpretation, organization, classification, update, and structure of stored data as well as for the search and retrieval of information from large data base (LDB) systems. The unique approach of this system is the conversion of data into large sparse binary matrices that enables one to apply sophisticated sparse matrix techniques to perform data base operations. The operations are performed on the matrices as though the entire matrix were present, but great amounts of storage space are saved, and execution time is significantly reduced by the storage and manipulation of the nonzero values only. Additional reduction in storage requirements and in execution time is achieved by SPARCOM's intrinsic normalization process that alleviates the grave problem of data redundancy, caused by multi-value attributes.