International Business Machines Corporation

Edison Lao Ting

Vanja Josifovski

James C Kleewein

Kevin Scott Beyer

Tuong Chanh Truong

Mayank Pradhan

Robert William Lyle

Tian Zhang

Anjali Betawadkar-Norwood

Normen Seemann

Radhika Reddy

Simon Kurt Johnston

Fatma Ozcan

Lawrence Scott Rich

Martin Paul Nally

Richard D Lawrence

Robbert C Van Der Linden

Vikas Sindhwani

Robbert Van Der Linden

James Peter Branigan

Shaorong Liu

Prem Melville

David Paul Charboneau

Arindam Banerjee

Shiva P Kasiviswanathan

Saha Ankan

Embodiments are included for methods, systems, and computer program products in which evaluating operations using an electronic computing device are presented including: receiving the operation on a first database partition in a shared nothing parallelism system, where the operation is non-collocated, reference based operation; generating a correlation sequence, where the correlation sequence includes a sequence of references pointing to input data required for the operation; receiving one of the references on a first table queue operator on a second database partition, where the second database partition includes input data corresponding with the received reference, and where the table queue operator is configured for providing communication between the first database partition and the second database partition; and processing the input data on the second database partition corresponding with the operation.

Evaluating reference based operations in shared nothing parallelism systems

A system and method for managing and storing logically grouped hierarchical data via physical block storage is provided. Logical groups of parsed XML node data forming node ID ranges are indexed by creating and inserting an index entry into a node ID range. Index entries indicate node ID range bounds for blocks in which nodes are stored. Consulting a node ID range index facilitates XML node traversal via logical links between nodes in different blocks. Additionally, physical links between nodes within a block allow for fast node traversal. Node update including insertion and deletion as well as document order based pre-fetch and XML document re-organization is also facilitated by this architecture.

Hierarchical storage architecture using node ID ranges

Provided are techniques for processing a query. A query is received, wherein the query is formed by one or more paths, and wherein each path includes one or more steps. A hierarchical document including one or more document nodes is received. While processing the query and traversing the hierarchical document, one or more extraction entries are constructed, wherein each extraction entry includes a step instance match candidate identifying a document node and a step instance ancestor path for the document node, and one or more tuples are constructed using the one or more extraction entries by associating the step instance match candidate from one of the one or more extraction entries with the step instance match candidate from at least one of the one or more other extraction entries.

Query evaluation using ancestor information

Embodiments are included for methods, systems, and computer program products for evaluating operations in a shared nothing parallelism system using an electronic computing device are presented, the methods and computer program products including: causing the electronic computing device to receive the operation, where the operation is non-collocated, reference based operation, and where the operation is configured for execution on a first partition in the shared nothing parallelism system; causing the electronic computing device to insert a table queue operator on a second partition, where the second partition includes a reference to input data, causing the electronic computing device to place the reference to the input data on the first partition by the table queue operator; and causing the electronic computing device to execute the operation on the reference to the input data on the first partition.

A method, system and computer program product for inferring topic evolution and emergence in a set of documents. In one embodiment, the method comprises forming a group of matrices using text in the documents, and analyzing these matrices to identify a first group of topics as evolving topics and a second group of topics as emerging topics. The matrices includes a first matrix X identifying a multitude of words in each of the documents, a second matrix W identifying a multitude of topics in each of the documents, and a third matrix H identifying a multitude of words for each of the multitude of topics. These matrices are analyzed to identify the evolving and emerging topics. In an embodiment, the documents form a streaming dataset, and two forms of temporal regularizers are used to help identify the evolving topics and the emerging topics in the streaming dataset.

Inferring emerging and evolving topics in streaming text

Resources are typically stored in homogenous data structures by shredding resource data into database tables destroying a native format of the resources. Typical approaches to indexing the resources rely on users indicating properties that should be indexed, using full text searches to create resource index documents, and other such labor and computation intensive processes. Functionality can be implemented to dynamically generate the resource index documents based on resource properties with minimal user input. The resource index documents can be in a common format to facilitate access to resources stored in heterogeneous native resource formats.

Indexing heterogeneous resources

An extensible identification system for nodes in a hierarchy is described wherein each node is assigned a concatenation of decimal based values. The values assigned uniquely identify the node, provides an order for the node, and identifies its parent, child, and sibling relationships with other nodes Furthermore, the IDs assigned can be encoded to be byte comparable. Furthermore, the ID's assigned to nodes need not be modified when changes (adding/deleting a child node or a subtree of nodes) are made in the hierarchy. Additionally, in the event of such a change, the order and relationships between the parent, child, and sibling nodes are retained.

Extensible decimal identification system for ordered nodes

An apparatus and method for optimizing descendant path evaluation in XPath/XQuery includes generating a list of unique paths in a tree structure of an XML document. Each unique path includes one or more nodes of the tree structure. A query is received specifying a descendant node for retrieval from the tree structure. From the list, unique paths are identified that include the descendant node. A navigation aid is then generated to assist in traversing the unique paths that include the descendant node. Using the navigation aid as a guide, descendant nodes in the tree structure may be retrieved by traversing only unique paths that include the descendant node.

Apparatus and method for optimizing descendant path evaluation in xpath/xquery

A method (and an article of manufacture having computer readable program code to implement the method) is disclosed to version a node range and locate a versioned node range in a storage architecture, wherein the method comprises: maintaining a set of node ranges, with each node range being formed from a range of node ID values assigned to each node among a plurality of nodes, receiving a node modification request for a node range from a database system, versioning the node range by copying (to a storage) a node range to which the node modification request is to be made, labeling the copied node range with a timestamp, locating the labeled node range via the timestamp and a hash on the node range, and outputting the located labeled node range. Optionally, versioning is done by shadowing nodes in the range to a version hash table based on a range identifier.

Transient range versioning based on redirection

A method and system for distributed garbage collection in a pipelined workflow environment comprising a plurality of processing nodes that pass item references to each other. Each node maintains a reference list of local item references and a reference dictionary of remote item references, and periodically synchronizes the reference list with the reference dictionaries of other nodes in the workflow, so that item references are not marked for garbage collection while other processing nodes may still have outstanding references to them.

Distributed garbage collection in a dataflow system

Method for ordering nodes within hierarchical data. The concept of isolated ordered regions to maintain coordinates of nodes is used by associating each node with coordinates relative to a containing region. Modifications to nodes within a region only affect the nodes in that region, and not nodes in other regions. Traversals that retrieve information from the nodes can rebase the coordinates from their containing region and return with a total order.

Growing community of inventors

San Jose, CA, United States of America

Edison Lao Ting