Systems and Methods for Searching Heterogeneous Indexes of Metadata and Tags in File Systems

• US 20170060941A1
• Filed: 08/25/2015
• Published: 03/02/2017
• Est. Priority Date: 08/25/2015
• Status: Abandoned Application

• Current Assignee: Futurewei Technologies Incorporated (Huawei Investment & Holding Co., Ltd.)
• Original Assignee: Futurewei Technologies Incorporated (Huawei Investment & Holding Co., Ltd.)
• Inventors: Yan, Ning, Morgan, Stephen
• Application Number:
  US14/835,399
• Publication Number:
  US 20170060941A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/13 File access structures, e.g. distributed indices arrangements of input from, or output to, record carriers G06F3/06
• CPC Class Codes: G06F 16/148 File search processing

Abstract

An apparatus for processing queries in a heterogeneous index. The apparatus comprises a receiver configured to receive a query from a user, wherein the query comprises at least one desired attribute of a desired file, and a processor coupled to the receiver and configured to search the heterogeneous index. The processor is configured to search the heterogeneous index by receiving the query from the receiver, testing a bloom filter of a storage partition in the heterogeneous index for existence of the desired attribute after receipt of the query, ignoring the storage partition and proceeding to a next storage partition in the heterogeneous index when the bloom filter indicates that the desired attribute is not present in the storage partition, and searching the storage partition to determine which one or more files of the storage partition have the desired attribute when the bloom filter indicates that the desired attribute is present in the storage partition.

Claims

1. An apparatus for processing queries in a heterogeneous index, comprising:

a receiver configured to receive a query from a user, wherein the query comprises at least one desired attribute of a desired file;

a processor coupled to the receiver and configured to search the heterogeneous index by;

receiving the query from the receiver;

testing a bloom filter of a storage partition that comprises a plurality of data structures comprising a k-dimensional tree (kd-tree) and a key-value store (kv-store) in the heterogeneous index for existence of the desired attribute after receipt of the query;

ignoring the storage partition and proceeding to a next storage partition in the heterogeneous index when the bloom filter indicates that the desired attribute is not present in the storage partition; and

searching the storage partition to determine which one or more files of the storage partition have the desired attribute when the bloom filter indicates that the desired attribute is present in the storage partition.

2. The apparatus of claim 1, wherein searching the storage partition to determine which of the one or more files have the desired attribute comprises searching the kd-tree prior to searching the kv-store.

3. The apparatus of claim 1, wherein searching the storage partition to determine which of the one or more files have the desired attribute comprises searching the kv-store prior to searching the kd-tree.

4. The apparatus of claim 1, wherein searching the storage partition to determine which of the one or more files have the desired attribute comprises searching the kd-tree and the kv-store substantially simultaneously.

5. The apparatus of claim 1, wherein searching the storage partition to determine which of the one or more files have the desired attribute comprises:

testing the kd-tree in the storage partition to determine whether the desired attribute is desired metadata when the bloom filter indicates that the desired attribute is present in the storage partition;

searching a kd-tree index in the storage partition to determine which of the one or more files of the storage partition have the desired metadata when the desired metadata is present in the kd-tree;

testing the key-value in the storage partition to determine whether the desired attribute is a desired tag when the desired attribute is not located in the kd-tree or after searching the kd-tree index;

searching a kv-store index in the storage partition to determine which of the one or more files of the storage partition have the desired tag when the desired tag is present in the kv-store;

testing the query to determine whether all of the desired attributes were found in the kd-tree or the kv-store when the desired attribute is not present in the kv-store or after searching the kv-store index;

scanning the storage partition for any of the one or more files containing the desired attributes when one or more of the desired attributes remain that were not found in the kd-tree or the kv-store; and

joining the search and scan functions results when any of the desired attributes of the query were found in two or more of the kd-tree or the kv-store or after scanning the storage partition.

6. The apparatus of claim 5, wherein one or more attributes are associated with each of the one or more files in the storage partition, and wherein the attributes comprise metadata or tags.

7. The apparatus of claim 6, wherein the tags are indexed in the storage partition and organized into categories, and wherein the storage partition comprises one kv-store for each tag category.

8. The apparatus of claim 6, wherein the metadata is dynamically added and indexed in the storage partition and organized into categories, and wherein the storage partition further comprises one kv-store for each dynamically added metadata category.

9. The apparatus of claim 6, wherein the storage partition comprises one kd-tree for indexing fixed categories of the metadata.

10. The apparatus of claim 5, wherein the query comprises at least two desired attributes comprising both metadata and tags.

11. The apparatus of claim 5, wherein the storage partition comprises one bloom filter for each category of attributes indexed in the partition.

12. A method for updating a heterogeneous search index for a storage partition comprising a plurality of data structures, comprising:

receiving an update message from a user, wherein the update message indicates an operation to be performed on the heterogeneous search index that comprises attributes comprising metadata and tags;

recording a log entry indicating receipt of the update message from the user;

determining the operation that is to be performed according to the update message;

updating the heterogeneous search index according to the update message; and

recording a log entry indicating that the update message received from the user was executed successfully.

13. The method of claim 12, wherein the storage partition comprises one or more files, a k-dimensional tree, one or more key-value stores, and a number of bloom filters equal to a number of categories of attributes that are indexed in the storage partition.

14. The method of claim 12, wherein updating the heterogeneous search index according to the update message comprises:

updating the attributes in the heterogeneous search index when a new file is inserted into the storage partition;

updating the attributes in the heterogeneous search index for a pre-existing file in the storage partition;

or

deleting the attributes from the heterogeneous search index for a file removed from the storage partition.

15. The method of claim 14, wherein updating the attributes in the heterogeneous search index when the new file is inserted into the storage partition comprises:

determining whether the new file is in a hash table of the storage partition;

treating the new file as the pre-existing file when it is determined that the new file is in the hash table of the storage partition;

determining whether the storage partition has space available for the new file when it is determined that the new file is not in the hash table;

using the storage partition as a current storage partition when it is determined that space is available in the storage partition for the new file;

creating a new storage partition when it is determined that space is not available in the storage partition for the new file;

setting the new storage partition as the current storage partition;

updating the hash table to indicate that the new file is located in the new storage partition; and

inserting index attributes into the current storage partition, updating bloom filters of the current storage partition, updating a k-dimensional tree of the current storage partition, and updating key-value stores of the current storage partition.

16. The method of claim 14, wherein updating the attributes in the heterogeneous search index for the pre-existing file in the storage partition comprises:

determining whether the pre-existing file is in a hash table of the storage partition;

treating the pre-existing file as a new file when it is determined that the pre-existing file is not in the hash table of the storage partition;

finding the pre-existing file in the storage partition when it is determined that the pre-existing file is in the hash table of the storage partition; and

inserting index attributes into the storage partition, updating bloom filters of the storage partition, updating a k-dimensional tree of the storage partition, and updating key-value stores of the storage partition.

17. The method of claim 14, wherein deleting attributes from the heterogeneous search index for the file removed from the storage partition comprises:

determining whether the file is in a hash table of the storage partition;

finding the storage partition in which the file is located when it is determined that the file is in the hash table of the storage partition;

deleting index attributes from the storage partition, updating bloom filters of the storage partition, updating a k-dimensional tree of the storage partition, and updating key-value stores of the storage partition; and

determining that the file cannot be found when it is determined that the file is not in the hash table of the storage partition.

18. The method of claim 14, wherein the attributes comprise metadata stored in a k-dimensional tree or tags stored in at least one key-value store.

19. The method of claim 12, wherein the log entries comprises a log-based backup of the heterogeneous search index.

20. A method of recovering from a system failure in a heterogeneous search index comprising:

entering a plurality of actions to be performed into a log at a time of receipt prior to execution of the actions, wherein the actions to be performed comprise at least two of;

updating a bloom filter of the heterogeneous search index that indicates an existence of a tag or metadata in the heterogeneous search index;

updating a k-dimensional tree of the heterogeneous search index; and

updating a key-value store of the heterogeneous search index; and

entering the actions performed into the log at a time of completion to indicate successful execution of a first of the actions and a progression to a second of the actions.

21. The method of claim 20, wherein recovering from the system failure comprises determining, according to the log, an action of the plurality of actions for which a log entry prior to execution exists without a corresponding log entry indicating successful execution.

22. The method of claim 21, wherein recovering from the system failure further comprises obtaining and executing all actions of the plurality of actions from a last log entry that indicates successful execution of a last performed action of the plurality of actions to a most recently received action of the plurality of actions.

23. The method of claim 20, wherein the method is implemented by a recovery manager in a distributed computing environment.