| Zugriffsnummer | 39074 |
| Dokumenttyp | Konferenzartikel in Zeitschrift |
| Peer Review | mit Peer Review |
| Sprache | Englisch |
| Titel | FLOUDS: A succinct file system structure |
| Autor(in); Institution |
Peters, Daniel; 8.5, Metrologische Informationstechnik, PTB-Berlin
Fischer, Johannes; Department of Computer Science, TU, Dortmund, GERMANY
Thiel, Florian; 8.5, Metrologische Informationstechnik, PTB-Berlin
Seifert, Jean-Pierre; Security in Telecommunications, TU-Berlin, Berlin, GERMANY
|
| Quelle/Jahr | Position Papers of the 2017 Federated Conference on Computer Science and Information Systems. Annals of Computer Science and Information Systems: 12 (2017), 51 - 57 |
| ISSN | 2300-5963 |
| ISBN | 978-83-946253-7-5 (online) ; 978-83-946253-8-2 (USB) |
| DOI | |
| Verlag | Warsaw: Polish Information Processing Society |
| Konferenzangaben | Federated Conference on Computer Science and Information Systems (FedCSIS), Prague, 3-6, September, 2017, Czech Republic |
| Freie Schlagworte | LOUDS ; WELMEC 7.2 ; file system ; succinct data structure |
| Zusammenfassung | To spot malicious manipulation, remote attestation and maintenance for devices that are under legal control is very important. One example are measuring instruments, where the manufacturer and the market surveillance want to check if system integrity is preserved. In Europe, legal requirements state that a software identifier needs to be supplied/output by the device, which is often just a checksum over the files that are considered to be legally relevant for the measuring purpose. As measuring instruments and also other legally monitored devices are often small embedded systems, the need for a fast algorithm arises that creates a small file system list containing as much information as possible. In this paper, a new file system structure called FLOUDS is explained that fulfills these requirements. The FLOUDS uses theoretical optimal space to represent the file system structure, while it, nevertheless, enables fast file searches by names and also properties. For example, all files of a specific file type, e.g., pictures, movies, executables, etc., can be listed in O(p lg n) time, where p is the number of files of the specific file type searched for, and, where n represents the total number of file types in the system. |
| Kostenfreier Zugang | Open Access Gold |