Abstract:
A method and apparatus queries a table in a database where the table includes at least one column declared to be sparse. A binary large object may be used to store the sparse column data. The object includes a column-id and column-value pair for each non-null value. To answer a query with a constraint on a sparse column, the object is searched for one or more column ids to obtain the column values. Rows whose column values match a constraint are returned. In another embodiment, an internal table is used. Each tuple in the internal table has a column id and a value array indexed by an ordinal row number. To answer a query with a constraint on a sparse column, the column value in the internal table is found and matched against the constraint. If the match is successful, the index of the column value in the internal table is returned.
Abstract:
Techniques for automatically migrating documents from a document database to a relational database are provided. In one technique, it is determined whether a set of documents, from a document database system, can be stored in a relational database system. If so, one or more entities to be normalized are identified based on a hierarchical structure of the set of documents. One or more scripts are generated based on the identified one or more entities. In a related technique, a set of documents from a document database system is stored. It is validated that the set of documents can be converted to one or more duality views. Data of the set of documents is normalized for storing in a relational database system. A script is generated that, when executed, generates the one or more duality views.
Abstract:
Techniques support graph pattern matching queries inside a relational database management system (RDBMS) that supports SQL execution. The techniques compile a graph pattern matching query that includes a bounded recursive pattern query into a SQL query that can then be executed by the relational engine. As a result, techniques enable execution of graph pattern matching queries that include bounded recursive patterns on top of the relational engine by avoiding any change in the existing SQL engine.
Abstract:
When a coordinator of a sharded DBMS receives from a client a query that has an XML operator that references a column in a sharded table and returns an XML image having an XML image type, then the coordinator issues a remote query that uses a new operator to ensure that the shard returns a TBX BLOB having a TBX type. In response to receiving the remote query with the new operator, each shard extracts a binary large object (BLOB) out of the XML image at the shard and returns the TBX BLOB data to the coordinator. In addition, the sharded DBMS provides a make-XML operator that the coordinator uses to work with the TBX BLOB received from each shard and recreate an XML type image, which is the result that the client expects.
Abstract:
An RDBMS specifies a graph algorithm function (GAF) that takes a graph object as input and returns a logical graph object as output. GAFs are used within graph queries to compute temporary and output properties (“GAF-computed properties”), which are live for the duration of the query cursor execution. GAF-computed output properties are accessible in the enclosing graph pattern matching query as though they were part of the input graph object of the GAF. Temporary cursor-duration tables are generated for the query cursor during compilation of a graph query that includes a GAF, and are used to store the GAF-computed properties. Each temporary table corresponds to one of the primary tables of the input graph, and includes, as a foreign key, primary key information from the corresponding primary table.
Abstract:
Techniques described herein allow a user of an RDBMS to specify a graph algorithm function (GAF) declaration, which defines a graph algorithm that takes a graph object as input and returns a logical graph object as output. A database dictionary stores the GAF declaration, which allows addition of GAFs without changing the RDBMS kernel. GAFs are used within graph queries to compute output properties of property graph objects. Output properties are accessible in the enclosing graph pattern matching query, and are live for the duration of the query cursor execution. According to various embodiments, the declaration of a GAF includes a DESCRIBE function, used for semantic analysis of the GAF, and an EXECUTE function, which defines the operations performed by the GAF. Furthermore, composition of GAFs in a graph query is done by supplying, as the input graph argument of an outer GAF, the result of an inner GAF.
Abstract:
We describe a system that performs prognostic-surveillance operations based on an inferential model that dynamically adapts to evolving operational characteristics of a monitored asset. During a surveillance mode, the system receives a set of time-series signals gathered from sensors in the monitored asset. Next, the system uses an inferential model to generate estimated values for the set of time-series signals, and then performs a pairwise differencing operation between actual values and the estimated values for the set of time-series signals to produce residuals. Next, the system performs a sequential probability ratio test (SPRT) on the residuals to produce SPRT alarms. When a tripping frequency of the SPRT alarms exceeds a threshold value, which is indicative of an incipient anomaly in the monitored asset, the system triggers an alert. While the prognostic-surveillance system is operating in the surveillance mode, the system incrementally updates the inferential model based on the time-series signals.
Abstract:
Techniques described herein allow a user of an RDBMS to specify a graph algorithm function (GAF) declaration, which defines a graph algorithm that takes a graph object as input and returns a logical graph object as output. A database dictionary stores the GAF declaration, which allows addition of GAFs without changing the RDBMS kernel. GAFs are used within graph queries to compute output properties of property graph objects. Output properties are accessible in the enclosing graph pattern matching query, and are live for the duration of the query cursor execution. According to various embodiments, the declaration of a GAF includes a DESCRIBE function, used for semantic analysis of the GAF, and an EXECUTE function, which defines the operations performed by the GAF. Furthermore, composition of GAFs in a graph query is done by supplying, as the input graph argument of an outer GAF, the result of an inner GAF.
Abstract:
Techniques for identifying a root cause of an operational result of a deterministic machine learning model are disclosed. A system applies a deterministic machine learning model to a set of data to generate an operational result, such as a prediction of a “fault” or “no-fault” in the system. The set of data includes signals from multiple different data sources, such as sensors. The system applies an abductive model, generated based on the deterministic machine learning model, to the operational result. The abductive model identifies a particular set of data sources that is associated with the root cause of the operational result. The system generates a human-understandable explanation for the operational result based on the identified root cause.
Abstract:
Techniques are introduced herein for maintaining geometry-type data on persistent storage and in memory. Specifically, a DBMS that maintains a database table, which includes at least one column storing spatial data objects (SDOs), also maintains metadata for the database table that includes definition data for one or more virtual columns of the table. According to an embodiment, the definition data includes one or more expressions that calculate minimum bounding box values for SDOs stored in the geometry-type column in the table. The one or more expressions in the metadata maintained for the table are used to create one or more in-memory columns that materialize the bounding box data for the represented SDOs. When a query that uses spatial-type operators to perform spatial filtering over data in the geometry-type column is received, the DBMS replaces the spatial-type operators with operators that operate over the scalar bounding box information materialized in memory.