Abstract: A system, a method, and a computer program product for providing transparent access to multi-temperature data are disclosed. A query for accessing data is received. The query includes at least one selection parameter for retrieval of data. The data is stored in a plurality of partitions of a database system. Each partition has a maximum data value per column, a minimum data value per column, and a predetermined date associated with the data contained in the partition. A determination is made whether at least one selection parameter is greater than the minimum data value per column and less than the maximum data value per column. The queried data is retrieved from the partition using the predetermined date associated with the data contained in the partition.

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 and system are presented for merging a first family tree to a second family tree. The method comprises: providing a plurality of first matrices associated with the first family tree and a plurality of second matrices associated with the second family tree, each matrix comprising attributes on individuals that are linked to one another by a predetermined link; identifying substantially identical first and second matrices in said pluralities of first and second matrices; and generating data indicative of a merge of the family trees to one another if a number of the substantially identical matrices exceeds a predefined number.

Abstract: An apparatus for conducting a hierarchical join on a hierarchically clustered data stream is disclosed. The apparatus may include a memory storing query conditions that each determine whether a Structured Query Language query is suitable for performing a non-buffering read operation on a hierarchical data storage. A processor in communication with the memory may be configured to receive a Structured Query Language (“SQL”) query from a client device and evaluate the SQL query for one or more of the query conditions stored in the memory. When the processor determines that the SQL query satisfies one or more of the query conditions, the processor may then perform a non-buffering read operation on the hierarchical data storage to obtain a hierarchically clustered data stream. The hierarchically clustered data stream may be evaluated to obtain a plurality of record results, which may be transmitted to the client device.

Abstract: Embodiments are included for methods, systems, and computer program products for evaluating operations in a shared nothing parallelism system using an electronic computing device are presented, the methods and computer program products including: causing the electronic computing device to receive the operation, where the operation is non-collocated, reference based operation, and where the operation is configured for execution on a first partition in the shared nothing parallelism system; causing the electronic computing device to insert a table queue operator on a second partition, where the second partition includes a reference to input data, causing the electronic computing device to place the reference to the input data on the first partition by the table queue operator; and causing the electronic computing device to execute the operation on the reference to the input data on the first partition.

Abstract: A mechanism is provided in a data processing system for optimization of a distributed file system by log data analysis. A name node in the distributed file system initiates a log analysis map/reduce job on one or more connected data nodes via a map/reduce processing framework in the distributed file system and receives result data resulting from the log analysis map/reduce job from the one or more connected data nodes via the map/reduce processing framework in the distributed file system. The name node performs analysis on the received result data and generates an optimization plan for the one or more connected data nodes based on results of the analysis. The name node initiates the optimization plan on the one or more connected data nodes via the map/reduce processing framework in the distributed file system.

Abstract: Techniques for updating join indexes are provided. A determination is made to update date criteria in a join index query statement. The join index is parsed for current date and current time criteria. The join index is revised based on the location of the current date and current time criteria as they appear in the original join index. The revisions include new criteria that minimize the effort in maintaining and using the join index.

Abstract: A hybrid database table is stored as both a row and a column store. One or more techniques may be employed alone or in combination to enhance performance of the hybrid table by regulating access to, and/or the size of, the processing-intensive column store data. For example during an insert operation, the column store data may be searched for a uniqueness violation only after certain filtering and/or boundary conditions have been considered. In another technique, a hybrid table manager may control movement of data to the column store based upon considerations such as frequency of access, or underlying business logic. In still another technique, querying of the hybrid table may result in a search of the column store data only after an initial search of row store data fails to return a result.

Abstract: A computing device can automatically generate a flow diagram showing statuses that objects in a system can possess, and the possible transitions between these statuses. Using snapshots of database data, the device can determine how the statuses of these objects have changed over time. The device can analyze the data to suggest which database fields likely represent object status. The device can render the flow diagram to illustrate system states at different selected times. Each rendered flow diagram can indicate, for the selected time point, the quantity of objects that possessed each status at that time, and, for a selected time interval, the quantity of objects that changed from each status to each other status during that time interval. The statuses can be represented in the flow diagram as status bubbles having sizes that are based on the quantities of objects have those bubble's statuses at the selected time point.

Abstract: A method (and structure) for monitoring continual range queries against events includes decomposing each range query with one or more predefined virtual constructs, building a query index, and using the query index to match an event with the range queries.

Abstract: Techniques for processing joins on column partitioned tables are provided. A query includes a first-Column Partition (CP) table joined with a second-CP table. The query is decomposed into a three-step process and rewritten and processed.

Abstract: The present invention extends to methods, systems, and computer program products for formulating global statistics for parallel databases. In general, embodiments of the invention merge (combine) information in multiple compute node level histograms to create a global histogram for a table that is distributed across a number of compute nodes. Merging can include aligning histogram step boundaries across the compute node histograms. Merging can include aggregating histogram step-level information, such as, for example, equality rows and average range rows (or alternately equality rows, range rows, and distinct range rows), across the compute node histograms into a single global step. Merging can account for distinct values that do not appear at one or more compute nodes as well as distinct values that are counted at multiple compute nodes. A resulting global histogram can be coalesced to reduce the step count.

Abstract: Enterprise systems, methods and computer program products are disclosed for providing caching of data retrieved from joined tables and an inheritance table hierarchy of a database in an enterprise. The computer implemented method comprises creating a queue of cursors of a statement associated with a database; evaluating a cursor of the queue and marking as one of a unique record and an object of an inheritance table; and, if a cursor of the queue is marked as one of a unique record and a unique object, then, storing data associated with one of the unique record and object in a data cache for subsequent retrieval, thus avoiding costly network calls. If the process leaves a cursor unevaluated, the method retrieves data from an enterprise database associated with the statement. The process is implemented on an application object server including a data access layer and a kernel instance.

Abstract: Methods and Apparatus, including computer program products, for maintaining indexes in a database management system. The database management system includes a table having table entries and an index data structure having index data structure entries, the index data structure relating to the table. The index data structure is updated synchronously with an insertion of table entries. The index data structure is maintained unchanged when the table entries are deleted. It is verified by an index-scan on the index data structure that a valid criterion is fulfilled for index data structure entries, and those index data structure entries that pass the valid criterion from the index-scan are returned.

Abstract: In an example embodiment a sender report containing multiple rows and/or columns of information drawn from a data table may be displayed to a user of a machine. A user may select a portion of the displayed information. A sender adaptor may extract report-to-report selection criteria from the selected information. A receiver adaptor may identify other data tables where information related to the report-to-report selection criteria resides. If such information resides in multiple data tables, the receiver adaptor may join the multiple data tables into one or more data tables. The receiver adaptor may convert the report-to-report selection criteria into selection criteria for the identified data table(s) or joined data table(s). The selection criteria may be passed to a generic receiver report adapted to retrieve any information from any data table(s). The generic receiver report may retrieve information according to the selection criteria and display the information to the user.

Abstract: A computer-implemented method for analyzing and representing interpersonal relations includes: receiving, in a computer system, a user input requesting a representation of interpersonal relations regarding a person; executing, based on the user input and in a relational database, a relational-database query that selects relations involving the person, and that selects other persons involved in any of the selected relations, wherein the relational-database query is performed for each of the selected other persons until a maximum number of steps; and providing the representation of interpersonal relations in response to the user input, the representation indicating at least persons selected by the relational-database query.

Abstract: System, method, and computer program product for processing data are disclosed. The method includes receiving a query for processing of data, wherein the data is stored in a table in a plurality of tables, wherein the table is stored on at least one node within the database system, determining an attribute of the table and another table in the plurality of tables, partitioning one of the table and the another table in the plurality of tables using the determined attribute into a plurality of partitions, and performing a join of at least two partitions of the table and the another table using the determined attribute. The join is performed on a single node in the database system.

Abstract: The APPARATUSES, METHODS AND SYSTEMS FOR PROVIDING A VIRTUAL DEVELOPMENT AND DEPLOYMENT ENVIRONMENT INCLUDING REAL AND SYNTHETIC DATA (“SYNONYM”) provides a development and test environment with reduced database storage requirements that uses synthetic data based on anonymized real data. SYNONYM allows the use of sensitive data for testing while protecting such data as required by privacy laws, secrecy laws and company policies.

Abstract: Computer implemented methods for database hierarch-independent data drilling are presented including: a. selecting one of at least two database structures each having data, where the at least two database structures include, at least two distinct paths that lead from a first of the at least two database structures to a second of the at least two database structures, where a path logically relates at least two data structures which are otherwise directly unrelated using data structures and data structures' relations, and a database information schema that provides information about the at least two database structures including information regarding relations between data structures; b. setting the selected database structure as a current data drilling state; and c. finding at least one related data structure corresponding with the selected database structure for the current data drilling state utilizing the database information schema.

Abstract: In an embodiment, a first query is received that specifies a first object identifier. If a first query plan exists that implements the first query, except that the first query plan does not comprise the first object identifier and instead comprises a parameter marker in place of the first object identifier, a first query execution plan is created from the first query plan, substituting the first object identifier in the first query execution plan for the parameter marker, and the first query execution plan is executed to read a first object identified by the first object identifier.

Abstract: Distributing rows of data in a distributed table distributed across a plurality of nodes. A method includes identifying skewed rows of a first table to be distributed in a distributed database system. The skewed rows include a common data value in a column such that the skewed rows are skewed, according to a predetermined skew factor, with respect to other rows in the first table not having the common data value. Non-skewed rows of the first table that are not skewed according to the skew factor are identified. The skewed rows of the first table are distributed across nodes in a non-deterministic fashion. The non-skewed rows of the first table are distributed across nodes in a deterministic fashion. The rows of the first table distributed across the nodes, whether distributed in a deterministic fashion or non-deterministic fashion, are stored in a single table at each of the nodes.

Abstract: A hybrid database table is stored as both a row and a column store. One or more techniques may be employed alone or in combination to enhance performance of the hybrid table by regulating access to, and/or the size of, the processing-intensive column store data. For example during an insert operation, the column store data may be searched for a uniqueness violation only after certain filtering and/or boundary conditions have been considered. In another technique, a hybrid table manager may control movement of data to the column store based upon considerations such as frequency of access, or underlying business logic. In still another technique, querying of the hybrid table may result in a search of the column store data only after an initial search of row store data fails to return a result.

Abstract: A method and apparatus for a data warehouse built on top of MapReduce is provided. A virtual view is defined on top of the common star or snowflake data warehouse schema. A SQL-like, but much more succinct, query language is provided to leverage the virtual view. Many advanced query processing features leveraging the virtual view are also provided. Further, several optimization techniques ranging from data compression and access method to multi-query optimization and exploiting materialized views are provided. Further, a technique to seamlessly integrate the data warehouse system into any ad-hoc MapReduce jobs is provided. Thus, fully leveraging the power of both MapReduce and data warehouse technologies is achieved.

Abstract: A method, apparatus and computer program product are therefore provided for implementing requests for data using independent data objects. In this regard, the method, apparatus and computer program may receive a request for set of data. The request may include an identifier for the particular set of data. The method may further determine a structure of the set of data using an attribute table associated with one or more data objects, and generate a query using the determined structure of the set of data. The generated query may be executed to retrieve a set of data responsive to the request. The retrieved data may be used along with the determined structure to provide a response to the request.

Abstract: Partitioned join operations are performed between a first database object and a second database object by determining an agent group for an agent in response to the agent receiving rows of the second database object to process; partitioning the rows to determine a target hash table for each row and adding the partitioned rows to work to be performed by the agent group; and distributing the work for the group to agents of the group by assigning to a single agent all the rows associated with a particular hash table to perform a join operation on the assigned rows. Each partition is assigned a first counter value indicating an upper bound of a task id range that is most recently assigned to an agent in the agent group for processing, and a second counter value indicating the highest task id that has been processed for that partition.

Abstract: A pattern can be identified in at least part of a query whose definition is received in a query request. The identified pattern can be matched with a set of pre-defined patterns, each of which has associated therewith at least one pre-compiled query execution sub-component of a plurality of pre-compiled query execution sub-components retained in a library. A plan for executing the query can be generated, for example by incorporating the pre-compiled query execution sub-component associated with the matched pattern into the plan based on a pseudo code representation of the plan derived from the definition.

Abstract: The subject mater herein relates to database management and, more particularly, to non-equijoin metadata. Various embodiments described herein provide systems, methods, software, and data structures to facilitate non-equijoins of data. Some such embodiments include a data store to hold metadata describing relationships between database tables. The relationships between database tables may include one or more non-equijoins of tables in the form of one or more table-column pairs of a first table being non-equal to one or more table-column pairs of a second table. In some embodiments, the metadata may be used by a query generator to build query statements including one or more non-equijoin.

Abstract: A method for estimating the selectivity of a database base table predicate, the cardinality of a join, and the cardinality of an aggregation. The method includes receiving a database query, the query comprising one or more query predicates and referencing one or more database tables. One or more join indexes are identified, the join index(es) defined on respective database tables referenced by the database query. The join index(es) comprises one or more join index predicates, and includes one or more join columns in its select list. The row count selected by the query predicates is calculated at least partly using the row count or statistics of the one or more join indexes. The selectivity of the base table predicate is calculated at least partly from the calculated row count. The cardinality of the join is estimated at least partly from the row count and statistics of the identified join index(es).

Abstract: A query associated with a calculation scenario comprising a plurality of calculation nodes can be received by a calculation engine. The calculation scenario is instantiated and the query is transformed into a convex hull filter based on the at least one multiple selection condition that can be executed at any of the calculation nodes. The instantiated calculation scenario and the convex hull filter are executed to provide a result set. Related apparatus, systems, methods, and articles are also described.

Abstract: A calculation engine is described that executes calculation scenarios comprising a plurality of calculation nodes that each specify operations to be performed to execute the query. One of the nodes can be a semantic node that is used to modify the query for operations requiring special handling. Related apparatus, systems, methods, and articles are also described.

Abstract: A computer-implemented method is provided, which includes presenting to a user (30) a range of levels of personalization of search results, including a personalized level, a global level that is not personalized, and a community level between the personalized level and the global level. An indication (550) of a desired one of the levels, and a search query (52) consisting of one or more query terms, are received from the user (30). Responsively to the search query, a search result listing (54) is generated. At least a portion of the search result listing (54) is ranked at least in part responsively to the indication (550), and at least a portion of the ranked search result (54) listing is presented to the user (30). Other embodiments are also described.

Abstract: A variety of query optimization techniques are described herein. A first query optimization technique, referred to herein as non-empty transformation, may be applied to queries that specify one or more measures, a dimensional context within which the measure(s) are to be evaluated, and a filter condition specifying that rows with only empty measure values be excluded from a result set. The non-empty transformation technique enables such queries to be rewritten into another format that can be executed more efficiently than the original queries. A second query optimization technique described herein involves restructuring an operator tree representation of a query so as to avoid unnecessary duplicated evaluation of extension columns. A third query optimization technique described herein automatically selects a minimum number of join columns having the lowest cardinality for implementing a join between two tables.

Abstract: A database server receives a multi-part query from a remote application server. The multi-part query specifies a calculation scenario defining a data flow model that includes a plurality of calculation nodes that include a main section of nodes and two or more branches of nodes. Each calculation node defines one or more operations to execute on the database server. Thereafter, the database server instantiates the specified calculation scenario and additionally executes the operations defined by the calculation nodes of the main section of the instantiated calculation scenario a single time and executes the operations defined by the calculation nodes of the branches to result in respective responsive data sets corresponding to each branch. The responsive data sets are then provided by the database server to the application server. Related apparatus, systems, techniques and articles are also described.

Abstract: An index is created for a database by selecting at least one column of a database table as a basis to create the index, generating at least one index of a tree structure according to the at least one column, where a pointer stored in a leaf node of the at least one index is null. In an example embodiment, a value to a pointer is stored in a leaf node according to an intermediate result in response to the intermediate result being generated, where the pointer stored in the leaf node points to a data page storing the intermediate result. The created index can be reused and the intermediate result can be effectively used, such that the efficiency of database operation is improved.

Abstract: A chronology display is generated for use with a web presentation or other form of network presentation. The chronology display may include a plurality of intervals, with each interval representative of a period of time. In an embodiment, some of the intervals may indicate a number of content items provided on the network presentation during the time period that corresponds to each particular interval. The indication may be provided by a characteristic, such as for example, a color or shading that represents the number of content items provided on the network presentation.

Abstract: Processing resources at a storage system for a database server are utilized to perform aspects of a join operation that would conventionally be performed by the database server. When requesting a range of data units from a storage system, the database server includes join metadata describing aspects of the join operation for which the data is being requested. The join metadata may be, for instance, a bloom filter. The storage system reads the requested data from disk as normal. However, prior to sending the requested data back to the storage system, the storage system analyzes the raw data based on the join metadata, removing a certain amount of data that is guaranteed to be irrelevant to the join operation. The storage system then returns filtered data to the database server. The database system thereby avoids the unnecessary transfer of certain data between the storage system and the database server.

Abstract: System, method and computer program product for processing a query are disclosed. Query processing includes partitioning the stored data into a plurality of partitions based on at least one vertex in the plurality of vertexes, storing at least another triple in the plurality of triples on the at least one node, assigning, based on the triple containing the at least one vertex, at least one partition in the plurality of partitions corresponding to the triple to at least one node in the plurality of nodes, and processing, based on the assigning, the query by processing the plurality of partitions.

Abstract: The PORTAL-DOORS System has been designed as a distributed network system with hierarchical authorities for entity registering and attribute publishing of mobile metadata. An alternate bootstrapping design with self-referencing and self-describing features has been implemented with an integrated model for the combined registry-directories that co-exists with the independent model for the separate registries and directories. The concept of multilevel metadata about metadata has been implemented with the use of entity, record, infoset, representation and message metadata. This multilevel metadata about metadata improves the efficiency of search and analysis of the metadata content within the networked system. The methods facilitate search of varying scope both within and across the registries, directories and registry-directories focused on different problem oriented domains. Maintaining the integrity of these problem oriented domains serves to improve the efficiency of search throughout the system.

Abstract: Enterprise systems, methods and computer program products are disclosed for providing value-based positioning for outer join database queries in an enterprise resource planning system operating on a specially programmed computer server. The computer implemented method comprises; receiving a query at a server and processing the query for inner join and then evaluating a returned value for Order by direction and whether the current row returns NULL. Depending on forward paging and reverse paging for outer join, the process involves changing an inequality operator depending on the evaluated Order by direction and whether the current row is NULL. The process for inner join and outer join queries is implemented on an application object server including a kernel instance, a query framework and query generation model and a data access layer engine to a database of the enterprise resource planning system.

Abstract: A method and apparatus for resolving conjunctive queries, comprising relational predicates and external predicates, such as XML predicates. The method and apparatus obtain results from a relational engine or from an external engine, and then use the obtained results as input for the other engine, so as to optimize the activity of the other engine. The process may repeat further times, with the results obtained by the other engine being input to the first engine. The method and apparatus further disclose handling value, being isomorphic hierarchical subtrees.

Abstract: A tag management device executes a process including adding, to data received, sort-free identifiers that identifies receiving order, and are monotonically increasing or monotonically decreasing numbers or character strings arranged in alphabetical order or a combination thereof; storing, sequentially in a first storing unit associated with a tag that is added to the received data, the identifiers added at the adding; storing, sequentially in a second storing unit in an associated manner, the received data and the identifiers added at the adding; and searching, when a storing unit associated with a tag to be searched for is the first storing unit, data associated with the tag to be searched for by joining, using an inner join or an outer join, information stored in the first storing unit and information stored in the second storing unit.

Abstract: An apparatus and method for processing an ontological query for data from any of a plurality of different databases on a network coupled to a computer that includes loading a ontological data model comprising a plurality of logical models based on data from the plurality of different databases, compiling the ontological query and optimizing 48 the compiled ontological query according to join and combination rules based on the logical models and describing meta-properties of the data and meta-relationships based on the meta-properties between the data from the plurality of different databases, and processing logical operations on the compiled ontological query.

Abstract: Methods, systems, and computer-readable media include actions of receiving a query, identifying, based on the query, one or more relevant elements from an overall data model, identifying, using an adapter mapping, one or more adapters based on the one or more relevant elements, the adapter mapping associating each relevant element with a particular adapter, querying, using the one or more adapters, one or more data elements in data sources of a plurality of disparate data sources, each adapter being specific to a data source of the plurality of data sources, receiving, at the one or more adapters, one or more data results, transforming each data result of the one or more data results into a unified data format to provide respective one or more transformed data results, storing the one or more transformed data results in a temporary data store and querying the temporary data store to generate a result.

Abstract: The execution of the one or more database queries can be optimized by using a multi-platform cost model that take into account the respective cost of execution in each one of the multiple execution platforms. The respective costs of the execution can, for example, include cost associated with one or more operators for executing the one or more database queries in each one of the multiple execution platforms and/or the costs of exchanging data between the multiple execution platforms.

Abstract: Techniques for optimizing outer joins in database operations are provided. In an embodiment, a query having an outer join with a GROUP BY clause is rewritten and expanded to expand a first level partition of that GROUP BY clause to produce a modified query. In another situation, rows associated with processing a query are each row split and then hashed based at least in part on attributes of the outer join predicate. A left outer join is performed and a global aggregation processed to produce a spooled table to process the query.

Abstract: An approach is provided in which a processor receives a scan request to scan data included in a data table. The processor selects a column in the data table corresponding to the scan request and retrieves column data entries from the selected column. In addition, the processor identifies the width of the selected column and selects a scan algorithm based upon the identified column width. In turn, the processor loads the column data entries into column data vectors and computes scan results from the column data vectors using the selected scan algorithm.

Abstract: Methods and systems for query optimization for a multi-tenant database system are provided. Some embodiments comprise receiving at a network interface of a server in a multi-tenant database system an original query transmitted to the multi-tenant database system by a user associated with a tenant, wherein the original query is associated with data accessible by the tenant, and wherein the multi-tenant database system includes at least a first index and a second index. Metadata associated with the data is retrieved, wherein at least a portion of the data is stored in a common table within the multi-tenant database system. A tenant-selective query syntax is determined by analyzing at least one of metadata generated from information about the tenant or metadata generated from the data accessible by the tenant.

Abstract: Techniques to process a query and perform a join of tables that are distributed across nodes of a network. The join can be performed by analyzing a Where clause. An active flag structure can have flag values that identify table entries satisfying criteria of the Where clause. Keys of surviving entries of a first table can be used to generate a request for a second table to be joined. The request can be for second flags for the second table when the Where clause has criteria for the second table. A response can be used to update the first flags to change a first flag to False. After updating, data can be retrieved for first flags that are True. Requests can use identifiers associated with the first table that identify a location for sending the request, e.g., using RDMA or MPI.

Abstract: A method, system, and computer program product for high-performance database systems. The method commences by estimating, during a compile phase, a statically-calculated system cost of performing parallel join operations over two relations, then selecting, during the compile phase, a first distribution method to perform the parallel join operations. Instructions (e.g., table partitioning) are communicated to two or more execution units for execution of the parallel join operations, and during execution, various measurements are taken pertaining to the performance of a first portion of the parallel join operations using the selected first distribution method. Then, responsive to the measurements a second distribution method is selected and corresponding instructions are communicated to the two or more execution units. The parallel join operations continue, now using the second distribution method.

Abstract: A method, system, and computer program product for planning relational database joins in systems with multiple parallel computational units. The computer implemented method compiles an execution plan for dissemination to a plurality of execution units where the plan combines a smaller left-side table with a portion of a larger right-side object to reduce system overhead. Upon receiving a request for a join operation comprising left-side table data and right-side table data where the left-side table data is much smaller than the right-side table data, then the method compiles a plan to apportion an entirety of the left-side table data and only a portion of the right-side object to a plurality of computational units. The method continues by sending distribution instructions to respective computational units where the distribution instructions include retrieval of the entirety of the left-side table data with the retrieval of only a portion of the right-side object.