Patent application number | Description | Published |
20080307016 | STORAGE, ORGANIZATION AND SEARCHING OF DATA STORED ON A STORAGE MEDIUM - Methods and apparatuses for storing, organizing and searching files stored in a storage device. Backup files may be stored in snapshot-dependent and/or snapshot-independent paths. The backup files may be stored with additional attributes that can be used for searching and/or indexing purposes. | 12-11-2008 |
20080307017 | Searching and Restoring of Backups - Methods, systems, and apparatus, including computer program products, for searching for and presenting backups. A first search result including a first version of an item is presented. The first version is associated with a first date range having a first start date and a first end date. User input requesting that an archive including one or more versions of the item be searched is received. A second search result including a second version of the item is presented. The second version is different from the first version. The second version is associated with a second date range having a second start date and a second end date. The second date range does not overlap with the first date range. | 12-11-2008 |
20110113052 | QUERY RESULT ITERATION FOR MULTIPLE QUERIES - Systems and methods for processing an inverted index are described. Multiple queries against the same inverted index are merged into merged query of unique nodes. The unique nodes are used to create a unified document set from which query result iteration is performed to eliminate redundancies and/or inefficiencies in processing the multiple queries separately. The merged query result is separated into the results for each of the multiple queries and returned to the respective originators of the queries. The unified document set can be limited to postings lists found in a single pulse of the inverted index to improve performance. Index updates can be applied to the merged query result to provide efficient and up to date query results. | 05-12-2011 |
20140359505 | TAGGED MANAGEMENT OF STORED ITEMS - In one embodiment, non-transitory computer-readable medium stores instructions for implementing tagged management of stored items, wherein an embodiment can receive an input indicating the selection of a graphical representation of a file in the GUI of an operating system, and can also receive an input indicating the intent to attach a tag to the file. The system can perform an automatic search through the metadata of files associated with the user and the user account to find the set of files having the tag, responsive to the request to display the set of files. Having located the set of files, an operation can be performed to display the set of files having the requested tag, regardless of the storage location of the files. | 12-04-2014 |
20140365479 | Searching and Restoring of Backups - Methods, systems, and apparatus, including computer program products, for searching for and presenting backups. A first search result including a first version of an item is presented. The first version is associated with a first date range having a first start date and a first end date. User input requesting that an archive including one or more versions of the item be searched is received. A second search result including a second version of the item is presented. The second version is different from the first version. The second version is associated with a second date range having a second start date and a second end date. The second date range does not overlap with the first date range. | 12-11-2014 |
Patent application number | Description | Published |
20120179689 | DIRECTORY TREE SEARCH - Directory tree searching uses a path index to determine a set of documents tor a directory path portion of a search query. The set of documents for the directory path portion is evaluated with a set of document for an indexed term portion of the search query to determine common documents. | 07-12-2012 |
20130073559 | Methods for Indexing and Searching Based on Language Locale - In response to a search query having a search term received from a client, a current language locale is determined. A state machine is built based on the current language locale, where the state machine includes one or more nodes to represent variance of the search term having identical meaning of the search term. Each node of the state machine is traversed to identify one or more postings lists of an inverted index corresponding to each node of the state machine. One or more item identifiers obtained from the one or more postings list are returned to the client, where the item identifiers identify one or more files that contain the variance of the search term represented by the state machine. | 03-21-2013 |
20130159315 | METHODS FOR PREFIX INDEXING - According to one aspect of the invention, in response to one or more terms to be indexed, each of the terms is indexed in a regular index. In addition, for each of the terms having multiple characters, at least one prefix portion of the term is indexed in a prefix index, where the regular index is used for regular searches and the prefix index is used for prefix searches without having to combine a plurality of postings lists of the regular index at the point in time. | 06-20-2013 |
20130246365 | METHODS AND SYSTEMS FOR SEARCHING A BACKUP VOLUME - Methods and systems for searching a backup volume use, in one embodiment, a move marker file to indicate attributes for a new name space and optionally indicate attributes for a prior name space of a directory on a source volume, the directory having been moved between backup snapshot operations in which data on the source volume is backed up to the backup volume. Other embodiments are also described. | 09-19-2013 |
20140108416 | INDEXING USING A LOCKLESS BURST TRIE - Lockless burst trie indexing inserts marker nodes into a linked list of data and marker nodes, each marker node corresponding to a symbol in an ordered data sequence stored in the data nodes. A trie structure contains entries that represent the symbols of the marker nodes and point to the corresponding marker nodes. The trie structure can contain multiple levels of entries that are linked together in a hierarchy to represent subsets of the data sequences. | 04-17-2014 |
20140358902 | FACETED SEARCH RESULTS - A data processing system receives a first user input comprising a search query. The data processing system displays in a search interface accessible across a plurality of computer application programs, a plurality of results matching the search query. The results are categorized into a plurality of categories and only a first subset of all results are displayed for each of the plurality of categories. The data processing system receives a second user input comprising a selection of one of the plurality of categories. In response to the second user input, the data processing system displays, in the search interface, a second subset of results, wherein the second subset is categorized into one or more subcategories of the selected category. | 12-04-2014 |