Application of sparse matrix techniques to search, retrieval, classification and relationship analysis in large data base systems - SPARCOM

Authors:
Ron Ashany
Affiliations:
-
Venue:
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Year:
1978

Citing 5
Cited 0

On Relevance, Probabilistic Indexing and Information Retrieval

Journal of the ACM (JACM)
Fact Retrieval and Deductive Question-Answering Information Retrieval Systems

Journal of the ACM (JACM)
State-space problem-reduction, and theorem proving—some relationships

Communications of the ACM
A relational model of data for large shared data banks

Communications of the ACM
Performing inferences over relation data bases

SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to meet the requirements of Large Data Base (LDB) Systems for short response time and high throughput a new approach has been investigated. In this paper only certain aspects of a powerful system, called SPARCOM, are described. The unique approach of this system is the conceptual conversion of data into large sparse binary matrices that enables one to apply sophisticated sparse matrix techniques to perform data base operations. Only for the sake of clarity the matrices are presented in their binary form. The high performance of the system is due to the direct conversion and manipulation of the matrices in their compact form as obtained from the application of the sparse matrix algorithms.