Storing matrices on disk for efficient row and column retrieval
type: Item
instance of: scholarly article
title: Storing matrices on disk for efficient row and column retrieval
zbMATH Open document ID: 0575.68033
DOI: 10.1016/0020-0190(85)90027-4
author: James R. Bitner
published in: Information Processing Letters
publication date: 1985-01-01T00:00:00Z
review text: We study the problem of storing a matrix on disk where the cost for retrieving a row or column is the number of different pages containing elements of that row or column and the cost of a matrix is the sum of the cost for retrieving each row and column. We give a non-obvious, nontrivial lower bound on the cost and one algorithm that asymptotically achieves this bound if the page size is in a given set of integers, and another that achieves it if not.
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 3919804
zbMATH Keywords: matrix operation
zbMATH Keywords: disk storage
zbMATH Keywords: optimization
zbMATH Keywords: lower bound
MaRDI profile type: Publication
full work available at URL: 0020-0190(85)90027-4
OpenAlex ID: W2019027565
cites work: Organizing matrices and matrix operations for paged memory systems
cites work: Gaussian elimination is not optimal
cites work: Preserving Proximity in Arrays
cites work: Preserving average proximity in arrays
cites work: On Preserving Proximity in Extendible Arrays
description: scientific article; zbMATH DE number 3919804