Oracle International Corporation

Teradata Us, Inc.

Microsoft Technology Licensing, LLC

Linkedin Corporation

Kapil Laxmikant Surlaker

Krishnan Meiyyappan

Shailendra Mishra

Neerja Bhatt

Joseph I Chamdani

Jeremy L Branscome

Ravi Krishnamurthy

Sreenivas Gollapudi

Lakshminarayanan Luxi Chidambaran

Debashis Saha

Namit Jain

Michael Paul Corwin

Liuxi Yang

James Shau

Hung Viet Tran

Shirshanka Das

Chavdar Botev

Nimar Singh Arora

Bhaskar Ghosh

Lin Qiao

Sanjay Kaluskar

Weidong Zhang

Min Tu

Bhagat V Nainani

Yinan Li

Wenxuan Gao

Alan Lee Beck

Jimmy Hong

Lei Gao

Issac Buenrostro

Jemiah Westerman

Ravindran Krishnamurthy

Sahil Takiar

Ziyang Liu

Narasimha R Veeramreddy

Ying Dai

Yishu Lin

Kenneth D Goodhope

Jean-Luc Vaillant

Mitch Stuart

Computer-implemented techniques for constructing structured database query language statements from natural language questions are disclosed. In some embodiments, a knowledge graph-based approach is employed to construct a structured database query language statement such as, for example, a Structure Query Language (SQL) statement, from a natural language question. The approach encompasses a domain knowledge graph model and a database schema wiring model. The domain knowledge graph model represents domain-specific knowledge about the underlying database data in the form of a graph having nodes and directed edges between the nodes. The database schema wiring model maps routes in the domain knowledge graph to database schema elements. The techniques allow a natural language interface system to accurately translate domain-specific natural language questions posed by users to structured database query language statements that can be executed against a structured database to answer the natural language question.

Constructing structured database query language statements from natural language questions

In order to ingest data from an arbitrary source in a set of sources, a computer system accesses predefined configuration instructions. Then, the computer system generates a dynamic data-ingestion pipeline that is compatible with a Hadoop file system based on the predefined configuration instructions. This dynamic data-ingestion pipeline includes a modular arrangement of operators from a set of operators that includes: an extraction operator for extracting the data of interest from the source, a converter operator for transforming the data, and a quality-checker operator for checking the transformed data. Moreover, the computer system receives the data from the source. Next, the computer system processes the data using the dynamic data-ingestion pipeline as the data is received without storing the data in memory for the purpose of subsequent ingestion processing.

Dynamic data-ingestion pipeline

A method of maintaining a data store is disclosed. The data store is distributed across a plurality of storage provider instances, including a master storage provider instance and a plurality of additional storage provider instances. A master data log is updated to reflect a change to the data store. The master data log is synchronized with a plurality of replicas of the master data log. The change is propagated across the plurality of additional storage provider instances based on an analysis of the replicas.

Middleware data log system

Embodiments of the present invention provide hardware-friendly indexing of databases. In particular, forward and reverse indexing are utilized to allow for easy traversal of primary key to foreign key relationships. A novel structure known as a hit list also allows for easy scanning of various indexes in hardware. Group indexing is provided for flexible support of complex group key definition, such as for date range indexing and text indexing. A Replicated Reordered Column (RRC) may also be added to the group index to convert random I/O pattern into sequential I/O of only needed column elements.

Accessing data in a column store database based on hardware compatible indexing and replicated reordered columns

A computer implemented method for automatically transforming an event notification within a database notification infrastructure based on client specified formatting and/or editing procedures. The method includes transforming the event notification having a format compatible with a database using a client specific format conversion procedure into a client-compatible event notification format. Further, the method may include transforming the payload portion of the event notification having a format compatible with a database using a client specific format conversion procedure into a linear event notification format. Moreover, the method may include transforming the event notification using a client specific editing procedure. The client specified procedures may be specified during event registration by the client. The transformed and/or edited event notifications may be forwarded to the client.

Computer implemented method for transforming an event notification within a database notification infrastructure

Embodiments of the present invention provide one or more hardware-friendly data structures that enable efficient hardware acceleration of database operations. In particular, the present invention employs a column-store format for the database. In the database, column-groups are stored with implicit row ids (RIDs) and a RID-to-primary key column having both column-store and row-store benefits via column hopping and a heap structure for adding new data. Fixed-width column compression allow for easy hardware database processing directly on the compressed data. A global database virtual address space is utilized that allows for arithmetic derivation of any physical address of the data regardless of its location. A word compression dictionary with token compare and sort index is also provided to allow for efficient hardware-based searching of text. A tuple reconstruction process is provided as well that allows hardware to reconstruct a row by stitching together data from multiple column groups.

Accessing data in column store database based on hardware compatible data structures

A method of using a plurality of subscriber types in managing a message queue of a database management system is described and provided. The method comprises creating a subscriber with a set of rules to the message queue. The subscriber is designated as one or more of the plurality of subscriber types. Moreover, an event notification registration representing a request to be notified if a message to the message queue satisfies the set of rules may be created. In response to a new message for enqueuing to the message queue, it is determined whether the new message satisfies the set of rules. If the new message satisfies the set of rules and if so determined by a triggered event notification registration, a notification is performed according to the triggered event notification registration. A requirement that a receiver of the notification dequeue the new message from the message queue depends on the subscriber type designation.

Method of using a plurality of subscriber types in managing a message queue of a database management system

A computer implemented method and system for automatically removing an event registration within an event notification infrastructure of a database system is disclosed. The method includes removing an event registration from an event queue automatically if a specified active period of time has elapsed. Further, the method includes removing an event registration from an event queue automatically if the event occurred N times where N can be specified at event registration. Also, the method includes removing an event registration from an event queue automatically if either the event occurred N times where N can be specified at event registration or a specified active period of time has elapsed. Moreover, the method includes removing an event registration from an event queue if a client explicitly requests removal of said event registration.

Computer implemented method for removing an event registration within an event notification infrastructure

Embodiments of the present invention provide fine grain concurrency control for transactions in the presence of database updates. During operations, each transaction is assigned a snapshot version number or SVN. A SVN refers to a historical snapshot of the database that can be created periodically or on demand. Transactions are thus tied to a particular SVN, such as, when the transaction was created. Queries belonging to the transactions can access data that is consistent as of a point in time, for example, corresponding to the latest SVN when the transaction was created. At various times, data from the database stored in a memory can be updated using the snapshot data corresponding to a SVN. When a transaction is committed, a snapshot of the database with a new SVN is created based on the data modified by the transaction and the snapshot is synchronized to the memory. When a transaction query requires data from a version of the database corresponding to a SVN, the data in the memory may be synchronized with the snapshot data corresponding to that SVN.

Methods and systems for real-time continuous updates

Techniques for managing messages in computer systems are provided. In one embodiment, in response to a publisher attempting to enqueue a message in a queue, a determination is made whether a condition is satisfied. The condition is based on the current usage of the queue by the publisher. Based on whether the condition is satisfied, a decision is made whether to enqueue the message in the queue. The decision whether to enqueue the message may comprise restricting the publisher from enqueueing any more messages in the queue until the same or a different condition is satisfied.

Publisher flow control and bounded guaranteed delivery for message queues

Embodiments of the present invention provide for batch and incremental loading of data into a database. In the present invention, the loader infrastructure utilizes machine code database instructions and hardware acceleration to parallelize the load operations with the I/O operations. A large, hardware accelerator memory is used as staging cache for the load process. The load process also comprises an index profiling phase that enables balanced partitioning of the created indexes to allow for pipelined load. The online incremental loading process may also be performed while serving queries.

Fast batch loading and incremental loading of data into a database

Accessing data in a column store database based on hardware compatible data structures

Fast bulk loading and incremental loading of data into a database

A method of optimizing propagation of non-persistent messages from a source database management system (DBMS) to a destination database management system (DBMS) is described and provided. The method comprises receiving one or more nonpersistent messages from a source non-persistent message queue of the source DBMS at a destination non-persistent message queue of the destination DBMS. The nonpersistent messages are consumed from the destination non-persistent message queue such that consumed non-persistent messages are removed from the destination non-persistent message queue. Further, at least a portion of the non-persistent messages are spilled from the destination non-persistent message queue to a destination persistent message queue of the destination DBMS based on at least one parameter selected from a group consisting of a sparseness factor, number of nonpersistent messages in the destination non-persistent message queue, and amount of memory resources utilized by the destination non-persistent message queue. Moreover, to the source DBMS is sent an acknowledgment including a watermark indication of consumed non-persistent messages from the destination non-persistent message queue. Spilled non-persistent messages are characterized as consumed.

Method of optimizing propagation of non-persistent messages from a source database management system to a destination database management system

Growing community of inventors

Sunnyvale, CA, United States of America

Kapil Laxmikant Surlaker