International Business Machines Corporation

Globalfoundries Inc.

Roland Seiffert

Jochen F Doerre

Oliver Benke

Andreas Arning

Michael J Dockter

Randal James Richardt

Ronald W Lynn

Monika Matschke

Joseph A Munoz

Knut Stolze

Peter Bendel

Oliver Draese

Matthias Tschaffler

Namik Hrle

Maryela Evelin Weihrauch

Ruiping Li

Stefan Letz

Andreas Neumann

Jan-Bernd Themann

Andrea E Baader

Adrian Mueller

Rakesh Agrawal

Angel Nunez Mencias

Ramakrishnan Srikant

Peter Gerstl

Frank Neumann

Sebastian Goeser

Edward McCarthy

Walter Haug

Steffen Hees

Natalia V Ivanova

Birgit Hamp

Annette Opalka

A processor(s) initiates a database transaction, in a computing environment that includes a database that includes one or more memory devices. The processor(s) forks a first address space that represents a current state of the database, to create a second address space. The processor(s) writes an entry indicating timing of the initiating to a log file and generates a file that is mapped to the one or more memory devices. The file includes differences in state between the current state of the database and a state subsequent to executing and committing the database transaction, and a timestamp indicating timing for committing the database transaction. The processor(s) write the database transaction to the second address space.

Database recovery using persistent address spaces

Processing is provided for operating an in-memory database, wherein transaction data is stored by a persistence buffer in an FIFO queue, and update processor subsequently: waits for a trigger; extracts the last transactional data associated with a single transaction of the in-memory database from the FIFO memory queue; determines if the transaction data includes updates to data fields in the in-memory database which were already processed; and if not, then stores the extracted transaction data to a store queue, remembering the fields updated in the in-memory database, or otherwise updates the store queue with the extracted transaction data. The process continues until the extracting is complete, and the content of the store queue is periodically written into a persistent storage device.

Persisting of a low latency in-memory database

A distributed database system (or federated database system) where a catalogue is used to store metadata descriptive of data containers for the constituent database system(s) and/or accelerator system(s) of the federated database. In response to the generation of the trigger signal corresponding to a database definition language (DDL) statement, the accelerator system updates metadata in the catalogue.

Distributed system with accelerator and catalog

A distributed database system (or federated database system) where a catalog is used to store metadata descriptive of data containers for the constituent database system(s) and/or accelerator system(s) of the federated database. In response to the generation of the trigger signal corresponding to a database definition language (DDL) statement, the accelerator system updates metadata in the catalog.

Computer system and method are provided which include or utilize first and second databases, and a receiver for receiving online data. The first database stores received online data in a first data structure, and the second database stores the online data in a second data structure, with the second structure being obtained by applying a transformation to the online data in the first data structure. The system also has a software component for generating an analytical model using at least part of the online data stored in the second database, and a processor and memory storing a plurality of applications that are executable on the processor, where a mapping application includes instructions that, when executed, cause at runtime the processor to automatically retrieve at least part of the online data from the second database, and store in a storage of the system the retrieved online data.

Method and system for scoring data in a database

A distributed database system (or federated database system) comprises a constituent database management system (DMBS), an accelerator system and a single interface. The accelerator system creates a data container in accordance with structural features identified by the accelerator system and stores data in the data container. The constituent database system supplements incomplete metadata associated with the data container to create complete metadata descriptive of the namespace and structure of the data container created by the accelerator system.

Distributed system with accelerator-created containers

A computer installs an operating system. The computer receives, in a logical partition (LPAR) via a management network, a deploy program configured to download a disk image from an image repository and to write the disk image to a first direct access storage device (DASD) of the LPAR. The disk image includes an operating system, applications, and management components including an upgrade program. The computer receives, in the LPAR via a data network, the disk image, and writes, to the first DASD of the LPAR, the disk image. The computer boots the LPAR into the operating system of the disk image written to the first DASD, and determines whether the installed operating system is a deployment or an upgrade.

Automatic creation, deployment, and upgrade of disk images

A reference string set including a group of strings is set. At least two specific tuples of substring triples is found inside the reference string set of strings. Each tuple is considered as a candidate for representing a related concept. Each concatenation of the substrings triples is an explicit member of the reference string set. Each middle substring of the substring triples is unequal to another middle substring within the substring triples found inside the reference string set. Each prefix substring is equal to all other prefix substrings within the substring triples found inside the reference string set. Each suffix substring is equal to all other suffix substrings within the substring triples found inside the reference string set. Either the prefix substring or the suffix substring is not empty.

String pattern conceptualization from detection of related concepts by analyzing substrings with common prefixes and suffixes

A conceptualization method uses maximum or other substrings of a string pattern to find specific N-tuples of substring triples with N&#x2267;2 and m=1 . . . N inside a reference set (SET_r_i) of strings (STR_n_i). Each N-tuple is considered as a candidate for representing related concepts. Each concatenation of the substrings triples is an explicit member of the reference set (SET_r_i). Each middle substring out of middle substrings is unequal to another middle substring out of middle substrings within the substring triples found inside the reference set (SET_r_i). Each prefix substring (X_i) is equal to all other prefix substrings (X_i) within the substring triples found inside the reference set (SET_r_i). Each suffix substring (Z_i) is equal to all other suffix substrings (Z_i) within the substring triples found inside the reference set (SET_r_i). Either the prefix substring (X_i) or the suffix substring (Z_i) is not empty.

A method of analyzing a string-pattern includes defining a minimum length (Lmin) of substrings (STR_A_B) to be considered; defining a maximum length (Lmax) of substrings (STR_A_B) to be considered; with a computer, searching the string-pattern for substrings (STR_A_B) with a length in an interval between the minimum length (Lmin) and the maximum length (Lmax); counting an occurrence (Occ_A_B) of each substring (STR_A_B) found with a length in the interval between the minimum length (Lmin) and the maximum length (Lmax); and pruning away a number of the substrings (STR_A_B) that meet one or more criteria. The criteria are selected from the group consisting of (1) being contained inside the maximum substring (STR_A_C) in a subset (SET_A) of substrings (STR_A_B), (2) being shorter than the maximum substring (STR_A_C), (3) occurring with a same frequency as the maximum substring (STR_A_C), and combinations thereof.

String pattern analysis

A method and systems for providing XML data is disclosed. In accordance with an embodiment of the invention, a second data processing system, which is connected to a first data processing system via a network, receives a first request over the network from the first data processing system. The first request comprises specifications for subsequent transfers of XML data from the second data processing system to the first data processing system. The specifications specify for which type of XML documents to be transferred in subsequent transfers to the first data processing system which excerpts of XML data shall be sent. An acknowledge message, sent to the first data processing system from the second data processing system, indicates the latter's ability to provide the excerpts of XML data for the types of XML documents in the subsequent data transfers.

Method and data processing system for providing XML data

System and computer program product for processing a text search query in a collection of documents. A full posting index is generated that has first index terms and a full posting list for each first index term, enumerating occurrences of the first index terms in the documents of the collection. A text search query includes search conditions search terms. The search conditions are translated into conditions on the first index terms to provide translated conditions. At least one short posting index is generated, which includes second index terms and a short posting list for each second index term, enumerating documents in which the second index terms occur. Filter conditions and complementary conditions are generated to represent the translated conditions. The filter conditions approximate the translated conditions, and are processed using the short posting index. The complementary conditions are processed using the full posting index to provide a query result.

Processing a text search query in a collection of documents

A method, system and computer program product implementing the method are provided to process a text search query in a collection of documents. A full posting index is generated for the documents in the collection. The full posting index comprises one or more first index terms and a full posting list for each first index term, enumerating the occurrences of the first index term in the documents. In addition to the full posting index, at least one additional posting index is generated for the documents. The additional posting index is related to a defined document part and comprises one or more second index terms and a restricted posting list for each second index term, enumerating all occurrences of the second index term in the document part of the documents of the collection. The text search query is performed using the additional posting index.

Growing community of inventors

Herrenberg, Germany

Roland Seiffert