Abstract: A method of selecting and presenting content on a first system based on user preferences learned on a second system is provided. The method includes receiving a user's input for identifying items of the second content system and, in response thereto, presenting a subset of items of the second content system and receiving the user's selection actions thereof. The method includes analyzing the selected items to learn the user's content preferences for the content of the second content system and determining a relationship between the content of the first and second content systems to determine preferences relevant to items of the first content system. The method includes, in response subsequent user input for items of the first content system, selecting and ordering a collection of items of the first content system based on the user's learned content preferences determined to be relevant to the items of the first content system.

Abstract: The present disclosure provides systems for instantiating and terminating a MME VNF. The MME VNF is instantiated and/or terminated using an EM, a NM, a VNFM, a VIM, a NFVO and/or a catalog. Instantiating an MME VNF includes on-boarding the VNF package, creating a managed element, executing the enabled VNF package, instantiating the MME VNF instance, creating the MME function and modifying the MME pool to add the MME VNF instance. Terminating the MME VNF includes decommissioning the MME VNF services, modifying the MME pool to remove the MME VNF from the MME pool, and terminating the MME VNF instance.

Abstract: Presented herein are systems and methods for merging and manipulating data from different sources of clinical trial data. Clinical trial data is collected using multiple different ‘forms’ and can be from either a single clinical trial or from multiple clinical trials. In certain embodiments, the systems and methods described herein are provided in the form of an intuitive graphical user interface (GUI) that enables a user to merge and manipulate data from two or more source tables of clinical trial data associated with one or more clinical studies to produce a custom merged table, without having to rely upon complex computer code.

Abstract: Database query optimization method that provides for selective restriction of an operation. A query plan for a query is received. The query plan includes an operation to be executed on a table. The received query plan is traversed to determine at least one table in the query plan having a mapping with a threshold rule and based upon a determination that there is at least one table in the query plan having a mapping with the threshold rule, substituting the operation on the at least one table identified in the query plan to another operation having the mapping with the threshold rule.

Abstract: A stream of tuples is received to be processed by a plurality of processing elements operating on one or more computer processors. Each processing element has one or more stream operators. A first stream operator adds a set number to a first tuple in the stream of tuples. The first tuple having the set number indicates that the first tuple is part of a set of tuples. Each tuple in the set of tuples contains the set number. It is determined to delete the set of tuples, and a set of stream operators deletes tuples containing the set number.

Abstract: Disclosed aspects relate to tuple attribute expiry management in a stream computing environment to process a stream of tuples. A tuple may be received. The tuple may include a tuple attribute that has a first attribute value. An expiry criterion may be determined for the first attribute value of the tuple attribute. An achievement of the expiry criterion for the first attribute value of the tuple attribute may be detected. The tuple attribute related to the first attribute value may be modified. The modification of the tuple attribute may occur in response to detecting the achievement of the expiry criterion for the first attribute value of the tuple attribute.

Abstract: Techniques are described for leveraging column dictionaries of tables for join, group-by and expression evaluation operations. In an embodiment, a table is stored in one or more data units, each data unit's metadata containing dictionaries for stored columns. Rather than storing unencoded column values, the data units may store columns as column vectors of dictionary-encoded values, in an embodiment. When performing a join operation, a matching of values may be performed on the build-side table using the unencoded, unencoded, values stored in the join-key dictionary(s) of the probe-side table, thus, significantly reducing the number of searching and matching operations. In an embodiment, a group-by operation may be executed by performing partial aggregations based on unique group-by key values as stored in the one or more group-by key dictionaries.

Abstract: A system for sorting in a column organized relational database by sorting only key columns in the column organized relational database to reduce memory and CPU usage. The sort may be performed using an in memory sort. After sorting the key columns, the system orders a payload column according to an order indicated by the key columns. The payload column is associated with the key columns in the column organized relational database. The system assesses memory capacity prior to ordering the payload column. Prior to ordering a plurality of payload columns, the system refrains from automatically concatenating the plurality of payload columns, and refrains from automatically de-concatenating any concatenated payload columns after the ordering the plurality of payload columns. The system determines an amount of required memory necessary to order the payload column, and detects an amount of available memory accessible to order the payload column.

Abstract: A system for sorting in a column organized relational database by sorting only key columns in the column organized relational database to reduce memory and CPU usage. The sort may be performed using an in memory sort. After sorting the key columns, the system orders a payload column according to an order indicated by the key columns. The payload column is associated with the key columns in the column organized relational database. The system assesses memory capacity prior to ordering the payload column. Prior to ordering a plurality of payload columns, the system refrains from automatically concatenating the plurality of payload columns, and refrains from automatically de-concatenating any concatenated payload columns after the ordering the plurality of payload columns. The system determines an amount of required memory necessary to order the payload column, and detects an amount of available memory accessible to order the payload column.

Abstract: Disclosed herein are system, method, and computer tangible medium embodiments for generating a relational database model from a model view that provides an estimate for generating query plan for a query on the model view, according to an embodiment. A join model of a model view set on one or more database tables is received. At least one index conversion of the join model is performed, where the index conversion converts at least one index in the join model into at least one leaf node in a relational model tree. At least one join conversion of the join model is performed where the at least one join conversion generates a node in the relational model tree that joins a first and second leaf nodes in the relational model tree. A requested parameter conversion is performed, where the requested parameter conversion includes an attribute or key figure requested by a query.

Abstract: A system for executing a streaming query includes an interface and a processor. The interface is configured to receive a logical query plan. The processor is configured to determine a physical query plan based at least in part on the logical query plan. The physical query plan comprises an ordered set of operators. Each operator of the ordered set of operators comprises an operator input mode and an operator output mode. The processor is further configured to execute the physical query plan using the operator input mode and the operator output mode for each operator of the query.

Abstract: A distributed join is performed with two large data sets that are shuffled on different keys without shuffling the larger data set, even when the distributed join is performed on the key of the smaller data set. A third data set is generated that is shuffled on the key of the smaller data set and includes data associated with the key of the larger data set. The third data set and the smaller data set are joined on the shuffle key of the smaller data set to create a fourth data set that includes the first and second key. The fourth data set is shuffled on the key of the larger data set. The fourth data set and the larger data set are joined on the key of the larger data set to generate a fifth data set that can be shuffled on the key of the smaller data set.

Abstract: The embodiments described herein are configured to annotate engineering record (“ER”) data from database tables and their corresponding attributes for analytics tools consumption and to combine the database tables into one consumable entity that can expose a list of attributes to the customer. Attributes may be converted into standardized attributes based on analyzing attribute data types. This data can then be extracted by analytics tools via the common data reporting layer to generate one or more visualizations at a display of at a user's computer system. Such a solution requires far less technical understanding and implementation logic to enable users to focus on analytics rather than view building.

Abstract: Embodiments of the present disclosure relate to a data analysis system that may receive data comprising a plurality of raw data items from one or more data sources, such as a monitoring agent located in a monitored network. The received data may be scored using one or more scoring rules and/or algorithms, with raw data items satisfying a score threshold designated as “data item leads.” Raw data items associated with a data item lead may be searched and displayed to the user via an interactive user interface. The data analysis system may be used to execute searches and additional enrichments against the received raw data items. The data analysis system may group received raw data items based upon shared attribute values. The data analysis system may be used to categorize received data and construct timelines, histograms, and/or other visualizations based upon the various attributes of the raw data items.

Abstract: Systems and methods for implementing sequenced filter templates to intelligently reduce a dataset to find useful patterns and source data are disclosed. An expert investigative user may configure a filter template comprising a series of filters organized in a sequence desired by the expert user. The filter template can be customized by an end user to reduce a dataset and perform guide investigation of the reduced dataset.

Abstract: A system and method for providing fine-grained access control in a search engine. Access control predicates associated with a search query, including fixed-width and/or variable-width tokens, are received from the search engine, and are formatted in a machine-readable binary format to generate a single byte array. A pre-sorted memory index structure associated with the single byte array is generated, by sorting the access control predicates according to their token width. The pre-sorted memory index structure is merge joined with an uninverted terms index that includes a sorted list of all terms in a field associated with the search query, and a document index mapping each document identifier (ID) to a term ordinal for a specific field.

Abstract: A system and method for managing data storage and data access with querying data in a distributed system without buffering the results on intermediate operations in disk storage.

Abstract: A data management apparatus manages a database that has a plurality of items each of which has item attribute data. The data management apparatus includes determining, when an update request to the database is accepted, whether an item that is designated in the update request is included in the items, adding, when the designated item is not included in the items, the designated item to the items, and setting a definition setting flag included in item attribute data of the designated item to a second state that is different from a first state to which a definition setting flag included in item attribute data of an item approved as an item of the database is set.

Abstract: For a managed network implementing at least one logical router having centralized and distributed components, some embodiments provide a method for processing multicast data messages at a first managed forwarding element (MFE) executing on a first host machine that implements a distributed multicast logical router and multiple logical switches logically connected to the logical router in conjunction with a set of additional MFEs executing on additional host machines. The method replicates multicast data messages received from a source data compute node (DCN), operating on the first host machine, that logically connects to a first logical switch of the multiple logical switches. The method replicates the multicast data message to a set of DCNs in the multicast group in the logical network without routing through a centralized local multicast router.

Abstract: Provided is a database management apparatus, having a processor, a memory, and a storage device, whereby a database which is stored in the storage device is managed, the database management apparatus further comprising: a query acceptance unit which accepts a query to the database; a query execution plan generating unit which generates a query execution plan which includes a database operation which is necessary for executing the accepted query; and a query execution unit which, in executing the accepted query on the basis of the generated query execution plan, dynamically generates a task for executing the database operation, and executes the dynamically generated task. The query execution unit acquires a resource usage state, and, when executing the next database operation, generates a new task on the basis of the resource usage state, and executes the new task in parallel with the task.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for dynamic partition selection. One of the methods includes receiving a representation of a query plan generated for a query, wherein the query plan includes a dynamic scan operator that represents a first computing node obtaining tuples of one or more partitions of a table from storage and transferring the tuples to a second computing node that executes a parent operator of the dynamic scan operator. A partition selector operator is generated corresponding to the dynamic scan operator. A location in the query plan is determined for the partition selector operator. A modified query plan is generated having the partition selector operator at the determined location.

Abstract: In a general aspect, a method includes inserting a record in a partitioned fact table of a star schema data mart. Inserting the record can include determining a first hash value from a first dimension value of the record and determining a first set of candidate partitions from the first hash value. The method can further include determining a second hash value from a second dimension value of the record and determining a second set of candidate partitions from the first hash value. The method can further include comparing the first set of candidate partitions with the second set of candidate partitions to determine a common partition and inserting the record into the common partition.

Abstract: A method, system, and computer-readable medium to define a row scope for a table-based visualization of the multidimensional data set, the row scope specifying a number of dimensions of the multidimensional data set; selectively define at least one data selection of the multidimensional data set to connect to the defined row scope to be visualized in the table-based visualization; and generate an instance of the table-based visualization based on the defined row scope and the defined at least one data selection.

Abstract: Methods and apparatus are disclosed for supporting the addition of new instances of database objects and relationships, for a relational database environment that can be partially represented as a graph of fields (columns) of database tables. For a new instance of a graph element (node or edge) to be spawned, the element is classified into one of several use cases. Each database table is analyzed based on its key and non-key fields, according to use-case-dependent rules, to determine whether it should be augmented with a new entry for the new element instance. If yes, then the database table can be augmented, or can be marked for augmentation upon a subsequent request for a new instance of the graph element. Efficient and reliable growth of large and complex relational databases is enabled. Examples are provided across a wide range of domains. Certain variants are also disclosed.

Abstract: A system and a method are disclosed for exporting a subset of a database from a source system to a target system. The database system identifies a first set of tables and determines the subset of data for these tables for transfer by executing one or more database queries. For example, the first set of tables is selected based on their sizes. The database system identifies a second set of tables for transferring by performing a file copy operation. For example, the remaining set of tables other than the first set of tables is transferred by performing a file copy operation. The database system moves the tables of the first set to a new table space for separating the files storing the first set of tables from the files storing the second set of tables.

Abstract: A central asset registry ties Digital Asset Management (DAM) repositories into a unified system. The central asset registry removes the tracking of asset relationships from the DAMs by gathering asset metadata tags and capturing relationships between assets to provide improved speed, scalability, and flexibility in analyzing and traversing networks of relationships of digital assets. The central asset registry allows the use of a pluggable architecture and tracks and stores multi-dimensional relationships as an asset hierarchy. The asset hierarchy provides a depiction of relationship data between the assets and provides a flexible array of asset types and properties that allows the addition of new assets and new asset types without re-factoring the other data, nodes, and edges. The system also uses asset metadata to create edge relationships between the assets. The central asset registry facilitates queries and retrieval of the media assets.

Abstract: A computer system executes a user-supplied query across multiple relational database tables linked by a common key. A new query form, called a composite join, takes a user-supplied query including one or more terms optionally joined by logical operations, an identification of two or more tables and an identification of a common join key shared across the tables. The composite join applies the query across the tables such that any of the query terms can be matched by any of the tables. A query is performed across all tables for each query term and any join keys associated with matching records from the tables are identified in a set of join keys associated with the respective term. The logical operations are then performed on the resulting sets of join keys to combine the results of the term queries according to the user query.

Abstract: An aspect includes a method for maintaining active queries. The method includes executing a query based on data items in at least two relations in a database. The executing includes outputting a query result and control information associated with the query. The query result and the control information are recorded. A notification that at least one of the data items has been updated subsequent to the executing is received. The query result is modified, responsive to the control information, to reflect the data items that were updated subsequent to the executing.

Abstract: Systems and methods for creating and populating temporary database tables with intermediate data that can be preserved once a database application session ends and used outside of the instant database operation without storing this data in persistent memory are provided. A local temporary database table may be used only in the local instance of a database application, and a global temporary table makes intermediate data available across multiple applications and multiple application instances.

Abstract: The disclosed embodiments provide a system for processing queries of a graph database. During operation, the system executes one or more processes for providing the graph database storing a graph, wherein the graph includes a set of nodes, a set of edges between pairs of nodes in the set of nodes, and a set of predicates. Next, the system receives a query containing a missing value parameter, wherein the missing value parameter designates an attribute in the graph database with a nonexistent value. The system then produces, from the query, a transformed query comprising one or more parameters that do not include the missing value parameter. Finally, the system uses the transformed query and the graph database to generate a result of the query and provides the result in a response to the query.

Abstract: Embodiments are directed towards a method for searching data. The method comprises generating an inverted index that comprises at least one record, wherein the at least one record comprises at least one field name and a corresponding at least one field value. The at least one field name and corresponding value are extracted from time-stamped searchable events that are stored in a field searchable datastore and comprise portions of raw data. The at least one record further comprises a posting value that identifies a location in the field searchable datastore where an event associated with the at least one record is stored. The method further comprises receiving an incoming search query that references a field name. Furthermore, the method comprises generating results to the incoming search query based on the field searchable datastore, wherein the field searchable datastore is directly searchable by the field name.

Abstract: Embodiments comprise a distributed join processing technique that reduces the data exchanged over the network. Embodiments first evaluate the join using a partitioned parallel join based on join tuples that represent the rows that are to be joined to produce join result tuples that represent matches between rows for the join result. Embodiments fetch, over the network, projected columns from the appropriate partitions of the tables among the nodes of the system using the record identifiers from the join result tuples. To further conserve network bandwidth, embodiments perform an additional record-identifier shuffling phase based on the respective sizes of the projected columns from the relations involved in the join operation. Specifically, the result tuples are shuffled such that transmitting projected columns from the join relation with the larger payload is avoided and the system need only exchange, over the network, projected columns from the join relation with the smaller payload.

Abstract: Provided are a system, method and computer program product for redistribution of data in an online shared nothing database, said shared nothing database comprising a plurality of original partitions and at least one new partition.

Abstract: A determination is made as to whether a data type associated with a received logical table definition associated with a database query within a distributed database system differs from a data type associated with a local logical table definition. A data conversion is performed on data retrieved from a locally-stored physical table referenced by the local logical table definition in response to determining that the data types differ. Local data conversion information is created identifying the data conversion performed on the retrieved data in response to performing the data conversion. At least one of the retrieved data and the converted data with the created local data conversion information is forwarded to at least one of a distributed database node and an application-level module.

Abstract: The present disclosure relates to a computer-implemented method for joining two data tables on a join attribute. The data tables have at least a first and a second attribute. The second attribute is the join attribute. The method includes providing a function for associating a computing node to a given record. The function may be used to determine the associated computing node. The records of the two data tables may be distributed to the respective determined computing nodes. The relationship between the values of the first and second attributes may be modelled using a predefined dataset. For each record of the two data tables the values of the first attribute may be re-determined using the corresponding values of the second attribute. The function may be used to re-determine the associated computing node.

Abstract: A plurality of memory maps may be allocated that represents the hash table on a memory device to store keys and values. The memory maps may comprise at least a primary map and a secondary map. A hash table operation may be performed on the primary map based on a first position computed using a first hash function, and if not successful, a bounded linear probing that probes a defined primary probe region in the primary map. Responsive to determining that the hash table operation on the primary map is not successful, the hash table operation may be performed on the secondary map based on a second position computed using a second hash function, and if not successful, a bounded linear probing that probes a defined secondary probe region in the secondary map.

Abstract: A method of searching a relational database table which includes: providing a relational database table having a plurality of rows and columns such that each of the plurality of columns has a column name descriptive of data in the each of the columns; providing a relational database management system (RDBMS) to manage access to the relational database table; providing at least one metadata tag to some of the plurality of columns wherein the metadata tag is a non-hierarchical keyword or term that is assigned to the some of the plurality of columns; responsive to selecting at least one metadata tag and responsive to selecting a search string, searching by a search and join function of the RDBMS columns of the some of the plurality of columns corresponding to the at least one metadata tag in the relational database table to find data matching the search string.

Abstract: A data processing method comprises receiving title interaction data, wherein the title interaction data specifies, an order in which users interacted with a plurality of titles; generating a plurality of statistical models, each statistical model of the plurality of statistical models specifying a plurality of probabilities, wherein the plurality of probabilities represent, for each first title of the plurality of titles and each second title of the plurality of titles, a likelihood that a user will interact with the first title then next interact with the second title; refining the plurality of statistical models based on the title interaction data; determining a plurality of weight values corresponding to the plurality of statistical models for a particular user; identifying, for the particular user, one or more recommended titles of the plurality of titles based on the plurality of weight values and the plurality of statistical models.

Abstract: Disclosed is a method for processing a query in a database management system (DBMS). The method includes: receiving a main query including a subquery; identifying an indication to independently manage a processing result for the subquery in the received main query by parsing the received main query—the indication including storing type information for the processing result of the subquery; determining a storing type for independently storing the processing result for the subquery based on the indication; and storing the processing result for the subquery independently from the processing result for the main query while performing processing for the main query according to the determined storing type.

Abstract: In one aspect there is a method. The method may include associating a query received from an application with a hint, wherein the hint modifies an execution of the query. The method may further include an optimizer to compile the query according to the hint to produce a second query plan. When no hint is associated with the query, the optimizer may produce a first query plan. The method may further include storing the hint in a persistent table to enable state preservation during a database restart or binary upgrade, and/or executing the query using the second query plan.

Abstract: Queries that involve multiple tables in a data warehouse system may be specified through structured query language (“SQL”) statements that include union, order by, and limit clauses. When the tables are partitioned, a query of this type may be processed by forming a query plan in which intermediate results are formed by applying sort and limit operators at the partition level, combining the intermediate results from the partitions, and again applying sort and limit operations. Additional clauses, such as a unique clause, may also be pushed down to the partition level and reapplied at the level of the result set.

Abstract: In one embodiment, a system includes a database operative to maintain a social graph of an online social network, a leader cache layer, a plurality of servers, and a follower cache layer comprising one or more follower cache clusters, where each follower cache cluster maintains at least a portion of the social graph, and where the follower cache layer is operative to receive a command from the servers with instructions for updating a portion of the social graph, send the command to one of the leader cache layers, receive an acknowledgment of the command from one of the leader cache layers and a request to update; and update one or more of the follower cache clusters storing the portion of the social graph associated with the command.

Abstract: Disclosed aspects relate to automated query modification in a database management system (DBMS). A triggering event related to an execution of a query may be detected by an automated query modification engine. A query modification operation may be determined by the automated query modification engine based on a nature of the triggering event. The query modification operation may be determined to debug the triggering event related to the execution of the query. The query modification operation may be carried-out by the automated query modification engine. The query modification operation may be carried-out to modify the query to debug the triggering event related to the execution of the query.

Abstract: Techniques are described for analyzing usage of data stored in a data storage system without accessing the stored data. In some embodiments, workload data indicative of queries executed at the data storage system on stored data is received. This workload data can include query logs generated during execution of the queries. The workload data is processed to identify data elements such as tables, columns, and views associated with the stored data as well as information regarding usage of the identified data elements. Usage can include operations performed on the data elements during execution of the queries. Based on this processing relationships between the identified data elements can be inferred and visualizations generated that convey information regarding usage of the data stored at the data storage system.

Abstract: In one embodiment, a method for improving cardinality estimation of a join predicate between a fact table and an overloaded dimension table is provided. The method includes receiving a dimension table and a fact table in a join predicate of one or more SQL statements. The method further includes identifying a majority of records in the fact table that refer to a subset of records in the dimension table. The method further includes computing a filter factor of the join predicate between the dimension table and the fact table. The method further includes creating a statistical view using one or more relevant portions of the dimension table that are referred to by the fact table.

Abstract: An embodiment of the invention provides a method wherein a database query including a first constraint and additional constraint(s) are received in a first node. Data in the first node that satisfies the first constraint is identified, encoded, and sent to a second node. Encoded data is identified in a mapping table in the second node; and, one or more missing identifiers are identified that include encoded data that is not in the mapping table. The missing identifier is sent to the first node, decoded to retrieve the value of the missing identifier, and mapped to the retrieved value. The mapping of the missing identifier and the retrieved value are sent to the second node. A dictionary in the second node is queried with the retrieved value to identify an identification number for the retrieved value. The missing identifier is mapped to the identification number for the retrieved value.

Abstract: Automated join detection includes: identifying a set of one or more candidate joins of a first table and a second table; evaluating a set of one or more quality measures corresponding to the set of one or more candidate joins; obtaining a set of one or more selected joins among the set of one or more candidate joins, the set of one or more selected joins being selected based at least in part on one or more corresponding quality measures; and generating a joined table, including by joining the first table and the second table according to a selected join.

Abstract: Described are methods, systems and computer-readable media storing instructions that when executed on one or more processors execute a process for generating second program code in a statically typed programming language from first program code in a dynamically typed programming language. The first program code contains or, when executed, generates or operates on a dynamically typed array. The second program code may be generated by classifying the dynamically typed array into one of multiple categories, such as homogeneous, heterogeneous, or another, based on the array contents, array usage, and/or user input, and generating the second program code in the statically typed programming language based on the classification(s).

Abstract: A computer-implemented method for partitioning data for a query operation of one table of the database system is provided. The computer-implemented method comprises estimating a value distribution of the attribute in the result table based on a first value distribution of the attribute in the first column of the first table. The computer-implemented method further comprises determining boundaries for partitioning ranges of the attribute, based on the estimated value distribution, wherein the partitioning ranges correspond to a same number of rows of the result table. The computer-implemented method further comprises partitioning the first table with processing nodes of the query operation, based on the determined boundaries of partitioning ranges.

Abstract: An accelerator intermediary node (AIN) associated with a data store obtains an indication of a control setting to be applied with respect to a write request directed to a data item, where the control setting specifies a target for one or more of replication count, data durability, a transaction grouping with respect to a write request, or back-end synchronization node. Using the control setting, a write propagation node set is identified for the write request. The write propagation node set includes another accelerator intermediary node and/or a storage node of a data store. Respective operation requests corresponding to the write request are transmitted to one or more members of the write propagation node set. A write coordinator role may be verified prior to attempting a commit together of a plurality of write requests as part of a multi-write transaction.