Abstract: The data storage system according to certain aspects can implement partial file restore, where only a portion of the secondary copy of a file is restored. Such portion may be designated by one or more application offsets for the file. The system may provide an in-chunk index that includes mapping information between the application offsets and the secondary copy offsets. Chunks may refer to logical data units in which secondary copies are stored, and the in-chunk index for a chunk may be stored in secondary storage with the chunk. Because the mapping information may not be provided at a fixed interval, the system can search through application offsets in the in-chunk index to locate the secondary copy offset corresponding to the portion application offset(s). In this manner, the system may restore the designated portion of the secondary copy in a fast and efficient manner by using the in-chunk index.

Abstract: Systems and methods for dynamic partitioning in a relational database are described herein. A system can be configured to receive a data object definition statement to define a data object, where the data object definition statement associates an expression with the data object, and where the expression defines a correlation between an attribute of the data object and a prospective partition of the data object. The system can then receive a data manipulation statement to manipulate data in the data object, and in response to receiving the data manipulation statement, process the data manipulation statement, where processing includes initiating evaluation of the expression to identify a target partition based on the correlation between the attribute and the prospective partition.

Abstract: A method and apparatus for an in-database sharded queue that supports JMS session ordering is provided. Messages from a plurality of enqueuers are stored in a plurality of shards of a particular queue. For each enqueuer, all messages are stored in only one of the shards. Each shard includes one or more subshards, each subshard having one or more partitions of a queue table maintained by a relational database system. All messages from a first enqueuer are stored in partitions of the queue table that are assigned to a first shard of the plurality of shards. All messages from a second enqueuer are stored in partitions of the queue table that are assigned to a second shard of the plurality of shards. Subscribers of the particular queue are caused to dequeue messages from the plurality of shards.

Abstract: An invention is disclosed for maintaining out-of-band metadata for data. In embodiments of the invention, an upper layer of a storage stack determines that the metadata of a lower layer of that storage stack may have become out of sync. In response, the upper layer may issue a series of commands to the lower layer based on the metadata. In other embodiments of the invention, an offload-copy operation on data may also transfer out-of-band metadata so that it is applied to the data at the destination.

Abstract: An information management system according to certain aspects allows users to share a portion of a file (e.g., a document) stored in secondary storage. The user may specify a portion of a secondary storage file to share and send a link to the portion to another user. The other user can access the shared portion from the link, and just the shared portion may be restored from secondary storage. The system according to certain aspects provides a native view of secondary storage data on a client computing device. The index data and/or metadata relating to secondary storage data may be stored in native application format for access via the native source application.

Abstract: Techniques and systems for facilitating contextual information lookup and navigation are presented. Contextually relevant information can be presented without requiring a user to switch context or craft a search query. From within an application in which a user may consume or create content, a user may indicate text for further exploration. The application can receive the indication of an initial text selection, determine the intended selection and provide contextual search results to the user. In some implementations, the initial selection and a selection context (that includes at least some of the text surrounding the initial selection) is sent to a contextual search service which provides the intended selection and contextual search results based on the initial selection and selection context. In other implementations, text may be suggested by the contextual search service for selection from within the application.

Abstract: Embodiments disclosed herein relate to systems, methods, and computer program products for updating a development database. In some embodiments, the system and method compare a development database and an associated production database to determine a drift score. The development database is then updated when the drift score exceeds a predetermined threshold. In some situations, the system extracts a schema from the development database and the associated production database in order to identify differences between the two databases. The system then calculates a drift score based on the differences and compares the drift score to a predetermined threshold value. If the drift score exceeds the threshold value, the system alerts the user to update the development database or automatically updates the development database.

Abstract: A data configuration method and device, and a data configuration rollback method and device are applied to the field of information processing technologies. The data configuration method includes: receiving a data configuration operation request, where the data configuration operation request includes an data insert request, a data delete request, or an data update request; allocating an operation serial number to the data configuration operation request; and recording the allocated operation serial number and data requested to be operated by the data configuration operation request, as a mapping relationship between a creation operation serial number, a deletion operation serial number, and the data according to the data configuration operation request.

Abstract: A database compression system includes and analyzer, a counting engine, and a mapping engine. The analyzer analyzes a schema of a database by maintaining a list of attributes and corresponding values. The analyzer also analyzes a selection of entries in the database. The counting engine determines a frequency of occurrence of each attribute/value pair in the selection of entries. The mapping engine assigns a condensed code to a character string determined on the basis of the attribute/value pair with a highest frequency of occurrence.

Abstract: A data model for managing identity and access management (IAM) data implemented at an electronic database may include a set of logical resource elements, a set of physical resource elements, and a set of access requests elements that respectively model logical resources, physical resources, and access requests received at an access request manager of an enterprise. The physical resource elements may be respectively associated with the logical resource elements such that access rights for the physical resources may be obtained based on a logical resource specified in the access request. A system for managing IAM may include a mapping module configured to transform heterogeneous IAM data provided by a plurality of IAM data sources into homogeneous IAM data formatted according to the common IAM data format. A data store may implement the IAM data model such that the data store is configured to store the homogeneous IAM data.

Abstract: A method and corresponding system upgrades a live computer system. The method begins with migrating a copy of data from a first system to a communicatively coupled second system at a first time. Next, at one or more subsequent times, a copy of changed data is migrated from the first system to the second system until a threshold is reached. Finally, in response to reaching the threshold, a copy of the remaining changed data is migrated from the first system to the second system. A further embodiment of the method comprises: disabling access to the first system during the migration of data at the first time, enabling and maintaining access to the first system at the one or more subsequent times during the migration of the copy of changed data, and disabling access to the first system during the migration of the copy of the remaining changed data. In this manner, the system being upgraded is still highly available throughout the upgrade process.

Abstract: The present disclosure provides a method and device for processing I/O balance. The method includes: receiving a storage request message carrying a data table, an estimated capacity of the data table, a size of a data block corresponding to the data table, and a disk identifier indicating storage of the data table, where the data table includes at least one data file; and acquiring database information according to the estimated capacity of the data table, the size of the data block corresponding to the data table and the total number of disks corresponding to the disk identifier, generating a first shell script according to the storage request message and the database information, and creating a database according to the first shell script.

Abstract: Directory attributes are provided so that the time for creating an incremental backup of a file system by a scan of the file system tree is proportional generally to the number of files that change between backups instead of the number of files in the file system. A tree modification attribute indicates whether or not any file in a directory tree has changed since the last backup. If no file has changed in the directory tree, then the entire tree is skipped during the scan for changed files. In addition, a list is compiled of the files in the directory that represent branches having at least one changed file, so that the list is scanned instead of the directory entries. When a file is changed for the first time since the last backup, the file is queued so that the directory attributes are updated in a background process.

Abstract: Provided are techniques for generating a relational query. Information is collected from a query specification and a model for an On-Line Analytical Processing (OLAP) query having at least a first expression and a second expression. The collected information is used to generate a relational query to retrieve report data to be used to satisfy the first expression and the second expression.

Abstract: A computer-implemented method for identifying related search queries is performed on a server. The method includes receiving a search query from a user, identifying a set of ranked search results satisfying the search query, and identifying, using historical search query data, at least one last related search query in at least one chain of related search queries that is related to the search query and that includes at least one search result that was selected by users who issued the search query, each respective related search query in the at least one chain of related search queries except for the at least one last related search query in the at least one chain of related search queries violating a search result selection criterion. The method further includes returning the set of ranked search results and the at least one last related search query to the user.

Abstract: An approach for filtering data into a geo-activity zone cell is presented. An area of interest specifying an individual, organization, or entity is selected. Data is extracted from streaming data and from data at rest. Metadata of the extracted data is determined. The metadata includes time and date stamp(s) and contextual information specifying the area of interest. A first portion of the metadata includes geospatial tag(s) specifying the area of interest, and a second portion of the metadata is initially missing geospatial tag(s). The missing geospatial tag(s) are determined and added to the second portion of the metadata by extracting a location from profile data and/or inferring the location based on a region-based geo-topic model. The extracted data is filtered into a geo-activity zone cell based on the first and second portions of metadata being within metadata boundaries.

Abstract: Disclosed is an apparatus for collecting contents using social relation characters, which includes: an input unit for receiving search information from a main user; a database for storing SNS subscriber list of the main user and related users in relation to the main user and group information in relation to friendship in an SNS; and a content managing unit for searching contents in relation to the received search information by using the group information from contents possessed by the main user and the related users in an SNS server, defining the searched contents as a first content group, calculating a first interest index for each content included in the first content group based on additional information input by the related users, and determining a predetermined content, on which interest of the related users is focused, from the searched contents based on the calculated first interest index.

Abstract: A system and method for recommending content to a user in a social network, including: logging user activity for the user in the social network; categorizing the user activity across all the user's networks, wherein each category is assigned a score based on relevance to the user; assigning weights to the user activities; calculating a social index score as a function of the weighted user activity categories; logging user content into categories; scoring the user content; and generating a content social index by weighting the content scores.

Abstract: A system, computer-readable storage medium storing at least one program, and a computer-implemented method for identifying chains of related search queries is presented. Historical search query data is obtained. Chains of related search queries issued by users and search results corresponding to last related search queries in the chains of related search queries that were selected by the users are identified from the historical search query data, where each related search query in a chain of related search queries except for a last related search query in the chain of related search queries violates a search result selection criterion. The chains of related search queries are aggregated into groups, where a respective group has a common first search query and a common search result corresponding to at least one last related search query that was selected by the users. Aggregate data for the groups are stored in a query database.

Abstract: A horizontal anomaly detection method includes receiving at plurality of objects described in a plurality of information sources, wherein each individual information source captures a plurality of similarity relationships between the objects, combining the information sources to determine a similarity matrix whose entries represent quantitative scores of similarity between pairs of the objects, and identifying at least one horizontal anomaly of the objects within the similarity matrix, wherein the horizontal anomalies are anomalous relationships across the plurality of information sources.