A File Naming Scheme Using Hierarchical-Keywords
نویسندگان
چکیده
In this paper, we propose a file naming scheme, called HK (Hierarchical-Keyword-based) naming. In file systems, hierarchical naming has been used for these several decades. As the number of files stored in file systems increases, the weakness of hierarchical naming is getting recognized. Some researchers have proposed hybrid naming schemes which introduce attribute-based naming into hierarchical naming. However, they are unsatisfactory or too complicated. HK naming is a hybrid naming scheme which integrates hierarchical naming and attribute-based naming in a simple way. In HK naming, a file is named by a set of keywords and keywords are organized hierarchically. We point out the usefulness of HK naming by showing that it can solve problems which occur in practical usage of large file systems.
منابع مشابه
The Tilde File Naming Scheme
ABSTRACf Hierarchical directory systems permit users of a computer system to organize files into meaningful sets. A key part of the directory's usefulness lies in the way it partitions names. A hierarchical directory system supports short mnemonic names by keeping the names of files in one directory independent of those in other directories. Most hierarchical directory systems, which were desig...
متن کاملAn Experimental Implementation of the Tilde Naming System
The Tilde naming system identifres files in a distributed computing system in a novel way, providing a consistent mechanism for referencing both local and remote files that is independent of the details of the underlying computing environment. The Tilde naming system achieves this independence by providing each user with control of a private name evaluation environment. In contrast, several con...
متن کاملOntology-Based File Naming Through Hierarchical Conceptual Clustering
Current directory-based hierarchical file systems have many limitations as the amount of unstructured data possessed by individual user is increasing continuously. One of the most significant problems is that users usually have difficulties searching, navigating, and organizing their files since useful semantic information describing a file is not used in the current directory-based system. To ...
متن کاملClue Tables: A Distributed, Dynamic-Binding Naming Mechanism
This paper presents a distributed, dynamic naming mechanism called clue tables for building highly scalable, highly available distributed file systems. The clue tables naming mechanism is distinctive in three aspects. First, it is designed to cope well with the hierarchical structure of the modern large-scale computer networks. Second, it implicitlycarries out load balancing among servers to im...
متن کاملUsing dynamic sets to overcome high I/O latencies during search
In this paper we describe a single unifying abstraction called dynamic sets which can offer substantial benefits to search applications. These benefits include greater opportunity in the I/O subsystem to aggressively exploit prefetching and parallelism, as well as support for associative naming to complement the hierarchical naming in typical file systems. This paper motivates dynamic sets and ...
متن کامل