Abstract: Embodiments as disclosed herein allow simple specification of prioritized searches of chains of regions and efficient implementation of such searches. Specifically, embodiments as disclosed may provide a search operator that addresses the problem of complex query construction for finding objects having a particular value in one of a prioritized set of regions and efficiently implement the searches specified by such search operators.

Abstract: A method for creating a standby database with read/write access capability while also maintaining a data consistency with a primary database, is provided. The method includes syncing the primary database with a physical standby mirror existing on the standby database, creating a first data compartment and a second data compartment on the standby database, separate from the physical standby mirror, applying a change made to the first data object on the primary database to the corresponding first data object on the physical standby mirror; and determining whether the change should be applied to the corresponding first data object stored on the first data compartment in accordance with data merge rules associated with the first data compartment and the second data compartment.

Abstract: Orchestrated disaster recovery is provided in which replication volumes are automatically configured as part of a failover procedure. An example method includes obtaining replication volume configuration information identifying configuration of a replication volume in a data replication relationship in which data is replicated from a replication source to a replication target. The replication volume is configured for the replication source and replication volume remains at least partially non-configured for the replication target during data replication from the replication source to the replication target. Based on an indication of failover, the obtained configuration information is used in automatically configuring the replication volume for the replication target in preparation for use by application(s) of the replication target site. Automatically configuring includes configuring, for the replication volume, a volume group and a mount point.

Abstract: A method includes storing an anchor row vector identification for an anchor row to a local memory. It is determined whether the anchor row vector identification is visible based on isolation requirements. The anchor row vector identification is accessed upon a determination that the anchor row vector identification is visible, and the row vector identification is re-read from the local memory. It is determined whether the anchor row vector identification has not changed since a start of the accessing. Upon a determination that the anchor row vector identification has not changed, read anchor row fields are returned. A first check history is performed on an anchor row history tuple sequence number (TSN) for the anchor row.

Abstract: A method and apparatus for processing data are provided. The method and apparatus receive data relating to one or more computer implemented games. The data includes event identity information, which is parsed using an event definition of an event type. The event type is associated with the respective event identity information, wherein each event type belongs to an event class and to at least one semantic class. The parsed data is processed using information that defines one or more event classes or one or more semantic classes in order to provide a set of processed data.

Abstract: Systems and methods for contextual digital media processing are disclosed herein. An example method includes receiving content from a source as digital media that are being displayed to a user, processing the digital media to determine contextual information within the content, searching at least one network for supplementary content based on the determined contextual information, and transmitting the supplementary content for use with at least one of the source or a receiving device.

Abstract: A computer-implemented method according to one embodiment includes receiving, at a virtual file system, replicated data from a physical file system, transferring the replicated data from the virtual file system to cloud storage, and providing access to the replicated data in response to an unavailability of the physical file system, utilizing the virtual file system and the cloud storage.

Abstract: A database management system (DBMS) generates a query execution plan including information representing one or more database (DB) operations necessary for executing a query and executes the query based on the query execution plan. In the execution of the query, the DBMS dynamically generates a task for executing a DB operation and executes the dynamically generated task. The DBMS executes a task in a plurality of threads executed by a processor core.

Abstract: A social networking system allows users to create and join groups in the social networking system, in which each group is associated with one or more interests shared by members of the group. To select content for presentation to a viewing user of the social networking system who is a member of a group, the social networking system may determine one or more topics associated with the group based at least in part on a classification system and on information associated with objects maintained in the social networking system that are similar to the group. The topic(s) associated with the group also may be determined based on information associated with the group, with members of the group, and/or with objects associated with the group. The social networking system may then select one or more content items associated with the topic(s) for presentation to the viewing user via a group page.

Abstract: A tree-based format may be implemented for data stored in a data store. A table may be maintained across one or multiple storage nodes in storage slabs. Storage slabs may be mapped to different nodes of a tree. Each node of the tree may be assigned a different range of distribution scheme values which identify what portions of the table are stored in the storage slab. Storage slabs mapped to child nodes in the tree may be assigned portions of the range of distribution scheme values assigned to a parent. Storage nodes may be added or removed for storing the table. Storage slabs may be moved from one storage node to another in order to accommodate the addition or removal of storage nodes.

Abstract: Systems and methods for performing structure and attribute based graph partitioning. An exemplary system can receive a plurality of transactions, with each transaction identifying a point of sale and an item exchanged by the transaction. The system can generate a structure graph of the plurality of transactions and receive a request to partition the structure graph into sub-categories. The system can then retrieve, from a database, attributes of each respective structure vertex in the structure vertices. Using those attributes and the structure graph, the system can generate a structure-attribute graph. The system can then generate a unified neighborhood matrix of the structure-attribute graph; and partition the structure graph based on the unified neighborhood matrix.

Abstract: A computer-implemented method of establishing metadata associated with a transaction in a transaction processing system having application logic for executing the transaction, the computer-implemented method includes receiving, from a requestor, request data associated with the transaction, the request data comprising data and metadata. The method also includes peeking, during receiving the request data, of the request data looking for the metadata associated with the transaction and responsive to finding metadata associated with the transaction, directly instantiating an instance of application logic.

Abstract: Techniques for indexing file paths of items in a content repository may include querying, by at least one processor, a content repository stored on at least one computer readable storage medium for one or more items that qualify for file path indexes, do not have the file path indexes, and have a parent folder that has a file path index, wherein the querying does not depend on results from previous queries, and wherein the file path index indicates an associated item's location in a folder tree, creating, by the at least one processor, the file path indexes for resulting items from the querying, and, if the querying results in at least one resulting item, repeating the querying of the content repository and the creating of the file path indexes until the querying results in zero resulting items.

Abstract: Systems, methods, and computer-readable media for pinning query execution plans are described. A database system may obtain a query, and determine a organization identifier and/or user identifier associated with the query. The database system may identify an optimized plan among a set of query plans that correspond with the query, and may generate a query execution plan based on the query and the optimized plan. The database system may determine a pinned plan that is associated with the optimized plan, and may generate a query execution plan based on the pinned plan when the pinned plan is associated with the optimized plan and corresponds with the organization identifier and/or the user identifier. The database system may generate a query execution plan using optimization functions when the pinned plan is not associated with the pinned plan, or the organization identifier and/or the user identifier. Other embodiments may be described and/or claimed.

Abstract: A method, system and computer program product for generating answers to questions. In one embodiment, the method comprises receiving a query, conducting a search through one or more data sources to identify candidate answers to the query, and providing each of the candidate answers with a preliminary score. The method further comprises filtering out any of the candidate answers with a preliminary score that does not satisfy a defined condition. The candidate answers having preliminary scores that satisfy this condition form a subset of the candidate answers. Each of the candidate answers in this subset is processed to produce further scores. A ranking function is applied to these further scores to determine a ranking for each of the candidate answers in the subset; and after this ranking function is applied, one or more of the candidate answers are selected as one or more final answers to the query.

Abstract: Systems and methods for dynamically creating collaborative teams and managing collaborative work of a team are generally disclosed herein. One example embodiment includes the dynamic creation of a collaborative team by creating an association between team members via a managing module. The managing module may be capable of managing, among other things, team members on a team, tasks and goals of each member of the team, as well as documentation associated with the team. In some embodiments, the managing module may use a chat or messaging protocol to manage collaborative modifications to documents of the team.

Abstract: Provided are a system, method and computer program product for redistribution of data in an online shared nothing database, said shared nothing database comprising a plurality of original partitions and at least one new partition.

Abstract: Techniques are disclosed for implementing a unified partitioning scheme within distributed database systems to allow a table to be horizontally partitioned and those partitions stored on and serviced by a storage group. A storage group is a subset of storage manager (SM) nodes, and each SM node is configured to persist database data in durable storage. The distributed database system assigns each storage group to a subset of SM nodes. The distributed database system can address each storage group using a symbolic mapping that allows transactions to identify a particular storage group, and to direct read and write operations to a subset of SM nodes servicing that storage group. An administrator can update this mapping on-the-fly to cause the distributed database system to dynamically adjust an implemented partitioning scheme without necessarily interrupting on-going database operations.

Abstract: A framework for memory optimization of database indexes, and in particular for aging full-text index data, is described herein. In one embodiment, if, while a database table is aged, there are index tables associated with the database table, the associated index tables are automatically aged. This way, the system memory footprint will be reduced, leading to reduced cost as less system memory is required to perform remaining operations, and leading to increased performance as more system memory is available for other operations.

Abstract: A method for identifying client states, receives a set of paths representative of a document object model (DOM) associated with a web page of a rich internet application and for each path in the set of paths received, extracts a subtree, as subtree X, for a current path. The method traverses all known sub-paths under the current path and delete corresponding subtrees from subtree X and reads contents of and determines states of subtree X to form a state X. The state X is added to a set of current states and responsive to a determination no more paths exist, returns the set of current states of the rich internet application.