Pith. sign in

REVIEW

Random Access Concatenated Libraries and dd enable a short-latency high-content website on an inexpensive shared server

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2206.08127 v3 pith:I5APPEJO submitted 2022-06-14 cs.DB

Random Access Concatenated Libraries and dd enable a short-latency high-content website on an inexpensive shared server

classification cs.DB
keywords imagesmillionrecordsresourcescomputingconcatenatedcontent-richdatabase
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Content-rich websites typically house their images as individual files or as more costly binary database objects. Both methods place high demands on storage resources with commensurate high monetary cost. Inexpensive shared service accounts come with strict limits on disk and computing resources which prevent their use for hosting content-rich websites. To minimize the load on these limited resources, large numbers of images or other records may be concatenated into a single file and delivered with short latency independent of location within the file using Linux utility dd. This solution and its performance are presented for (a) a website which houses 8000+ genealogical reference books with more than 3.5 million 250-Kbyte page images, (b) a website-based database of 86 million death records, and (c) a cluster computing application which utilizes 800 neuroimaging databases, each with 1.5 million records. These disparate applications demonstrate the efficacy, scalability, and general utility of the solution.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.