International Business Machines Corporation

John A McPherson, Jr

Eugene Jon Shekita

Ronny Lempel

Marcus Felipe Fontoura

Andreas Neumann

Runping Qi

Andrei Zary Broder

Nadav Eiron

Michael Herscovici

Ning Li

Reiner Kraft

Curt Lee Cotner

Sridhar Rajagopalan

Jason Yeong Zien

Claus Kempfert

Margaret Zagelow

Shila Ofek-Koifman

Felipe Marcus Fontoura

Mir Hamid Pirahesh

Sam Sampson Lightstone

James Alan Ruddy

James C Kleewein

Andrey Balmin

Yuanyuan Tian

Tuong Chanh Truong

Tony Leung

Shirish Tatikonda

Elizabeth Belva Hamel

Justo Luis Perez

Todd L Leyba

Tony Kai-chi Leung

Daniel J Coyle, Jr

Mark Donald Leitch

Michael T Ho

Severin A Corsten

In a particular embodiment, a method includes storing, at a staging table of a database, a data update generated based on a transaction performed with respect to a data table that is associated with one or more indexes. Each index of the one or more indexes is maintained externally to the database. The method further includes maintaining the data update at the staging table at least until index update data is received at the database. The index update data represents a modification, based on the data update, to a particular index of the one or more the indexes.

Maintaining index data in a database

Embodiments relate to subgraph-based distributed graph processing. An aspect includes receiving an input graph comprising a plurality of vertices. Another aspect includes partitioning the input graph into a plurality of subgraphs, each subgraph comprising internal vertices and boundary vertices. Another aspect includes assigning one or more respective subgraphs to each of a plurality of workers. Another aspect includes initiating processing of the plurality of subgraphs by performing a series of processing steps comprising: processing the internal vertices and boundary vertices internally within each of the subgraphs; detecting that a change was made to a boundary vertex of a first subgraph during the internal processing; and sending a message from a first worker to which the first subgraph is assigned to a second worker to which a second subgraph is assigned in response to detecting the change that was made to the boundary vertex of the first subgraph.

Subgraph-based distributed graph processing

Techniques are provided for processing a search request. One or more indexed levels of access control list information are stored in a search index for each document identified in the search index. An interim result set is generated by matching the one or more indexed levels of access control list information associated with each said document to one or more security groups associated with the search request. A final result set is generated from the interim result set by performing impersonation.

Enforcing native access control to indexed documents

A method includes describing the thread configurations of a volume of well-ordered electronic message transmissions (EMT) and utilizing the thread configuration data to conduct selective searches of the EMT volume. An apparatus includes a thread processor and a query manager. The thread processor analyzes the EMT threads and records the thread configuration data. The query manager utilizes the thread configuration data to conduct selective searches of the EMT volume.

Indexing and searching of electronic message transmission thread sets

Systems, methods, and computer program products to persist external index data in a database are disclosed. In an embodiment, a method includes maintaining a database including a first data table that is configured to store data in a database format and a second data table that is configured to store index data. The index data represents an index of a first portion of the first data table, and the index maintained externally to the database by an index manager. The method also includes generating a data update representing a modification to the first data table and communicating the data update to the index manager. The method further includes receiving index update data from the index manager representing a modification to the index as a result of the data update and applying the index update data to the second data table.

Persisting external index data in a database

A method for indexing a plurality of documents, that includes a plurality of duplicate documents, first identifies one or more duplicate groups of documents from among the plurality of documents. Then, one index of content for the duplicate group is created instead of indexing the content from every document within the duplicate group. However, in contrast to the content index, an index of metadata for each of the documents in the duplicate group is created. Thus the content of each duplicate group is indexed only once, while a search engine using such indexing techniques retains the capability to answer queries as if the duplicated content was indexed for each document of the group.

Generic architecture for indexing document groups in an inverted text index

A method and system for querying multifaceted information. An inverted index is constructed to include unique indexed tokens associated with posting lists of one or more documents. An indexed token is either a facet token included in a document as an annotation or a path prefix of the facet token. The annotation indicates a path within a tree structure representing a facet that includes the document. The tree structure includes nodes representing categories of documents. A query is received that includes constraints on documents. The constraints are associated with indexed tokens and corresponding posting lists. An execution of the query includes identifying the corresponding posting lists by utilizing the constraints and the inverted index and intersecting the posting lists to obtain a query result.

Efficient multifaceted search in information retrieval systems

Provided is a technique for building an index. A new indexis built and an anchor text tableand a duplicates tableare output using a store, a delta store, and previously generated global analysis computations, wherein the previously generated global analysis computationsinclude an anchor text table, a rank table, and a duplicates table. New global analysis computationsare generated using the anchor text tablei+1, the duplicates table, and the previously generated global analysis computations.

Pipelined architecture for global analysis and index building

A method for querying multifaceted information. An inverted index is constructed to include unique indexed tokens associated with posting lists of one or more documents. An indexed token is either a facet token included in a document as an annotation or a path prefix of the facet token. The annotation indicates a path within a tree structure representing a facet that includes the document. The tree structure includes nodes representing categories of documents. Constructing the inverted index includes generating a full path token and an associated full path token posting list. A query is received that includes constraints on documents. The constraints are associated with indexed tokens and corresponding posting lists. An execution of the query includes identifying the corresponding posting lists by utilizing the constraints and the inverted index and intersecting the posting lists to obtain a query result.

A method, apparatus and article of manufacture is provided for loading data from a remote data source record by record, in a computer system network connecting a source site and a target site via a database connection communication line. The source site has at least one data source and a Distributed Relational Database Architecture (DRDA) software server having multi-database access to DBMSs. The target site requests data loading from the source site DRDA via a block of Structured Query Language (SQL) statements. Data are transported record by record via the database connection communication line according to the DRDA communication protocol, wherein the target site loads records concurrently with the unloading of records in the source site. The data loading may also be performed in a pipeline manner, loading data records in multiple partitions with a plurality of parallel streams, pointed to by a plurality of data source partition cursors.

Data loading from a remote data source record by record

Disclosed is a technique for building an index in which global analysis computations and index creation are pipelined, wherein the global analysis computations share intermediate results.

The present invention provides an evaluation strategy for the execution of SQL queries involving recursion and table queues in a relational database management system. The table queue is established for the query in the memory of the computer, and tuples are generated by tuple-producing operators in the query for storage into the table queue. As operators of the query read the stored tuples from the table queue, a first end-of-file condition, termed a Temporary End-Of-File, occurs when all of the tuples currently stored in the table queue have been retrieved and control is returned to the operator reading from the table queue. A retry request for additional tuples is generated by the operator through the table queue to the tuple-producing operators. If the tuple-producing operators can generate additional tuples, then these additional tuples are stored into the table queue and control is returned to the operator reading from the table queue in response to the retry request. If the tuple-producing operators cannot generate the additional tuples, then a second end-of-file condition, termed a Permanent End-Of-File, occurs and control is returned to the operator reading from the table queue.

Growing community of inventors

San Jose, CA, United States of America

John A McPherson, Jr