摘要:
Aspects described herein relate to partitioning multiple data tuples stored in a database system to multiple partitions based on multiple partition keys. The multiple data tuples can be assigned to multiple partitions such that each partition of the multiple partitions includes a portion of the multiple data tuples having same values for at least one of the multiple partition keys. A set of exceptions can be generated including data tuples having a first value of at least a first one of the multiple partition keys that is the same as the same value of a first portion of data tuples assigned to a first one of the multiple partitions, and a second value of at least a second one of the multiple partition keys that is the same as the same value of a second portion of data tuples assigned to a second one of the multiple partitions.
摘要:
A building system of a building including one or more memory devices having instructions thereon, that, when executed by one or more processors, cause the one or more processors to manage a plurality of entitlements for a plurality of subscriptions of one or more buildings with a building entitlement model, receive a first request to perform a first operation for a first subscription and a second request to perform a second operation for a second subscription, and implement the first operation on first computing resources of a first zone based on the building entitlement model in response to a first determination that the first subscription has the first entitlement and implement the second operation on second computing resources of the second zone based on the building entitlement model in response to a second determination that the second subscription has the second entitlement.
摘要:
A method includes accessing a schema that specifies relationships among datasets, computations on the datasets, or transformations of the datasets, selecting a dataset from among the datasets, and identifying, from the schema, other datasets that are related to the selected dataset. Attributes of the datasets are identified, and logical data representing the identified attributes and relationships among the attributes is generated. The logical data is provided to a development environment, which provides access to portions of the logical data representing the identified attributes. A specification that specifies at least one of the identified attributes in performing an operation is received from the development environment. Based on the specification and the relationships among the identified attributes represented by the logical data, a computer program is generated to perform the operation by accessing, from storage, at least one dataset having the at least one of the attributes specified in the specification.
摘要:
A building system including one or more memory devices having instructions stored thereon, that, when executed by one or more processors, cause the one or more processors to receive an event from an event source, the event comprising data and a timestamp. The building system operates to identify first contextual data describing the event in a digital twin, the digital twin comprising a virtual representation of a building, enrich the event with the first contextual data, and provide the enriched event to a consuming system, the consuming system generating an output event based on the enriched event. The building system operates to identify second contextual data describing the output event in the digital twin, enrich the output event with the second contextual data, and provide the enriched output event to the consuming system or another consuming system.
摘要:
Systems, apparatuses and methods may provide for technology that conducts a traversal of a directed graph in response to a query, retrieves the plurality of vectors from a dynamic random access memory (DRAM) in accordance with the traversal of the directed graphs, wherein each vector in the plurality of vectors is compressed, decompresses the plurality of vectors, determines a similarity between the query and the decompressed plurality of vectors, and generates a response to the query based on the similarity between the query and the decompressed plurality of vectors.
摘要:
A building system including one or more memory devices having instructions thereon, that, when executed by one or more processors, cause the one or more processors to receive an event from an event source, the event indicating a data value associated with the event source occurring at a particular time. The instructions cause the one or more processors to identify contextual data of a database that provides a contextual description of the event, generate an enriched event by enriching the event with the contextual data, the enriched event including the data value, the particular time, and the contextual data, and provide the enriched event to a consuming application configured to operate based on the enriched event.
摘要:
Distributed query processing is often performed by a set of nodes that apply MapReduce to a data set and materialize partial results to storage, which are then aggregated to produce the query result. However, this architecture requires a preconfigured set of database nodes; can only fulfill queries that utilize MapReduce processing; and may be slowed down by materializing partial results to storage. Instead, distributed query processing can be achieved by choosing a node for various portions of the query, and generating customized code for the node that only performs the query portion that is allocated to the node. The node executes the code to perform the query portion, and rather than materializing partial results to storage, streams intermediate query results to a next selected node in the distributed query. Nodes selection may be involve matching the details of the query portion with the characteristics and capabilities of the available nodes.
摘要:
A method receives a query containing at least a statement, and analyzes the statement to determine a query structure of elements forming the statement. The text of the statement is formatted to reflect the query structure. The formatted text is replaced with an equivalent tree of logical blocs representing the statement in a higher level. The representation of one or more of the logical blocks is shortened. A data flow tree of macro operation nodes is generated based on the logical blocks for presentation to a user.
摘要:
Embodiments of the present invention include storing a plurality of subtrees in a database, the plurality of subtrees representing one or more structured documents. At least one subtree has a birth timestamp indicating a time at which the at least one subtree was created. If a subtree has been obsoleted, the subtree has a death timestamp indicating a time at which the subtree was obsoleted. Embodiments further include receiving a database query comprising a query string and a query timestamp, the query timestamp indicating a historical time for which the query is to apply, and determining an intermediate result list of subtrees. The intermediate result list is filtered to generate a final result list responsive to the database query, the filtering comprising removing subtrees that do not have a birth timestamp, have a birth timestamp later than the query timestamp, or have a death timestamp earlier than the query timestamp.
摘要:
The SQL Algebrizer of the present invention comprises a plurality of algorithms to “algebrize” SQL Trees to QP Algebra using an approach that is more consistent and much more efficient than typical algebrizers. More specifically, the Algebrizer of the present invention processes a SQL Tree using a reduced number of recursive depth-first passes by performing multiple operations in a single pass. Furthermore, the Algebrizer of the present invention also performs the operation of constant folding in this single, multi-operation pass so that the QP, upon receiving the QP Algebra, needs not perform this operation at all.