Abstract: A partitioning advisor for online transaction processing (OLTP) workloads generates a workload dependency graph based on a schema defining a structure of a relational database and a workload associated with an OLTP application that accesses the relational database. Based on the workload dependency graph, the partitioning advisor generates one or more partitioning strategy recommendations for sharding the relational database. The partitioning advisor may also render a visualization based on the workload dependency graph, enabling a user to see the impact each recommended partitioning strategy is predicted to have.

Abstract: Embodiments of the invention relate to executing graph path queries. A database stores data entities and attributes in node tables and stores links between nodes in an edge table. Edges form a path between a source node and a target node. A source node set is generated and joined with the edge table to produce a first intermediate set. Similarly, a target node set is generated and joined with the edge table to produce a second intermediate set. A result path is generated through a joining of the first and second intermediate paths and application of a length condition.

Abstract: The optimized inequality join method is a method for joining relational tables on input inequality conditions. The optimized inequality join method is a relatively fast inequality join method using permutation arrays to store positional information for sorted attributed values. Additionally, space efficient bit arrays are used to enable optimization, such as Bloom filter indices, thus providing faster computation of the join results. The method may be used, for example, for joining various inequalities associated with a variety of measured environmental conditions for raising an alarm when certain conditions are met.

Abstract: Techniques are disclosed for generating statistical views in a database system. In one embodiment, a request is received to execute a database workload. One or more constraints pertaining to executing the database workload is retrieved. The database workload is evaluated to generate multiple statistical view candidates. The statistical view candidates are refined based on the one or more constraints. One or more statistical views are then generated based on the refined statistical view candidates.

Abstract: According to an embodiment of the present invention, a system displays initial search results based on a query and enables selection by a user of an item within the search results. The system determines refined search results based on behavior of the user with respect to the initial search results. Embodiments of the present invention further include a method and computer program product for presenting revised search results based on user behavior while examining the results in substantially the same manners described above.

Abstract: In one embodiment, a method of processing a structured query language (SQL) statement is provided, comprising: determining whether a first query and a second query are equivalent, the first and second queries being respectively the left side and the right side operands of the OUTER JOIN operation; determining whether a SELECT output of the SQL statement does not refer to database columns from the left side of the OUTER JOIN operation which are not also partitioning columns of the OUTER JOIN operation; and responsive to determining that the first query and the second query are equivalent and that the SELECT output of the SQL statement does not refer to database columns from the left side of the OUTER JOIN operation which are not also partitioning columns of the OUTER JOIN operation, transforming the SQL statement into an optimized query SQL statement by removing the OUTER JOIN operation.

Abstract: Techniques for modifying a database query are disclosed. A source and/or time associated with an initial database query for execution on a database are determined. A modification of the initial database query is determined based on the source and/or time. The modification includes adding a filter to the initial database query. The modified database query is executed to return a set of results. Optionally, partitions of the database that are relevant to the modified database query may be selected. The modified database query may be executed on only the relevant partitions. The datasets included in the results to the modified database query may be more important, relevant, and/or valuable to a user than the datasets that were excluded based on the filter. The datasets included in the results may be retrieved from faster data storage than the excluded datasets.

Abstract: A query complier analyzes a query to identify a correlated scalar subquery. The query complier transforms the query having the correlated scalar subquery into a query of AGGREGATION INNER/OUTER JOIN or MAX1ROW INNER/OUTER JOIN depending on a result type of the correlated scalar subquery. The AGGREGATION INNER/OUTER JOIN performs JOIN on the rows of the correlated scalar subquery with the rows of a main query and AGGREGATE on the joined rows and returns a result of the joined rows of the main query and aggregation value thereof. The MAX1ROW INNER/OUTER JOIN performs JOIN on the rows of the correlated scalar subquery with the rows of a main query, raises Error when the number of joined rows of the subquery is two or more and returns a result of the row of the main query and the joined row of the subquery.

Abstract: In accordance with disclosed embodiments, there are provided systems, methods, and apparatuses for implementing analytics on-demand functionality.

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: The present invention relates to solving the issues related to subgraph query services with tunable preservation of privacy of structural information. More particularly, it relates to a novel cyclic group based encryption (CGBE) method for private matrix operations.

Abstract: A computer-implemented method, system, and/or computer program product optimizes an order of execution of column join operations. A first partitioning of the first data column splits the first data column into first subsets of rows. A second partitioning of the second data column splits the second data column into a second subsets of rows. Cardinalities of sub-tables derived by a respective joining of the subsets of rows of the first and second data columns are estimated, based on the first and second value frequency information. An order of execution of multiple join operations is then optimized based on the estimated cardinalities of the sub-tables.

Abstract: Techniques and structures for providing a multitenant environment having both a relational database and a non-relational database. A database query is received with at least one server computing device providing a multitenant environment having a relational database system and a non-relational database system, the database query in a format corresponding to the relational database system. The query is parsed with the at least one server computing device to find one or more components of the query directed to data stored in the non-relational database system. One or more components of the query directed to data stored in the non-relational database system are converted to one or more scans of the non-relational database system. Results from the query of the relational database system and results from the one or more scans of the non-relational database system are collected. The results from the query and the results of the one or more scans to a combined result are combined.

Abstract: A method, apparatus, and system for join operations of a plurality of relations that are distributed over a plurality of storage locations over a network of computing components.

Abstract: A computer-implemented method for adaptive search refinement is provided. The method may include obtaining an indication of user engagement with an online marketplace and in response to obtaining the indication, providing visually guided search refinement to construct a search query for searching the online marketplace. Providing the visually guided search refinement may include providing search refinement options, obtaining an indication of the approval or disapproval of one or more of the search refinement options, and repeating providing the search refinement options and receiving the indication. For each iteration of providing the plurality of search refinement options, at least some of the search refinement options may be different and determined based on previously received indications of both approval and disapproval. The method for adaptive search refinement may further include providing search results based on the search query.

Abstract: Methods, computer systems, and stored instructions are described herein for inferring dimensional metadata from content of a query that references tables. A server analyzes the content of the query to determine which table(s) of the referenced tables could be fact tables and/or which table(s) of the referenced tables could be dimension tables. The server transforms the query to a transformed query that operates on a candidate fact table and candidate dimension table(s) of the referenced tables other than the candidate fact table. The transformed query, when executed, processes at least some data from dimension(s) using the candidate dimension table(s) before processing at least some data from the candidate fact table. Alternatively or additionally, the server generates an execution plan that operates on the candidate fact table and the candidate dimension table(s).

Abstract: A method for distributing tables to a cluster of nodes managed by database management system (DBMS), is disclosed. Multiple data placement schemes are evaluated based on a query workload set to select a data placement scheme for the cluster of nodes. Tables, used in join operations in the workload set, are selected for evaluation of data placement schemes. Query execution costs for the workload set are generated based on estimating a query execution cost for each data placement scheme for the tables. The data placement scheme that has least costly estimated execution cost for the workload set is selected as the data placement scheme for the cluster of nodes managed by DBMS.

Abstract: A facility for querying user-defined database columns is described. The facility receives a database query referring to one or more database columns, at least one of the referred-to database columns being a user-defined database column. The facility provides access to a database query result generated for the perceived database query via a programmatic object.

Abstract: An approach for joining operations on document-oriented databases. The approach consists of receiving database identifiers, common attributes and results attributes for core and target databases being joined. Common attributes are searched for in the databases. The searches performed include string, expansive, character and nested. Common attribute join conflicts are identified and input is received to resolve attribute join conflicts. Resolved join conflicts are updated in a join substitution database for subsequent use and joined data results are output to virtual table(s).

Abstract: A method for obtaining sample data includes associating data extracted from an incoming query with a key corresponding to an index table file, downloading data based on a filename, offset, and data range obtained from a table entry corresponding to the key, inserting the downloaded data to an inner join between a query table and a big data table, and obtaining data corresponding to a sample from the inner join.

Abstract: A data analysis method for analyzing data on a data analysis apparatus having: setting, a plurality of dimension tables each having a first identifier for identifying data to be analyzed and attributes corresponding to the first identifier; setting, a history table having a second identifier associated with each of the first identifiers of the dimension tables, and having attributes corresponding to the second identifier; setting, a relation table for storing attributes relating to the first identifier, the dimension tables having a first dimension table associated with the relation table through the attribute relating to the first identifier; associating, the first identifiers that refers to the first identifier of a first dimension table with the attributes; and processing, a query for the relation table and the first dimension table, and generating a second dimension table.

Abstract: In one embodiment, a system includes a database; and a cache layer comprising one or more leader cache nodes, the one or more leader cache nodes operative to: communicate graph information between a follower cache layer and the database; receive a request from one of the follower cache nodes to store graph information in the database; update the database storing the graph responsive to the request; and update one or more of the follower cache nodes storing the portion of the graph associated with the request.

Abstract: A value is distributed in a distributed computing system having a master system in communication with a plurality of worker systems. Partitions of a graph are assigned to the worker systems. The graph represents relationships among a set of tangible items that model a real-world condition having an associated problem. Configuration information is determined that describes a configuration of the distributed computing system. A distribution scheme is selected for distributing a value from the master system to the plurality of worker systems based on the configuration information. The value is distributed from the master system to the worker systems according to the selected distribution scheme. The worker systems are configured to use the value to produce an output representing a solution to the real-world problem.

Abstract: The present disclosure describes methods, systems, and computer program products for dynamic generation and modification of input schemas. One computer-implemented method includes receiving event data from a data source with an event collector, the data source registered with the event collector to transmit event data to the event collector, transmitting the received event data for analysis, saving the transmitted event data, determining whether to create or update a business intelligence view, determining whether to create or update an input schema based on the saved event data, and providing, by a computer, an input schema describing how data is represented in the database to a query generation engine.

Abstract: Systems and methods for dynamic partitioning in a relational database are described herein. A system can be configured to receive a data object definition statement to define a data object, where the data object definition statement associates an expression with the data object, and where the expression defines a correlation between an attribute of the data object and a prospective partition of the data object. The system can then receive a data manipulation statement to manipulate data in the data object, and in response to receiving the data manipulation statement, process the data manipulation statement, where processing includes initiating evaluation of the expression to identify a target partition based on the correlation between the attribute and the prospective partition.

Abstract: Database systems and methods that implement a data aggregation framework are provided. The framework can be configured to optimize aggregate operations over non-relational distributed databases, including, for example, data access, data retrieval, data writes, indexing, etc. Various embodiments are configured to aggregate multiple operations and/or commands, where the results (e.g., database documents and computations) captured from the distributed database are transformed as they pass through an aggregation operation. The aggregation operation can be defined as a pipeline which enables the results from a first operation to be redirected into the input of a subsequent operation, which output can be redirected into further subsequent operations. Computations may also be executed at each stage of the pipeline, where each result at each stage can be evaluated by the computation to return a result. Execution of the pipeline can be optimized based on data dependencies and re-ordering of the pipeline operations.

Abstract: A system and method for processing a database query is described. In response to detection that a database query involves a star or snowflake join operation, a join operator in a preliminary query plan can be split into a build operator and a probe operator. The probe operator can be placed in a final query plan in the same place as the join operator in the preliminary query plan, while the build operator can be placed beneath the probe operator in the final query plan, between an exchange operator and the exchange operator's child from the preliminary query plan.

Abstract: Disclosed herein are system, method, and computer program product embodiments for exporting and importing database tables in a database management system using multi-version concurrency control (MVCC). An embodiment operates by first initiating an export of a database table in the database management system. During the export transaction, temporary creation and deletion timestamps are identified from MVCC information associated with each row in the database table. Each temporary timestamp is associated with a database transaction. A timestamp map is then generated that associates the identified temporary timestamps with commit timestamps of the associated transactions. The database table, associated MVCC information, timestamp map, and snapshot timestamp of the export transaction are written to a binary file.

Abstract: A system and method allowing customization of a user-interface into a data repository are disclosed. Customization options are provided via a hierarchy and/or compartmentalization of structured control files such as Extensible Markup Language (XML) files. The control files may be defined in a hierarchical fashion allowing a particular end-user or group of end-users to customize their interface without impacting other users of the same data and user-interface system. Compartmentalization of functions to specific files may also aid in ease of maintenance of customizations. Customization may include an ability to customize what data is shown on a screen and which capabilities are available on each screen for data interaction pertaining to a particular job responsibility. Capabilities to provide these and other customization options to an end-user are disclosed using an example of an import export trade transaction storage and retrieval system.

Abstract: A query that identifies an input data source is rewritten to contain data parallel operations that include partitioning and merging. The input data source is partitioned into a plurality of initial partitions. A parallel repartitioning operation is performed on the initial partitions to generate a plurality of secondary partitions. A parallel execution of the query is performed using the secondary partitions to generate a plurality of output sets. The plurality of output sets are merged into a merged output set.

Abstract: A semiconductor structure includes a nanocrystalline core comprising a first semiconductor material having a first bandgap, and a nanocrystalline shell comprising a second semiconductor material different than the first semiconductor material at least partially surrounding the nanocrystalline core, the second semiconductor material having a second bandgap greater than the first bandgap.

Abstract: A query of spatial data is received by a database comprising a columnar data store storing data in a column-oriented structure. Thereafter, a minimal bounding rectangle associated with the query is identified using a grid order scanning technique. The spatial data set corresponding to the received query is then mapped to physical storage in the database using the identified minimal bounding rectangle so that the spatial data set can be retrieved. Related apparatus, systems, techniques and articles are also described.

Abstract: A system includes reception of a client query including a JOIN between a local database table of a first computing system and a remote table of a second computing system, transmission of an instruction to the second computing system to define a new table in the second computing system, the new table associated with a storage handler for retrieving data of the local database table, generation of a remote query of the second computing system, the remote query including a second JOIN between the new table and the remote table, transmission of the remote query to the second computing system, and reception of results of the remote query from the second computing system.

Abstract: The present subject matter relates to generation of business intelligence reports with navigable reference indicators. The method comprises obtaining information from an information source for providing in a business intelligence report. Further, report parameters are obtained through a user interface, wherein the report parameters include at least notes and indicator parameters. The notes and indicator parameters indicate a plurality of navigable reference indicators to be included in the business intelligence report. The method further comprises mapping the notes and indicator parameters with the obtained information. Based on the mapping, the business intelligence report is generated with the plurality of navigable reference indicators. Further, the plurality of navigable reference indicators provides a forward and backward link between two or more sections of the business intelligence report.

Abstract: The present disclosure describes methods, systems, and computer program products for performing JOIN value comparisons. One computer-implemented method includes converting, by operation of a computer system, a first value of a first data type into a second value of a second data type, wherein the first value is a value of a first attribute of a first table; converting, by operation of a computer system, the second value of the second data type into a third value of a third data type; converting, by operation of a computer system, a fourth value of the third data type into a fifth value of the second data type, wherein the fourth value is a value of a second attribute of a second table; converting, by operation of a computer system, the fifth value of the second data type into a sixth value of the first data type; and performing JOIN operations of the first table and the second table in response to determining that the first value equals the sixth value, and the fourth value equals the third value.

Abstract: A processor-implemented method retrieves information from a database system. A data query, which includes a specification of information to be retrieved from the database system, is generated. A first parameter specifying a condition to be met by the retrieved information is defined. A second parameter specifying one or more data reduction operations to be executed if the condition defined by the first parameter is not met is defined. The generated data query and the first and second parameters are then transmitted to the database system.

Abstract: Techniques for enabling fault tolerant distributed query processing are provided. In one embodiment, a first processing node in a plurality of processing nodes can execute an instance of a query operator, where the query operator is part of a query plan for a database query that is processed in a distributed manner by the plurality of processing nodes. The first processing node can further generate a snapshot of the instance of the query operator, where the snapshot includes state information usable for moving execution of the query operator from the first processing node to another processing node after a failure of the first processing node. The first processing node can then save the snapshot to a distributed data store.

Abstract: A system includes identification of two or more information models of a database schema, where each of the two or more information models includes a plurality of dimensions and a respective measure, and is not joined to any other of the two or more information models, generation, for each of the two or more information models, of an auto join on a dimension included in the information model, reception of an object-based query including one or more objects of the two or more information models, generation of one structured language query for each of the two or more information models, obtaining of a result set for each of the two or more structured language queries, and aggregation of the result sets into an aggregated result set.

Abstract: The present disclosure describes methods, systems, and computer program products for generating data for performance evaluation. One computer-implemented method includes identifying a source dataset from a source database, extracting a schema defining the source database, analyzing data within the source dataset to generate a value model, the value model describing features of data in each column of each table of the source dataset, analyzing data within the source database to determine data dependency, and generating a data specification file combining the extracted schema, the value model, and the data dependencies.

Abstract: A computer-based method for optimizing database queries is provided. The method uses a server computer device including a processor communicatively coupled to a database. The method includes receiving a main query requesting data from a partitioned database table within the database. The partitioned database table includes a plurality of partitions. The method also includes determining a partition list. The partition list includes two or more partitions of the plurality of partitions and excludes at least one partition of the plurality of partitions. The method further includes generating a plurality of sub-queries where each sub-query is associated with one partition included within the partition list, and processing each sub-query of the plurality of sub-queries on the associated partition included within the partition list.

Abstract: The present invention provides a centralized system and method for accessing, organizing, personalizing, and managing structured content located in disparate structured content systems. Structured content embedded within a particular system may be organized with structured content from other structured content systems. A processing module accesses the structured content located in the structured content systems using a conduit application programming interface. The processing module uses a display application programming interface to communicate with requesting systems. Metadata regarding the structured content is stored in a repository and the structured content may be used and viewed on a plurality of requesting systems.

Abstract: The invention relates to systems, methods, and computer program products for rule-based maintenance of an archive. A system is provided that includes: a computing platform including a processor and a storage device, a database comprising rules relating to maintenance of information stored in an archive, a software module stored in the storage device comprising executable instructions that when executed by the processor cause the processor to: (a) receive information related to at least one event; (b) compare the information related to the at least one event to the rules relating to maintenance of information stored in the archive; and (c) determine whether to update information stored in an archive based at least partially on the comparison of the information related to the at least one event and the rules relating to maintenance of information stored in the archive.

Abstract: A database system optimizes database queries that comprise subqueries. The database system factors out computation from two or more subqueries to a reusable subquery. The reusable subquery returns a result set. The subqueries are rewritten to use the result set and the database query modified to use the rewritten subqueries. The modified database query performs efficiently since the result set is computed only once for each subquery that uses the reusable query. The database system also composes nested subqueries that compute aggregate values. The database system identifies an inner subquery nested within an outer subquery, each subquery computing an aggregate value. The database system determines a new aggregate function corresponding to a composition of aggregate functions of the inner and the outer queries. The database system determines a composed query using the inner query with the outer query. The composed query uses the new aggregate function.

Abstract: A nested database query can be optimized by effectively representing a filtering function or operation (e.g., SQL filtering operation) of its outer sub-query by a qualification or qualify operation (e.g., SQL qualification operation) associated with at least one windowing function of at least one of its inner sub-queries. It will be appreciated that this representation can yield a modified query that would be equivalent (e.g., semantically equivalent) to the original nested query as its execution can produce the same results when optimization rules are applied.

Abstract: A system, computer-implemented method, and a computer-readable storage medium for a traversal of a property graph, are provided. The edge table of the property graph is divided into a plurality of fragments. A first fragment is selected for traversal using a set of selected vertices, where the traversal identifies a set of edges. Based on the set of edges, a set of adjacent vertices is determined during the traversal. A set of discovered vertices in the property graph is determined based on the set of selected vertices and the set of adjacent vertices.

Abstract: Systems and methods are provided to evaluate a search engine using search results retrieved from a plurality of different search engines. For example, a controller can randomly distribute a set of pre-formulated queries to a plurality of computers to query the search engines at random times to obtain search results and combine the search results to evaluate the completeness of a query result provided by a particular search engine. The controller may simulate the random queries from users using a set of computers and may reduce the burden on the search engines by spreading out the query activities over a period of time, such as a month.

Abstract: A method for providing user-customized contents, includes: receiving contents order information from a user and constructing a contents order information DB; opening the contents order information DB; receiving contents corresponding to the contents order information from a contents provider; and providing the received contents in a user-customized form.

Abstract: Methods, systems, and computer-readable storage media for user-guided multi-schema integration and include actions of receiving a plurality of schemas, each schema defining a data structure and including a plurality of intermediate elements and a plurality of leaf elements, receiving leaf correspondences that match leaf elements between schemas of the plurality of schemas, processing the plurality of schemas and the leaf correspondences using closed frequent itemset mining to define a first plurality of redundancy groups, each redundancy group including a proposed correspondence between intermediate elements of schemas, displaying the first plurality of redundancy groups to a user, receiving user input, the user input including one or more actions to one or more redundancy groups in the first plurality of redundancy groups, processing the plurality of schemas, the leaf correspondences and the one or more actions to define a second plurality of redundancy groups, and displaying the second plurality of redundan

Abstract: In one embodiment, a computer-implemented method includes receiving a query. A target confidence level is established for the query, the target confidence level representing a requested level of accuracy for a result of the query. At least one individual confidence level is assigned to each of a plurality of analytics engines. One or more analytics engines are queried based on the query. A group of the analytics engines are selected, by a computer processor, where the analytics engines in the selected group have query responses to the query that are deemed to be similar to one another, and where the selection of the selected group is at least partially based on the target confidence level. The query responses from the selected group of analytics engines are summarized into a final result, where the final result is an answer to the query.

Abstract: Techniques that facilitate management of skewed data during a parallel multiple join operation are provided. Portions of tables involved in the join operation can be distributed among a plurality of processing modules, and each of the processing modules can be provided with a list of skewed values of a join column of a larger table involved in the join operation. Each of the processing modules can scan the rows of first and second tables distributed to the processing modules and compare values of the join columns of both tables with the list of skewed values. One or more of the processing modules can then redistribute the skewed values.