ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 1985-1989  (3)
Collection
Keywords
Publisher
Years
Year
  • 1
    Electronic Resource
    Electronic Resource
    Evaluating the performance of algebraic operations on storage schemes for large sparse matrices (1988)
    Springer
    Engineering with computers 4 (1988), S. 121-134 
    Details
    ISSN: 1435-5663
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Technology
    Notes: Abstract We study the performance of algebraic operations on large sparse matrices stored on secondary storage and show how the traditional algorithms can be fine-tuned in order to minimize the number of page accesses. We develop cost equations for performing multiplication, transposition, and Gaussian elimination on various secondary storage schemes for sparse matrices and show how these can be incorporated into a selection model which chooses the optimal sequence of storage schemes for a given mix of operations. Furthermore, we present the results of a number of experiments and compare our analytical results with experimental results obtained on synthetically generated data.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01199294
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A heuristic file reorganization algorithm based on record clustering (1989)
    Springer
    BIT 29 (1989), S. 428-447 
    Details
    ISSN: 1572-9125
    Keywords: H.0 ; H.2.2 ; H.3.3
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The problem of file organization which we consider involves altering the placement of records on pages of a secondary storage device. In addition, we want this reorganization to be done in-place, i.e., using the file's original storage space for the newly reorganized file. The motivation for such a physical change is to improve the database system's performance. For example, by placing frequently and jointly accessed records on the same page or pages, we can try to minimize the number of page accesses made in answering a set of queeries. The optimal assignment (or reassignment) of records to clusters is exactly what record clustering algorithms attempt to do. However, record clustering algorithms usually do not solve the entire problem, i.e., they do not specify how to efficiently reorganize the file to reflect the clustering assignment which they determine. Our algorithm is a companion to general record clustering algorithms since it actually transforms the file. The problem of optimal file reorganization isNP-hard. Consequently, our reorganization algorithm is based on heuristics. The algorithm's time and space requirements are reasonable and its solution is near optimal. In addition, the reorganization problem which we consider in this paper is similar to the problem of join processing when indexes are used.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02219229
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    facet.materialart.
    Unknown
    Evaluating the performance of algebraic operations on storage schemes for large sparse matrices (1988)
    Springer
    Details
    Publication Date: 1988-09-01
    Print ISSN: 0177-0667
    Electronic ISSN: 1435-5663
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Technology
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...