Hierarchical Attribute Search in File Systems
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing storage systems face inefficiencies in accessing and managing large volumes of attributes due to slow search times in relational databases, leading to underutilization and increased costs, management challenges, and reduced reliability.
Innovation Solution
Implementing a hierarchical structure for attributes within a file system, using an index to organize and search attributes along defined paths, and incorporating signatures for fast and efficient searches, with incremental updates to signatures when attributes change.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If attributes are stored in a relational database, then all attributes can be stored systematically, but search access becomes inefficient and slow when large numbers of attributes are stored
Solution Approach 1:
The patent segments the flat attribute space into hierarchical groups based on file system directory structures. Attributes are organized into parent-child relationships where parent directories contain child directories or files, allowing the search space to be divided into manageable segments that can be searched independently rather than scanning all attributes in a flat database.
Solution Approach 2:
The patent introduces a hierarchical dimension to the attribute storage structure by organizing attributes according to file system paths and directory trees. This transforms the traditional two-dimensional flat database structure into a multi-dimensional hierarchical structure, enabling searches to navigate through levels of the hierarchy rather than scanning all records linearly.
2Loss of information
If every record in the relational database is searched, then complete attribute information is retrieved, but access time increases significantly
Solution Approach 1:
The patent performs preliminary organization of attributes into hierarchical groups based on file system structure before searches are executed. Directory trees and path hierarchies are pre-established, allowing the search process to quickly navigate to relevant sections without having to examine all attributes. This preliminary structuring enables selective searching of only those attribute groups that match the search criteria.
Solution Approach 2:
The patent extracts and excludes irrelevant attributes from the search process by using hierarchical filtering. When a search is performed, the system identifies and retrieves only attributes from relevant directories and files matching the search criteria, while automatically excluding attributes from unrelated parts of the file system hierarchy, thus reducing the number of records that need to be examined.
3Productivity
If slow attribute access occurs, then storage system under-utilization results, but system costs and management complexity increase
Solution Approach 1:
The patent creates a universal hierarchical attribute organization structure that serves multiple functions simultaneously. The same hierarchical structure based on file system paths enables efficient searching, facilitates quick retrieval of attributes for any file or directory, and provides a consistent framework for managing attributes across the entire storage system, thereby improving utilization without proportionally increasing management complexity.
Data Source
AI summary
Example embodiments provide various techniques for fast and efficient search of attributes stored in data structures. The attributes are organized following a hierarchical structure of the file system and, in an example, the attributes are stored in a data structure where the hierarchical structure is maintained. As a result, a search within such data structure may follow one or more paths along the hierarchical structure of the file system. Attributes associated with directories and files outside of the path can be excluded from the search. Example embodiments also provide various techniques for updating signatures associated with the attributes. In an example, updates to the signatures can be made incrementally. For example, signatures can be updated when the attributes change.