1 resultado para Archdiocese Archive in Gniezno
em Universitätsbibliothek Kassel, Universität Kassel, Germany
Filtro por publicador
- Aberystwyth University Repository - Reino Unido (2)
- Adam Mickiewicz University Repository (2)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (10)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Andina Digital - Repositorio UASB-Digital - Universidade Andina Simón Bolívar (1)
- Aquatic Commons (4)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (4)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (3)
- Biblioteca Digital de la Universidad Católica Argentina (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (62)
- Boston College Law School, Boston College (BC), United States (1)
- Boston University Digital Common (78)
- Brock University, Canada (4)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (3)
- Cambridge University Engineering Department Publications Database (4)
- CentAUR: Central Archive University of Reading - UK (38)
- Center for Jewish History Digital Collections (10)
- Central European University - Research Support Scheme (90)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (85)
- Collection Of Biostatistics Research Archive (79)
- CORA - Cork Open Research Archive - University College Cork - Ireland (2)
- Dalarna University College Electronic Archive (1)
- Deakin Research Online - Australia (71)
- Digital Commons - Michigan Tech (1)
- Digital Peer Publishing (62)
- DigitalCommons@The Texas Medical Center (2)
- Digitale Sammlungen - Goethe-Universität Frankfurt am Main (3)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (2)
- Greenwich Academic Literature Archive - UK (8)
- Harvard University (2)
- Helda - Digital Repository of University of Helsinki (4)
- Indian Institute of Science - Bangalore - Índia (8)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (2)
- Portal de Revistas Científicas Complutenses - Espanha (5)
- Publishing Network for Geoscientific & Environmental Data (41)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (48)
- Queensland University of Technology - ePrints Archive (82)
- Repositório Científico da Universidade de Évora - Portugal (2)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório Institucional da Universidade de Brasília (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (110)
- Royal College of Art Research Repository - Uninet Kingdom (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (4)
- Universidad del Rosario, Colombia (1)
- Universidade de Lisboa - Repositório Aberto (2)
- Universitat de Girona, Spain (2)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Montréal (1)
- Université de Montréal, Canada (9)
- University of Michigan (8)
- University of Southampton, United Kingdom (2)
- University of Washington (1)
- WestminsterResearch - UK (4)
- Worcester Research and Publications - Worcester Research and Publications - UK (1)
Resumo:
Presentation given at the Al-Azhar Engineering First Conference, AEC’89, Dec. 9-12 1989, Cairo, Egypt. The paper presented at AEC'89 suggests an infinite storage scheme divided into one volume which is online and an arbitrary number of off-line volumes arranged into a linear chain which hold records which haven't been accessed recently. The online volume holds the records in sorted order (e.g. as a B-tree) and contains shortest prefixes of keys of records already pushed offline. As new records enter, older ones are retired to the first volume which is going offline next. Statistical arguments are given for the rate at which an off-line volume needs to be fetched to reload a record which had been retired before. The rate depends on the distribution of access probabilities as a function of time. Applications are medical records, production records or other data which need to be kept for a long time for legal reasons.