Abstract: Implementations described herein relate to systems and methods to configure a data warehouse system.

Abstract: A method may include generating, based at least on an analysis plan, a logical plan, the analysis plan specifying one or more operations performed on data stored in a polystore that includes a first database management system and a second database management system. The logical plan may include a sequence of logical operators corresponding to the operators specified by the analysis plan. The generating of the logical plan may include rewriting the sequence of logical operators by at least reordering, replacing, and/or combining one or more logical operators in the sequence of logical operators. Candidate physical plans may be generated based on the logical plan. The analysis plan may be executed based on a physical plan selected from the candidate physical plans. Related systems and articles of manufacture are also provided.

Abstract: A computer-implemented method for efficiently performing a database join in a distributed data processing system comprising multiple computational nodes, the method comprising determining a first set of one or more columns of a first database table and a second set of one or more columns of a second database table on which the join is to be performed; estimating a size of the rows of the first table which have a particular combination of values in the first set of columns; computing a salt factor n based on the estimated size of rows and further based on a processing capacity of a computational node of the distributed data processing system; assigning one of n different salt values to each row of the first table having the particular combination of values in the first set of columns; for each row of the second table having the particular combination of values in the second set of columns into n rows, expanding the row into n row, and assigning to each expanded row a different one of the n salt values; and per

Abstract: A computer system stores a database model of an object based on a plurality of updates to the object. Each update indicates a bound status of the update, a transaction date of the update, an effective date of the update, and a value of an attribute in the update. The computer system forms a view model of the object based on the database model of the object by reconstructing values of the attributes of the object from the plurality of updates with immutable bound statuses.

Abstract: Techniques are described for performing session termination(s) for active sessions in response to a planned operation on a database server of a DBMS. In an embodiment, the DBMS receives a request for a planned operation on a database server. The database server may have session(s) established with a client system to receive request(s) to execute database command(s) on the DBMS. In response, the DBMS transmits to the client system a notification to drain a session with the database server, and the DBMS marks the sessions at the database to drain. The DBMS is configured to terminate any drain-marked sessions by the database server when a rule is satisfied, and the failover is expected to succeed, and/or that the session is unlikely to drain or to failover at a later point in the session lifecycle. The DBMS may identify, in a rule set, a rule having rule instructions to detect a possible termination point for the session before the drain timeout period expires.

Abstract: A system, that when operated, creates an index for a database arrangement, wherein the system includes a support server and an indexing server communicably coupled to the database arrangement, wherein the support server: receives a document, metadata pertaining to the document, and a document identifier associated with the document; extracts keywords from the document and store the keywords in a meta-document; stores the document identifier corresponding to the metadata in the database arrangement; and provides, to the indexing server, the meta-document and the document identifier; and wherein the indexing server: receives the meta-document and the document identifier from the support server; extracts keywords from the meta-document; and creates the index, wherein the index includes document identifier listed corresponding to the extracted keywords.

Abstract: A data interpretation apparatus including a platform configured to automatically execute type conversion of an object. The platform is provided in a control unit of the data interpretation apparatus, and includes an obtaining unit and an interpretation unit. The obtaining unit obtains input data as the object of the platform. The interpretation unit generates an initial graph with respect to the object, and performs interpretation by automatically growing a graph from the initial graph while executing, as necessary, the type conversion of the object associated with each node of the graph toward extension or toward intension.

Abstract: Methods, processing units, and computer-readable media in a cloud-based database are described. Redo log records are applied to a page at a database replica only when an updated version of the page is requested at the database replica. A log cache may be used by a replica node of the database to track recent redo log records applicable to a given page. The recent redo log records stored in the log cache may be applied to update the page on-demand when an updated version of the page is requested. By applying only the redo log records applicable to pages that are currently being requested, processing resources may be used only to generate pages that are currently required. Methods for registering redo log records into the log cache by the master or replica server are also described.

Abstract: The source code of a smart contract defines a schema with a map name, a key-tuple, and a value-tuple. The key-tuple can be populated with a value associated with a native field name that is associated with the principal that created a transaction.

Abstract: The present disclosure provides a system for performing a method for scaling one or more query processes elastically. The method includes a first step of receiving a request for running the one or more query processes concurrently. In addition, the method includes another step of pre-determining amount of space required for efficient operation and processing of the one or more query processes. Further, the method includes yet another step of creating one or more virtual spaces in a query space outside the data space for efficient running of the one or more query processes. Furthermore, the method includes yet another step of decompressing compressed data stored in the one or more memory regions of the data space requested by the one or more query processes. Moreover, the method includes yet another step of compressing decompressed data present in the virtual space of the one or more virtual spaces.

Abstract: A method for storing serialized structured data generically in a standardized serialized data structure. The method includes obtaining structured data that includes one or more field pairs and transcoding the structured data into serialized self-describing data. Each field pair includes a corresponding field identifier and a field value associated with the corresponding field identifier. The serialized self-describing data includes one or more self-describing data portions each representing a corresponding one of the one or more field pairs. Each self-describing portion of the one or more self-describing portions includes a first series of bits representing the corresponding field identifier, and a second series of bits representing the field value associated with the corresponding field identifier. The method also includes transmitting the serialized self-describing data to a remote entity.

Abstract: Techniques for executing show commands are described herein. A plurality of navigation steps is utilized, each navigation step corresponding to a different layer in a database structure and each navigation step including an operator to fetch items from a metadata database up to respective bounded limits. Dependency information is also fetched for objects of the specified object type in the show command. After a set of objects from the last layer are processed, memory for the navigation steps is flushed and the next set of objects are processed.

Abstract: Embodiments of this application provide a data synchronization method and apparatus in a distributed system, a computer-readable medium, and an electronic device. The method includes: obtaining historical data synchronization information of adjacent nodes connected to a target node and determining selection weight values of the adjacent nodes according to the historical data synchronization information. The selection weight values are used for measuring efficiency of the adjacent nodes synchronizing data to the target node to select, according to the selection weight values of the adjacent nodes, a target adjacent node for synchronizing data to the target node. Target data is synchronized from the selected target adjacent node with the target node.

Abstract: In some examples, a database system identifies a plurality of query portions in a database query that contain references to a first external table, the first external table being based on data from a remote data store coupled to the database system over a network. The database system creates a common spool portion that includes projections and selections of the plurality of query portions, and rewrites the plurality of query portions into rewritten query portions that refer to a spool containing an output of the common spool portion. For execution of the database query, the database system determines, as part of optimizer planning, whether to use the plurality of query portions or the common spool portion and the rewritten query portions.

Abstract: Embodiments of the present disclosure are directed to systems, methods, and computer product programs to identify one or more seminal cases within a database containing legal case data. The disclosed systems and methods provide an approach to identify one or more seminal cases for particular legal issues by mining a text database containing electronic legal documents for the reasons for citing and mining the text within to determine whether the legal issue addressed in the reasons for citing is directed to a seminal case. The data is created through data mining and obtained from the plurality the reasons for citing identifying the seminal cases for a particular legal issue such that the output data corresponding to the seminal cases causes an external device to distinguish the seminal cases when one or more of the seminal cases are returned as the result of a search.

Abstract: Systems and methods for managing recent data items in a database. A method typically includes determining whether a data object managed by an on demand service is designated as able to be accessed by a user at a mobile device and storing locally at a mobile device a plurality of most recently used items viewed for a data object designated as able to be accessed by a user at a mobile device. The method also typically includes determining a single most recently used set from among the stored plurality of most recently used items viewed for at least one data object designated as able to be accessed by a user at a mobile device.

Abstract: A system described herein may provide a technique for the compression of query terms and search data against which the query terms may be evaluated. The compression may be dynamic, in that a quantity of bits used to compress the search data and query terms may be based on a quantity of unique characters included in a given query term. The compression may further include reducing the volume of search data by compressing entire words, that do not include any of the unique characters of the query term, to one particular code.

Abstract: A method for processing of a data stream using a graph-based data model includes receiving a data stream including data messages; disassembling the data messages data elements and metadata; generating a structured data model comprising the set of data elements based on the type of the data elements and the pattern of the data messages; instantiating a workflow to process the structured data model; configuring a CPS-G model sub-graph to add to the CPS-G model based on the type of the data elements and the pattern of the data messages; adding the CPS-G model sub-graph to the CPS-G model to form the CPS-G dataset; and storing the CPS-G dataset including the CPS-G model sub-graph in a data store for further processing by streaming computation and machine learning algorithms.

Abstract: Systems and methods are described for determining a query execution time in a data intake and query system. The system parses a query to identify different portions of the query that are executed by different components of the data intake and query system. The system determines a query execution time for the different portions of the query based on the corresponding components. Based on the query execution time of the different portions for the query, the system determines a query execution time for the query.

Abstract: The present technology pertains to synchronizing contents of a directory external to a synchronized directory by a content management system. The content management system is configured to synchronize only objects in the synchronized directory. Accordingly, the present technology creates an anchor object that represents the directory external to the synchronized directory within the synchronized directory. The anchor object includes special attributes that indicate to the synchronization client that the anchor object represents an external directory, and allows the contents of that directory to be synchronized directly to a server on the content management system without first storing the contents of the external directory on the hard drive of the client device.