Abstract: The techniques described herein enable a private connectivity solution between a virtual network of a service consumer and a virtual network of a service provider in a cloud-based platform. The techniques map a service (e.g., one or more workloads or containers) executing in the virtual network of the service provider into the virtual network of the service consumer. The mapping uses network address translation (NAT) that is performed by the cloud-based infrastructure. As a result of the techniques described herein, a public Internet Protocol (IP) address does not need to be used to establish a connection thereby alleviating privacy and/or security concerns for the virtual networks of the service provider and/or the service consumer that are hosted by the cloud-based platform.

Abstract: A system and method for a text search of a database. A text search expression is converted to a query plan having multiple search tokens. A one-pass indexing of an invested word index filters the inverted word index based on a search condition and identifies the applicable documents having the multiple search tokens.

Abstract: Examples disclosed herein relate to a database comparison operation to identify an object. For example, a processor may enroll a set of object templates in a storage based on objects within input content and enroll a target object template in the storage based on a target object in target content. The processor may identify an object within the input content associated with the target object based on a database comparison operation of the stored set of object templates to the stored target object template. The processor may output object recognition information related to the identified object.

Abstract: According to an example, dynamic function invocation may include ascertaining a query for a database management system (DBMS). Dynamic function invocation may further include implementing a dynamic function as a meta user defined function to invoke a plurality of different coded functions including a coded function that is to be invoked by the query to perform an operation related to the DBMS, and executing the dynamic function by the query to load and invoke the coded function to perform the operation related to the DBMS.

Abstract: Examples disclosed herein relate to accessing electronic databases. Some examples disclosed herein may include partitioning a computation task into subtasks. A processing node of a computation engine may generate a database query for retrieving an electronic data segment associated with at least one of the subtasks from a database. The database query may include pre-processing instructions for a database management system (DBMS) associated with the database to pre-process the electronic data segment before providing the electronic data segment to the processing node. The pre-processing instructions may include at least one of: filtering, projection, join, aggregation, count, and user-defined instructions. The generated query may be provided to the DBMS.

Abstract: Example embodiments relate to parallelizing structured query language (SQL) user defined transformation functions. In example embodiments, a subquery of a query is received from a query engine, where each of the subqueries is associated with a distinct magic number in a magic table. A user defined transformation function that includes local, role-based functionality may then be executed, where the magic number triggers parallel execution of the user defined transformation function. At this stage, the results of the user defined transformation function are sent to the query engine, where the query engine unions the results with other results that are obtained from the other database nodes.

Abstract: A system and method for a text search of a database, including converting a text search expression to a query plan and implementing the text search as the query plan on the database. The implementing of the text search includes a one-pass indexing as a single scan of an inverse index table associated with the database.

Abstract: Methods, devices, and techniques for base user defined functions in a database management system are discussed herein. For example, in one aspect, a query request is received from a computer device. The query request may include a query operator representing a specialized user defined function (SUDF). The SUDF may then be executed. Executing the SUDF may include executing a base operation of a base user defined function (BUDF). The base operation may interact with an application programming interface (API) of the query engine to obtain a tuple stored in the database. Executing the SUDF may further include executing a specialized operation that processes the tuple according to an analytics function. The specialized operation may generate a result. Then, a query result may be returned to the computer device. The query result can include the result.

Abstract: The techniques described herein enable a private connectivity solution between a virtual network of a service consumer and a virtual network of a service provider in a cloud-based platform. The techniques map a service (e.g., one or more workloads or containers) executing in the virtual network of the service provider into the virtual network of the service consumer. The mapping uses network address translation (NAT) that is performed by the cloud-based infrastructure. As a result of the techniques described herein, a public Internet Protocol (IP) address does not need to be used to establish a connection thereby alleviating privacy and/or security concerns for the virtual networks of the service provider and/or the service consumer that are hosted by the cloud-based platform.

Abstract: Examples relate to identifying shortest paths. In one example, a computing device may: access an edge table that specifies, for each edge of a graph, an edge source, an edge destination, and an edge distance value; access a current path table that specifies paths between nodes of the graph and, for each path, a source node, a destination node, a distance, and a node path; identify each path included in the current path table as a shortest known path; and for each path having a destination node that matches an edge source node, add a new path to the current path table, the new path specifying: the source node as a new source; the edge destination as a new destination; a sum of the edge value and the path distance as a new distance; and the edge destination appended to the node path as a new node path.

Abstract: Example embodiments relate to parallelizing structured query language (SQL) on distributed file systems. In example embodiments, a subquery of a distributed file system is received from a query engine, where the subquery is one of multiple subqueries that are scheduled to execute on a cluster of server nodes. At this stage, a user defined function that comprises local, role-based functionality is executed, where the partitioned magic table triggers parallel execution of the user defined function. The execution of the UDF determines a sequence number based on a quantity of the cluster of server nodes and retrieve nonconsecutive chunks from a file of the distributed file system, where each of the nonconsecutive chunks is offset by the sequence number.

Abstract: Methods, apparatus, systems and articles of manufacture are disclosed to manage a cache. An example method includes in response to receiving a request to retrieve received data, retrieving first data from a cache, the first data received during a first time period, and retrieving second data from a storage device, the second data received during a second time period prior to the first time period; and providing the first data and second data as combined data, the combined data being combined based on the first time period and the second period.

Abstract: A method includes binding a stationed operator to a database query engine, wherein the stationed operator comprises system utilities and an open executor to execute user-supplied application logic. The method further includes receiving an unbounded input stream of input tuples by the stationed operator, the stream of input tuples comprising a succession of chunks. The method also includes applying a query defined by the application logic to each successive chunk of the input stream to produce an output packet for each such chunk, and generating an unbounded output stream comprising the output packets.

Abstract: In one example in accordance with the present disclosure, a method for dynamic lexer object construction includes receiving a grammar rule including a variable and a Boolean function to be performed on a character sequence using the variable. The method includes receiving the character sequence and a value corresponding to the character sequence and constructing a lexer object that includes the value as the variable used by the Boolean function. The method includes parsing the character sequence using the lexer object.

Abstract: An example technique for defining a user function can include receiving a user defined function that gathers data from a data source external to a database and returns the data to the database. The example technique for defining the user function can also include creating an instance of a programming class that extends from an application programming interface (API). The instance of the programming class including the user defined function. The example technique for defining the user function can also include executing the user defined function provided by the instance of the programming class.

Abstract: In-database parallel analytics is disclosed. An example method includes receiving a function in a functional programming environment. The example method includes pushing operations for the function to a database layer for executing the operations. The example method also includes returning results of the operations to the functional programming environment.

Abstract: A technique includes in a relational database query engine, receiving a query associated with a relational data structure. The received query includes a database graph query. The technique includes using the relational database query engine to integrate a result acquired from the graph database engine into a result provided by the relational database query engine to the received query.

Abstract: In one example in accordance with the present disclosure, a method may include separating a list of keywords into a set of word tokens and a set of wildcard tokens. The method may also include removing each wildcard token in the set of wildcard tokens that is inferred by at least one word token in the set of word tokens and removing each wildcard token in the set of wildcard tokens that is inferred by at least one other wildcard token in the set of wildcard tokens. The method may also include executing a search query comprising a new list of keywords that includes each wildcard token not removed from the set of wildcard tokens.

Abstract: A system and method for a text search of a database. A text search expression is converted to a query plan having multiple search tokens. A one-pass indexing of an invested word index filters the inverted word index based on a search condition and identifies the applicable documents having the multiple search tokens.

Abstract: Examples relate to identifying shortest paths. In one example, a computing device may: access an edge table that specifies, for each edge of a graph, an edge source, an edge destination, and an edge distance value; access a current path table that specifies paths between nodes of the graph and, for each path, a source node, a destination node, a distance, and a node path; identify each path included in the current path table as a shortest known path; and for each path having a destination node that matches an edge source node, add a new path to the current path table, the new path specifying: the source node as a new source; the edge destination as a new destination; a sum of the edge value and the path distance as a new distance; and the edge destination appended to the node path as a new node path.