Abstract: A file directory tree structure of a selected storage snapshot is dynamically divided into different portions. A plurality of the different file directory tree structure portions are analyzed in parallel to identify any changes of the selected storage snapshot from a previous storage snapshot. To analyze each of the plurality of the different file directory tree structure portions, a processor is further configured to traverse and compare a corresponding file directory tree structure portion of the selected storage snapshot with a corresponding portion of a file directory tree structure of the previous storage snapshot while at least another one of the plurality of the different file directory tree structure portions of the selected storage snapshot is being analyzed in parallel.

Abstract: Techniques for processing composite commands in a file system are disclosed. A file system receives a composite command that includes an argument. The file system parses the argument and encounters a particular flag indicating that the argument includes an additional command. The file system executes the additional command using an application programming interface (API).

Abstract: Embodiments of the present disclosure relate to methods, systems, and computer program products for storage management. In one embodiment, a computer-implemented method is disclosed. According to the method, in response to receiving a request related to managing the at least one directory entry in the file system, at least one directory entry in a file system may be determined by a file system in a storage system, where each of the at least one directory entry is represented by digital numbers. An index for each of the at least one directory entry may be managed in the file system by the file system, where an index key for the index comprises the digital numbers themselves. In other embodiments, a computer-implemented system and a computer program product for managing the index are disclosed.

Abstract: A method begins by a processing module of a dispersed storage network (DSN) receiving a write request from a user to store encoded data slices and identifying a plurality of memory devices associated with the user. The method continues with the processing module selecting one or more memory devices based on whether the memory devices are read memory devices, write memory devices or read/write memory devices. The processing module then stores the encoded data slices in the selected memory devices and upon receiving a read request for the encoded data slices determines whether the encoded data slices have been consolidated in one or more read memories and when the encoded data slices have not been consolidated in one or more read memories, recovers the encoded data slices from one or more write memories of the plurality of memory devices.

Abstract: Techniques for adding a directory entry to an existing directory data structure maintained by a storage system for storing a plurality of directory entries are provided. A first storage index block is used for storing a pointer to a first hash value from among a plurality of hash values. A second storage index block is allocated when the first storage index block has reached a threshold level for storing pointers to hash values for the plurality of directory entries. A group of pointers including a pointer to a second hash value from among the plurality of hash values is selected. The group of pointers is stored in the second storage index block with a pointer to a third hash value from among the plurality of hash values such that the directory entry can be searched using the plurality of hash values.

Abstract: A system and method for efficient data storage, which reduces data entropy of data on a data storage device. The technique organizes related data entities (such as files on a hard drive) in close physical proximity and in a predictive or ordered sequence, to reduce the amount of time and effort (mechanical, computational, or otherwise) a storage/retrieval device needs to expend locating each data related entity as it processes a sequence of requests. In addition, the data may be organized and stored according to a file directory index structure, whereby file fragmentation is reduced.

Abstract: Overflow access records (OARs) are managed in a database system. An OAR is created in response to receiving an update command for a data record and to the updated data record generated by the update command not fitting onto the page in the table where the data record was stored. The OAR that is created includes an index counter that indicates a number of indexes associated with the table. When an OAR is accessed in response to a query command, an identifier of the accessed OAR is replaced in the index by an identifier of a data record pointed to by the OAR, and the index counter in the accessed OAR is changed by a predefined amount. When the index counter reaches a predefined value, the accessed OAR is removed from the table.

Abstract: A system and method for efficient data storage, which reduces data entropy of data on a data storage device. The technique organizes related data entities (such as files on a hard drive) in close physical proximity and in a predictive or ordered sequence, to reduce the amount of time and effort (mechanical, computational, or otherwise) a storage/retrieval device needs to expend locating each related data entity as it processes a sequence of requests. In addition, the data may be organized and stored according to a file directory index structure, whereby file fragmentation is reduced.

Abstract: Methods, systems, and user interfaces for accessing, retrieving, storing, and presenting information stored in computer readable media. Information stored on a computer readable media may be searched using selectable items representing an index of information. In response to selection of one of the selectable items, information is presented which is related to the selected item, concurrently with display of the index and at least one least one previously-selected item in a hierarchical display. The invention has particular application to the legal field, but is also applicable to other fields, e.g., accounting, medicine, business and finance, engineering, scientific fields, merchandising fields, fulfillment fields, inventory fields, etc.

Abstract: A file scan process is carried out, in parallel in a distributed manner, on a file server for which indices have been created once, to create a list of added, changed, or updated files. A file list of indexed scan target files is created by a distributed processing server. Directory URLs of the scan target files are acquired from the file list and analyzed to count a number of directories in each layer and determine a division unit for division of a scan process to be carried out on the scan target directories, based on a result of the counting.

Abstract: The present invention is to support the retrieval of an ambiguous file stored on a computer. Desktop space images are generated at predetermined time intervals, and metadata for each desktop space image is created from internally used data and externally input data existing at the time. The metadata consists of multiple pieces of tag data, and part of tag data is a target file to be searched for. Upon searching for the target file, a user selects a desktop space image that evokes the target file from among the multiple desktop space images initially displayed. The selected desktop space image is displayed and the target file is selected from the metadata associated with the desktop space image displayed. The desktop space image can refresh a user's recollection about the target file, and hence allows the user to narrow down the scope of search.

Abstract: Machine implemented method and system for adding a directory entry to an existing directory data structure maintained by a storage system for storing a plurality of directory entries are provided. A first level storage block is used for storing a pointer to a first hash value from among a plurality of hash values. A new third level storage block is allocated when a second level storage block has reached a threshold level for storing pointers to hash values for the plurality of directory entries. A group of pointers including a pointer to a second hash value from among the plurality of hash values is selected. The group of pointers is stored in the third level storage block with a pointer to a third hash value from among the plurality of hash values such that the directory entry can be searched using the plurality of hash values.

Abstract: A file list generation device creates, at high speed, a list of added, changed, or deleted file data by acquiring the directory URLs of search target files from a first storage, counting the number of directories in each layer through analysis of the directory URLs, and, based on the result of the counting, determines a dividing policy to divide a scan target directory scanning operation, which is to be performed with a distributed server cluster. Directories of the search target files are divided in accordance with the determined dividing policy, and a snapshot of a current directory tree is acquired.

Abstract: A method of managing backup data. The method includes accessing, via a backup manager, index data of an initial snapshot and accessing, via the backup manager, index data of a subsequent snapshot. The method further includes determining, via the backup manager, whether the index data of the subsequent snapshot is different from the index data of the initial snapshot. Responsive to a determination that the index data of the subsequent snapshot is different from the index data of the initial snapshot, creating an updated index data and creating an updated snapshot with the updated index data.

Abstract: Some implementations provide techniques and arrangements to aggregate data from multiple issuers. An aggregator server may receive data associated with a user from an issuer. The data may include an issuer identifier associated with the issuer, account access data associated with the user, and a storage location identifier. The aggregator server may authenticate an identity of the issuer based on the issuer identifier and determine whether the issuer is authorized to provide the data for the user. In response to determining that the issuer is authorized to provide the data for the user, he aggregator server may identify an account associated with the user based on the account access data and store the data in the account associated with the user based at least partially on the storage location identifier.

Abstract: One example embodiment includes a method for constructing a unified namespace carried out by a domain manager service executing on a domain node in a domain network comprised of domain nodes. The method includes establishing a single, hierarchical domain tree that encompasses digital computers in a distributed data service network, where the domain manager service sends a request to all domain member nodes requesting that each domain node export the root of its sub-domain to the domain manager. The method also includes receiving the exported sub-domain roots. The method further includes grafting onto a domain root of the domain manager service the received exported sub-domain roots.

Abstract: Systems and methods for a dynamic visual search engine are provided. In one example method, a criteria used to partition a set of compressed image descriptors into multiple database shards may be determined. Additionally, a size of a dynamic index may be determined. The dynamic index may represent a dynamic number of images and may be configured to accept insertion of reference images into the dynamic index that can be search against immediately. According to the method, an instruction to merge the uncompressed image descriptors of the dynamic index into the database shards of the compressed image descriptors may be received, and the uncompressed image descriptors of the dynamic index may be responsively merged into the database shards of the compressed image descriptors based on the criteria.

Abstract: Method and system for application isolation is provided. A computing system executes a plurality of processor executable applications and each application is assigned an address by an adapter that is operationally coupled to the computing system. The adapter also assigns a unique identifier to each construct generated by the plurality of applications; maintains a data structure associating the address with the unique identifier assigned to each construct; receives a request having an address and a unique identifier from an application from among the plurality of applications; retrieves the address and the unique identifier from the request; compares the retrieved address and the unique identifier with information maintained by the data structure; and processes the request if the retrieved address and the unique identifier matches with information of the data structure.

Abstract: Systems and methods are provided for automatically sorting and indexing electronic files. A set of emails is received from a folder for an email program. A set of nouns from a first email from the set of emails is identified, wherein the first email comprises a document attached to the first email, and wherein the set of nouns are identified from the first email, the document attached to the first email, or both. The set of nouns are sorted alphabetically. A file structure is created on a storage device for storing data from the set of emails. The file structure includes a first folder with a same name as the folder for the email program, and a second folder with a name comprising the sorted set of nouns. The document attached to the first email is stored in the second folder.

Abstract: A device for managing a plurality of measurement data, each measurement data representing a value of a physical parameter, the device comprising a file database adapted for storing the plurality of measurement data in the form of data files each of which being assigned to a specific measurement, a relational database adapted for storing at least a part of the plurality of measurement data in the form of relational data being structured in accordance with individual measurement parameters assigned to different measurements, and a processing unit adapted for extracting the relational data from the data files.

Abstract: Various methods and systems for securing access to hash-based storage systems are disclosed. One method involves receiving information to be stored in a storage system from a storage system client and then generating a key. The key identifies the information to be stored. The value of the key is dependent upon a secret value, which is associated with the storage system. The key is generated, at least in part, by applying a hash algorithm to the information to be stored. The key can then be returned the key to the storage system client. The storage system client can then use the key to retrieve the stored information.

Abstract: Methods and systems are disclosed for naming methodologies for a hierarchical system. In one embodiment, a computer implemented method of organizing instance names in a hierarchical system includes receiving a description of a hierarchical system that includes plurality of instances arranged in different branches in a plurality of hierarchical levels in a physical data structure, creating an instance name data structure configured to describe the corresponding instances in the hierarchical system, where the instance name data structure comprises a map of indexes and a corresponding array of offsets configured to access naming information in a subsequent level, and associating names of instances in the hierarchical system to a corresponding set of unique integers which are arranged in a sequential manner.

Abstract: An identification information acquisition unit acquires identification information for identifying recording information to be recorded or read. A prime number acquisition unit acquires a prime number corresponding to the identification information among prime numbers having the same number of digits. A computation unit computes the sum of all of the digits of the identification information, the sum being the sum of the products obtained by multiplying the values of each digit of the identification information by the difference obtained by subtracting the differences corresponding to the digits from the acquired prime number. A path determination unit determines a path indicating the directory, where the recording information is stored, from the sum. This method can be applied to an NFS (Network File System).

Abstract: When a list of file names is to be displayed on a display device, a comparison is made between a necessary display width of each of the file names and a width of a display area of the display device. For each of the file names having a necessary display width greater than the width of the display area, it is checked whether the file name contains a particular character string portion of a predetermined type, and, if so, the file name is displayed in the list in a partly-omitted display style where a leading end portion, particular character string portion and extension of the file name are left in the list with the other part of the character string omitted. The particular character string portion can function as an important element for identifying the data item in question.

Abstract: A computing device includes an interface, memory, and a processing module. The memory stores a directory and inode tables. The directory stores a file identifier and a corresponding inumber for each file that is stored in storage units. An inode table stores an inumber, metadata, and a DSN address for each file stored in a corresponding storage unit. The processing module is operable to monitor, for each of the inode tables, utilization of the memory. The processing module is further operable to monitor, for each of the storage units, utilization of memory of the storage units. The processing module is further operable to process, for the inode table and/or the corresponding storage unit, per inode table memory utilization data and per storage unit memory utilization data to adjust memory utilization of the inode table and/or memory utilization of the corresponding storage unit.

Abstract: A system includes a storage subsystem having a data area and a header area. The data area is for storing contents of at least one data file, and the header area is for storing access parameters and status information for accessing each data file individually. The data area and the header area define a storage area in the storage subsystem. Multiple files are efficiently managed based on utilization of the storage area in the storage subsystem.

Abstract: The present invention discloses a method and apparatus for storing node, pertaining to the field of the Internet communications. The method includes: receiving a write operation request and a node from a client; storing the node in a memory and setting the update time of the node as the time of receiving the node; and relocating one or more nodes from the memory to a file according to the update time of each of the nodes in the memory. The apparatus includes: a receiving module, a storage module, and a relocating module. The present invention can reduce the frequency of loading and relocating nodes to and from a memory, and improve performance of a server.

Abstract: Embodiments are directed towards managing within a cluster environment having a plurality of indexers for data storage using redundancy the data being managed using a generation identifier, such that a primary indexer is designated for a given generation of data. When a master device for the cluster fails, data may continue to be stored using redundancy, and data searches performed may still be performed.

Abstract: A directory operational block data structure is provided by a processor within a memory. The directory operational block data structure allows configuration of a directory of a file system, at an operating-system level, with at least one executable program to be executed in response to configurable operating-system level directory events associated with the directory. A first program is attached within the directory operational block data structure to execute in response to a specified directory event. The attached first program is executed at the operating-system level in response to detection of the specified directory event.

Abstract: The invention is a system of managing indexation of memory. Said system has a microprocessor, and a flash memory. Said flash memory has an indexed area comprising indexed items, and an index that is structured in a plurality of index areas comprising a plurality of entries. Said flash memory comprises an index summary comprising a plurality of elements. Each index summary element is linked to an index area of said index. Each index summary element is built from all entries belonging to said linked index area and is built using k hash functions, with 1?k.

Abstract: Embodiments of the present invention provide a system and method of assigning unique identifiers in a multi-master directory service. In particular, each server in the system assigns numeric user identifiers in a linear fashion that compliments the series of user identifiers assigned by the other servers. In particular, a first server is selected and assigned a first starting number. Each subsequent server is then assigned their own starting series number by incrementing from the first starting number. Then, all servers are assigned an additive, which is an integer greater than or equal to the number of servers in the system. Each server then generates its own series of unique numeric identifiers based on its own starting series number and the additive.

Abstract: Method and system to search for data objects are provided. The method comprises generating an attribute index and a content index. The attribute index comprises entries associated with respective access control information for a set of data objects and generating. The content index comprises words from the set of data objects. A search query directed at the set of data objects is processed by searching the content index, searching the attribute index, and obtaining a search result based on the results of searching of the content index and the attribute index.

Abstract: A method is performed by a device of a group of devices in a distributed data replication system. The method includes storing an index of objects in the distributed data replication system, the index being replicated while the objects are stored locally by the plurality of devices in the distributed data replication system. The method also includes conducting a scan of at least a portion of the index and identifying a redundant replica(s) of the at least one of the objects based on the scan of the index. The method further includes de-duplicating the redundant replica(s), and updating the index to reflect the status of the redundant replica.

Abstract: A computer-implemented method is disclosed. The method may include receiving a portion of a personal name and converting the portion to a normalized portion by reducing the one or more characters to their simplest equivalents. The method may further include searching a typographical index tree and a phonetic index tree to identify one or more keys matching the normalized portion. The method may further include compiling, ranking, and presenting a plurality of suggested matches identified during the searching.

Abstract: An object display apparatus displays a plurality of object at respective display positions, and receive a designation to set one of the plurality of displayed object as an object of interest. Upon reception of an addition or deletion instruction of one or more objects with respect to the plurality of displayed objects, a display of the objects is updated by moving object other than the object of interest while keeping the display position of the designated object of interest.

Abstract: A deduplicated data storage system provides high performance storage to heterogeneous clients that connect to it via a communications network. The deduplicated data storage system provides fast access to deduplication data by caching the most frequently accessed deduplication data in a hyperindex. Updates to the non-cached deduplication data are serialized by use of a store queue and hold queue.

Abstract: An image storage processing apparatus includes an image acquisition means for acquiring taken image data imaged at an imaging apparatus unit, a bio-information acquisition means for acquiring bio-information of a user of the imaging apparatus unit at the time of imaging the taken image data acquired by the image acquisition means, a subject information acquisition means for acquiring subject information as an image analysis result of the taken image data acquired by the image acquisition means and a storage processing means for performing processing of recording the taken image data acquired by the image acquisition means, the bio-information acquired by the bio-information acquisition means and the subject information acquired by the subject information acquisition means in a recording medium in a state in which they are associated with one another.

Abstract: According to one embodiment, a storage device includes an interface, a first and second memory blocks and a controller. The interface receives a content search request. The first memory block stores files and inverted files corresponding to contents included in the files. The second memory block stores a file search table. The controller creates the inverted file for each content included in the files and stores IDs of the files including the content in the inverted file. The controller obtains, by search of the content, a corresponding inverted file from the inverted files stored in the first memory block and stores, in the file search table, the IDs of the files included in the obtained inverted file. The controller outputs the IDs of the files stored in the file search table from the interface as a search result for the content search request.

Abstract: The present embodiments provide methods, apparatuses, and systems for use in providing updating content to be played back in cooperation with a portable processor readable medium. Some of these methods receive, over a network and from a remote source, updated content to be accessed in association with a processor readable portable storage medium; receive, over the network from the remote source, in association with the received updated content a designation that the updated content is to be associated with a first placeholder title as defined in an index table being implemented in association with playback in association with the portable storage medium; and store the updated content, on a separate processor readable storage medium that is different than the portable storage medium, such that the updated content is associated with the first placeholder title and accessible in association with the first placeholder title as dictated by the index table.

Abstract: Disclosed herein are methods, systems, and computer program products for managing data within a file system. In embodiments, the method includes determining the location of data within a file to be modified, modifying the data within the file, and adjusting a pointer to point to the data block containing the modified data. The data within a file may be modified by deleting data from the file or inserting new data into the file. New data may be inserted into a file by writing the data into new data blocks and then adjusting the pointers to point to the location of the new data blocks. An example method may also include determining whether data blocks are incomplete blocks and identifying the incomplete blocks by negating the value of the pointers to those blocks.

Abstract: A method and data structure for improving the utility of graphics compositions is disclosed. In one embodiment, composition files are created through the connection of patches in a composition editor. Automatically included with the created composition file is protocol information. Preferably such protocol information is included as metadata in the header of the composition file, and can be constructed in any suitable fashion. So constructed, composition files can be grouped together in a physical or virtual repository accessible to other application programs. Another user can then pick an appropriate composition for a new project based on review and filtering of the protocols as contained in the header information of the repositoried composition files. Such review and filtering can be accomplished using a composition picker user interface in the user's application program. The repository can then be queried for composition files matching or otherwise compatible with the specified protocol.

Abstract: Method for attaching one or more tables online to a range partitioned table, includes: starting a child transaction; obtaining an exclusive lock on a source table; obtaining an intent exclusive lock on a target table; soft invalidating queries on the target table where compiled form of queries are cached for reuse; attaching the source table(s) to the target table as a new partition(s) of the target table; modifying indices and table structure of the target table to reflect the attaching of the new partition; committing the child transaction; and releasing the exclusive lock and the intent exclusive lock, where concurrently running queries over the target table continue to run without considering the partition until the intent exclusive lock and the exclusive lock are released. Queries on the target table only consider existing partitions when the attaching is in progress. The new partition is available once the attach operation is complete.

Abstract: Methods, apparatus, and programming recorded in machine readable memory are provided for the index, search and retrieval of objects on a global network. This inventive system embeds a distributed index in a routing layer to enable fast search. The method provides dynamic insertion, lookup, retrieval, and deletion of participating nodes, objects and associated metadata in a completely decentralized fashion. Nodes can dynamically join and leave the network. This infrastructure can be applied to content networks for publishing, searching, downloading, and streaming.

Abstract: Methods and systems are described for determining candidates for a custom index in a multi-tenant database environment. In one embodiment, a method includes, capturing a query that is directed to a multi-tenant database, determining whether the captured query is a candidate for an additional filter, determining operators used by the captured query if the query is a candidate, determining data types of the database used by the captured query if the query is a candidate, determining whether there is a current filter for the operator and data types used by the captured query if the query is a candidate, selecting the captured query based on the determined operators, data types, and the determined current filters, and generating a custom index for the selected query.

Abstract: Aspects of invention may allow an operator to recognize that a search corresponding to search conditions set in a search folder does not function when such case occurs. In one embodiment, an information processing apparatus may include a search unit that conducts a search that corresponds to each of one or a plurality of search conditions set in a search folder, and searches for at least one folder element of the search folder. The apparatus also includes a search status confirmation unit that confirms the search status for each search condition in the search unit, and a folder-content display unit (e.g., search folder display unit) that displays, when the search status confirmation unit confirms that the search corresponding to the one or plurality of search conditions set in the search folder does not function, information indicating a malfunction.

Abstract: In a screen for displaying thumbnail images, a background image is displayed on an entire portion of a specific area, translucent lanes are displayed on the background, and thumbnail images are displayed on a lane located in the center of the screen. When a mouse pointer is put on a lane on the right side of the lane located in the center, a symbol image that is arranged on the right side of a symbol image corresponding to the thumbnail images on a place map screen, and a file name of the symbol image are displayed on the lane that is specified by the mouse pointer.

Abstract: Some aspects include determination of second document identifiers added to a search index. The search index associates each of a plurality of words with at least one of a plurality of first document identifiers. For each of the second document identifiers, metadata of a document identified by the second document identifier is added to a content store storing metadata of each document identified by the plurality of first document identifiers. In some aspects, the content store comprises at least one flat file, and the metadata is appended to an end of one or more of the at least one flat file.

Abstract: In general, the subject matter described in this specification can be embodied in methods, systems, and program products for importing objects. A computer system processes structured electronic documents that define objects to be imported into a database in multiple phases. In a first phase, the computer system analyzes the structured electronic documents to determine whether the objects to be imported are related to one or more other objects that have yet to be stored in the database. If so, the computer system generates contextual information that defines the relationships between the objects. In a second phase, the computer system establishes relationships in the database between related objects using the contextual information.

Abstract: A file list generation device creates, at high speed, a list of added, changed, or deleted file data by acquiring the directory URLs of search target files from a first storage, counting the number of directories in each layer through analysis of the directory URLs, and, based on the result of the counting, determines a dividing policy to divide a scan target directory scanning operation, which is to be performed with a distributed server cluster. Directories of the search target files are divided in accordance with the determined dividing policy, and a snapshot of a current directory tree is acquired.

Abstract: A file scan process is carried out, in parallel in a distributed manner, on a file server for which indices have been created once, to create a list of added, changed, or updated files. A file list of indexed scan target files is created by a distributed processing server. Directory URLs of the scan target files are acquired from the file list and analyzed to count a number of directories in each layer and determine a division unit for division of a scan process to be carried out on the scan target directories, based on a result of the counting.