Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

A. M. Katcher

dblp:55/6066 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1971
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 50% Electronic design automation · 50%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems
archival storage		 0.011971
Efficient Utilization of Limited Access Archival Storage in a Time Shared Environment · SIGIR 1971
Electronic design automation › hardware verification and test › test data compression
huffman coding		 0.011971
Efficient Utilization of Limited Access Archival Storage in a Time Shared Environment · SIGIR 1971
Operating systems › resource management › process management › multiprogramming
time-sharing systems		 0.011971
Efficient Utilization of Limited Access Archival Storage in a Time Shared Environment · SIGIR 1971

Methods — techniques the papers use, named apart from their topics

huffman coding · 0.0
YearPublicationVenuePosition
1971 Efficient Utilization of Limited Access Archival Storage in a Time Shared Environment
abstract
The public storage in any time sharing system tends to continually grow. This necessitates the implementation of certain measures to maintain public storage. One of these possibilities is creation of an archival level of storage called "migrated" storage. Data that have not been referenced recently are moved or "migrated" to a less accessible level of external storage. Since these data are not accessed by the users directly, i.e., the data must be restored to public storage before being used, a certain variable length coding technique, viz., Huffman Coding, is used to compact and store these data. The ideas presented have been implemented on a version of TSS/360 Time Sharing System and are presently being used in a real environment. The overall compaction rate achieved was 3. 16 to 1. Further details on compaction rates and timings are also presented.
A. M. Katcher
 SIGIR1