Abstract: Initial items can be partitioned into a plurality of partitions. The partitions can be stored in a partitioned list in computer storage. An index to the partitions can be generated. One or more initial items can be invalidated, and additional items can be appended to the partitioned list in a storage space previously occupied by the invalidated initial items. The index can be updated to omit references to the invalidated items, and to include references to the additional items. Also, a slice of an application call tree can be generated from a partition loaded into memory from a log. A representation of the slice can be displayed on a computer display, even before the entire application call tree is generated from the log.

Abstract: An ordering of operations in log records includes: performing update operations on a database object by a node; writing log records for the update operations into a local buffer by the node, the log records each including a local virtual timestamp; determining that a log flush to write the log records in the local buffer to a persistent storage is to be performed; in response, sending a request from the node to a log flush sequence server for a log flush sequence number; receiving the log flush sequence number by the node; inserting the log flush sequence number into the log records in the local buffer; and performing the log flush to write the log records in the local buffer to the persistent storage, where the log records written to the persistent storage comprises the local virtual timestamps and the log flush sequence number.

Abstract: A mechanism is used to improve the efficiency of performing resource-to-path resolution. A hierarchical link structure contains entries and/or records (“link entries”) that each defines a parent-child link within an information hierarchy. A certain linking entry may have data that refers to another link entry representing a link to the parent—a link in which the parent is a child. This data allows resource-to-path resolutions to be performed more efficiently.

Abstract: A hierarchical data server provides a query and storage system for hierarchical data with three interfaces that are, data interface for accepting hierarchical data, query interface for accepting a query, and result interface for returning output of the query. The system models hierarchical data with one data object called data vine and one data structure type called data vine list. A data vine includes a name, a property list, and a child list. A data vine list is an ordered list of data vines. A data vine is recursively defined with its child list as a data vine list. The system introduces five basic operators, cast, restrict, unique, sort, and traverse. Each operator acts on one data vine list and returns another data vine list. A property list in a data vine is unordered with set operations implemented, which include default operation, update operation, elimination operation, replacement operation, and intersection operation.

Abstract: Embodiments provide methods and systems for encoding and decoding variable-length data, which may include methods for encoding and decoding search engine posting lists. Embodiments may include different encoding formats including group unary, packed unary, and/or packed binary formats. Some embodiments may utilize single instruction multiple data (SIMD) instructions that may perform a parallel shuffle operation on encoded data as part of the decoding processes. Some embodiments may utilize lookup tables to determine shuffle sequences and/or masks and/or shifts to be utilized in the decoding processes. Some embodiments may utilize hybrid formats.

Abstract: Techniques to perform an incremental backup of a large-scale distributed database, such as a massively parallel processing (MPP) database, are disclosed. In various embodiments, a set of table partitions each of which satisfies one or more criteria to be included in a current incremental backup is determined at backup time, at least in part by comparing a current table partition meta-information with corresponding meta-information from a prior backup. The table partitions in the set are included in the incremental backup, while other table partitions not in the set are not backed up. In some embodiments, certain tables are designated to be of a type such that existing records are not modified. Tables are partitioned in a manner that isolates changes, e.g., added rows, in a relative few table partitions, leaving others unchanged and therefore able to be omitted from subsequent incremental backups.

Abstract: One embodiment is a method that divides a cluster file system into multiple segments with each segment including one or more local counters. The method then checks for inconsistencies and corrects discovered inconsistencies in each of the local counters while the file system remains online and available for use.

Abstract: Presenting unique search result contexts, including: receiving, by a search result presentation module, a plurality of search results generated in response to a search query, wherein each search result includes context information associated with the search result; identifying, by the search result presentation module for each search result, a displayable portion of the context information associated with the search result; determining, by the search result presentation module for each search result, whether the displayable portion of the context information is a duplicate of the displayable portion of the context information for another search result; and responsive to determining that the displayable portion of the context information is a duplicate of the displayable portion of the context information for another search result, updating, by the search result presentation module, the displayable portion of the context information for the search result.

Abstract: Data is converted into a minimized data representation using a suffix tree by sorting data streams according to symbolic representations for building table boundary formation patterns. The converted data is fully reversible for reconstruction while retaining minimal header information.

Abstract: A method for querying metadata associated with media, such as multimedia and/or streaming media, on a computer network includes separating the metadata into keywords. The keywords are compared with valid keywords. A score is calculated in accordance with the degree of similarity between the keywords and valid keywords. If the degree of similarity is above a threshold, the metadata is qualified as valid metadata. Valid metadata is available for comparison and correction of other (invalid) metadata.

Abstract: Presenting unique search result contexts, including: receiving, by a search result presentation module, a plurality of search results generated in response to a search query, wherein each search result includes context information associated with the search result; identifying, by the search result presentation module for each search result, a displayable portion of the context information associated with the search result; determining, by the search result presentation module for each search result, whether the displayable portion of the context information is a duplicate of the displayable portion of the context information for another search result; and responsive to determining that the displayable portion of the context information is a duplicate of the displayable portion of the context information for another search result, updating, by the search result presentation module, the displayable portion of the context information for the search result.

Abstract: An aspect of the disclosed technology is a general-purpose platform that may be used to provide resilient cloud services. Tasks may be written as procedures in general-purpose programming languages that directly manipulate resources via control interfaces. In one implementation, resource states, such as router configurations and virtual machine states, associated with a cloud customer that provides communications services, may be abstracted into tables in a relational or semi-structured database. State changes that have been written to the database tables are automatically propagated by the database to appropriate customer physical devices, such as network elements, thereby implementing various customer network operations.

Abstract: There is provided a communication unit configured to receive monitor data showing a progress state of substrate processing or a state of substrate processing apparatus, from a substrate processing apparatus; a database part configured to readably store the monitor data received by the communication unit, in association with production information data; a file archive part configured to read the monitor data and the production information data from the database part, then create typical value data based on the monitor data, and prepare a file including the monitor data, the production information data, and the typical value data, and readably store this file; and a data searching part configured to receive an input of a prescribed searching condition to search the file, and display data stored in the file and matching with the searching condition, on a display unit.

Abstract: Example apparatus and methods concern multi-tier bandwidth-centric deduplication. One example apparatus supports inline bandwidth-centric deduplication with post-processing space-centric deduplication to improve inline bandwidth-centric deduplication and thereby reduce bandwidth requirements. One example method may include determining whether a bandwidth-centric deduplication device can satisfy a deduplication request associated with a data communication and then deciding whether to engage a space-centric deduplication device to co-operate in attempting to satisfy the request. More generally, the method includes controlling a first deduplication device to participate in bandwidth reduction and selectively controlling a second deduplication device to also participate in the bandwidth reduction.

Abstract: An embodiment of a method of restoring backup data comprises first and second steps that preferably are executed at least partially in parallel. The first step restores an incremental backup. The second step selectively restores a full backup. The selective restoration of the full backup disregards units of data that were restored from the incremental backup and restores a remainder of the full backup. In an alternative embodiment, the first step precedes the second step. In another alternative embodiment, the selective restoration of the full backup accesses a table that indicates the units of data contained in the incremental backup to determine which units of data to disregard in the full backup.

Abstract: A search engine may maintain a list of derived metadata. When an event occurs that requires updating a search index, the search engine can determine which metadata is derived metadata and take appropriate actions with respect to the derived metadata. For example, if a request is received to update the index for a particular object, the search engine may protect the derived metadata from change while updating the other metadata in the index. As another example, if a request is received to update the text content for the object, the search engine may change the text content and the derived metadata. By identifying derived metadata, the search engine can protect the derived metadata from change when a request is received that otherwise causes metadata to change and can change the derived metadata when a request is received that would otherwise not change the metadata portion of the index.

Abstract: Data is converted into a minimized data representation using a suffix tree by sorting data streams according to symbolic representations for building table boundary formation patterns. The converted data is fully reversible for reconstruction while retaining minimal header information.

Abstract: Reducing programming complexity in client applications when interfacing with database servers operating with corresponding programming interfaces. In one embodiment, a client system merely specifies a procedure of interest to be executed on a database server of interest, and a system forms the specific instructions according to the programming interface requirements of the specific database server. Thus, the client applications may be implemented independent of the programming interface requirements of the database servers. The client system may also send data indicating the programming environment (e.g., Java or Visual Basic) in which applications are supported (in the client system). The application sever may form the instructions consistent with the programming environment as well, thereby further reducing the complexity of implementations in the client applications.

Abstract: A data storage array may be made up of several storage devices, each of which may contain array metadata that may allow portions of the storage array to be used. A system may have a file system manager that may receive and respond to file system commands and a storage device manager that may store data on the several storage devices. Array metadata defining where data is stored within the storage array is stored on each device within the array. A policy engine may identify data to be stored on the array and determine if the data contains array metadata or other types of data and may store the data on every device, devices having specific characteristics, two or more devices, or one device.

Abstract: 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.