Application of Sparse Matrix Techniques to Search, Retrieval, Classification and Relationship Analysis in Large Data Base Systems - SPARCOM.
Ron Ashany:
Application of Sparse Matrix Techniques to Search, Retrieval, Classification and Relationship Analysis in Large Data Base Systems - SPARCOM.
VLDB 1978: 499-516@inproceedings{DBLP:conf/vldb/Ashany78,
author = {Ron Ashany},
editor = {S. Bing Yao},
title = {Application of Sparse Matrix Techniques to Search, Retrieval,
Classification and Relationship Analysis in Large Data Base Systems
- SPARCOM},
booktitle = {Fourth International Conference on Very Large Data Bases, September
13-15, 1978, West Berlin, Germany},
publisher = {IEEE Computer Society},
year = {1978},
pages = {499-516},
ee = {db/conf/vldb/Ashany78.html},
crossref = {DBLP:conf/vldb/78},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
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.
Copyright © 1978 by The Institute of
Electrical and Electronic Engineers, Inc. (IEEE).
Abstract used with permission.
CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
S. Bing Yao (Ed.):
Fourth International Conference on Very Large Data Bases, September 13-15, 1978, West Berlin, Germany.
IEEE Computer Society 1978
Contents
References
- [1]
- ...
- [2]
- ...
- [3]
- ...
- [4]
- ...
- [5]
- ...
- [6]
- ...
- [7]
- ...
- [8]
- ...
- [9]
- ...
- [10]
- ...
- [11]
- ...
- [12]
- ...
- [13]
- ...
- [14]
- ...
- [15]
- ...
- [16]
- ...
- [17]
- ...
- [18]
- M. E. Maron, J. L. Kuhns:
On Relevance, Probabilistic Indexing and Information Retrieval.
J. ACM 7(3): 216-244(1960)
- [19]
- ...
- [20]
- ...
- [21]
- ...
- [22]
- William S. Cooper:
Fact Retrieval and Deductive Question-Answering Information Retrieval Systems.
J. ACM 11(2): 117-137(1964)
- [23]
- ...
- [24]
- ...
- [25]
- ...
- [26]
- ...
- [27]
- Jack Minker:
Performing Inferences over Relation Data Bases.
SIGMOD Conference 1975: 79-91
- [28]
- Gordon J. van der Brug, Jack Minker:
State-Space, Problem-Reduction, and Theorem Proving-Some Relationships.
Commun. ACM 18(2): 107-115(1975)
- [29]
- ...
- [30]
- E. F. Codd:
A Relational Model of Data for Large Shared Data Banks.
Commun. ACM 13(6): 377-387(1970)
- [31]
- ...
- [32]
- ...
- [33]
- E. F. Codd:
Further Normalization of the Data Base Relational Model.
IBM Research Report, San Jose, California RJ909: (1971)
- [34]
- E. F. Codd:
Relational Completeness of Data Base Sublanguages.
In: R. Rustin (ed.): Database Systems: 65-98, Prentice Hall and IBM Research Report RJ 987, San Jose, California : (1972)
- [35]
- E. F. Codd:
Recent Investigations in Relational Data Base Systems.
IFIP Congress 1974: 1017-1021
- [36]
- ...
- [37]
- ...
- [38]
- ...
- [39]
- ...
Copyright © Tue Mar 16 02:21:55 2010
by Michael Ley (ley@uni-trier.de)