Abstract: The invention relates to a system and method for extracting business process metrics from a Unified Modeling Language (UML) model. This invention involves the use of Object Constraint Language (OCL) and custom stereotypes to extract the design metrics from a UML model. The business process parameters to be measured are defined and custom stereotypes for each design element present in the business process parameters are also defined. A UML diagram is generated to represent the steps required to complete the business process. The UML diagrams are based on UML 2.0 or its higher version. The queries are written in OCL and run on the activity or sequence diagram to extract the desired metrics.

Abstract: Methods and apparatus, including computer program products, are provided for group-by access of a database. In one aspect there is provided a method. The method may include receiving from a user interface information defining a database and a database table; converting the received information into at least one instruction for performing the group-by and the sum at the database table included in the database; sending the at least one instruction to the database; receiving, in response to the at least one instruction sent, a result-set from the database, the result-set representative of the group-by and the sum of the database table; and providing the result-set to an interface. Related systems and articles of manufacture are also discloses.

Abstract: Embodiments are directed to optimizing searchable resources and to returning relevant search results. In one scenario, a computer system monitors multiple different social media sites to observe conversations related to the searchable resources. The computer system identifies terminology related to the searchable resources from any one or more of the observed conversations. The identified terminology identified may be based on topic, author, and/or place. The computer system then accesses known terminology used to search for the searchable resources and correlates a relationship between the known terminology and the identified terminology. The computer system also modifies the searchable resources to be responsive to a search request that is expressed using the identified terminology.

Abstract: The approaches described herein provide an efficient way to process certain kinds of queries that update XML data stored in an object-relational database. A query may include an XML query expression that conforms to a language for querying XML documents. A technique first determines whether the query contains an XML updating expression, and in response rewrites the query to comprise one or more path-based query operators that specify operations for updating XML data. The query may then be further rewritten to comprise one or more storage format specific query operators based on the particular database storage format associated with the XML data specified in the query. The rewritten query operators are used to generate a query execution plan that provides for several query execution optimizations.

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: A method and system for fuzzy full text search is disclosed. The system includes an inverted index where tokens are organized in a Next Valid Character (NVC) tree. Each path through the tree defines a token. The document sets for the tokens are stored at leaf nodes. After receiving search tokens, the system traverses the NVC tree in a lazy manner by exploring paths through nodes associated with the smallest edit distance. The system provides a result set per edit distance. For example, the system provides a result set of document identifiers associated with documents having the least amount of error first, followed by result sets of document identifiers associated with documents that have progressively more error.

Abstract: A mixed join between database column and row tables employs an algorithm that recognizes both row and column store, and is executable upon the data in its native form (row or column) without requiring conversion between orientations. The native mixed join algorithm accesses the column dictionary of the column table for efficient join processing. The native mixed join algorithm may also exploit an inverted index (if present) to search a record (e.g. docid) with a given value. In particular, the native mixed join algorithm looks up a column dictionary for a join condition, while iterating the row table and returning matched records in a pipelined manner.

Abstract: A computer system affords a user the ability to interactively formulate, visualize, and modify query plans that are to be posed to a database. The computer system provides query visualization in the form of decision trees having nodes selectable/deselectable to search for alternative query plans with lower or minimum execution time. The estimated cost and/or the execution time of a subtree of a query plan may be mapped according to a rectangle area metaphore, with the area of a rectangle enclosed by a larger rectangle representing a parent node in the plan tree. Query plans may be saved by the system in order to facilitate their visualization, optimization, and/or modification at a later date.

Abstract: Technologies are described herein that pertain to optimizing a ranker component for a risk-oriented objective. Various definitions of risk are described herein, wherein risk is based upon variance in performance scores assigned to the ranker component for respective queries in a data store. Additionally, risk is optionally based upon variance in relative performance of the ranker component versus a baseline ranker component.

Abstract: Various embodiments of systems and methods for a fault tolerance based query execution are described herein. Queries are received from users, the queries including operators. A multi-query optimization is performed on the operators included in the queries to obtain a query plan. A fault tolerance degree is determined for the operators included in the query plan. Based on the fault tolerance degree of the operators, nodes are assigned to the operators included in the query plan. The assigned nodes execute the operators included in the query plan to execute the queries. In one aspect, the nodes simultaneously execute the operators included in the query plan.

Abstract: Systems, methods, and computer program product embodiments are provided for path-based query evaluation. The embodiments include representing a markup language document as a descriptive catalog, and capturing relationships in the descriptive catalog as an index summary. The index summary is utilized for evaluating a path-based query.

Abstract: Computer-implemented methods, systems and computer-readable media for providing a query layer for cloud databases comprise importing data into said cloud by at least one of the computing devices, converting at least one of the queries over row-store database into a query over column-store database by means of cost based query optimizer and retrieving said data from the column-store database based on said query by at least one of the computing devices.

Abstract: Various aspects of this disclosure are directed to receiving, by a computing device, a first table join query that may include a first group of table identifiers that identify the two or more tables. The computing device may determine whether the first table join query includes an outer join command. When the first table join query includes the outer join command, the computing device may compare the first group of table identifiers and a second group of table identifiers of one or more pre-joined tables to determine whether each of the first table identifiers matches at least one of the second group of table identifiers. The computing device may further determine whether a predicate associated with each table identifier matches a predicate associated with a matching second table identifier. When each of the predicates match, the computing device may rewrite the first table join query.

Abstract: A method and apparatus for facilitating answering a query on a database. Example embodiments include: accessing a database tree having a plurality of nodes; receiving a set of input variable values, a non-empty set of output variables, and information indicative of a node in the database tree; determining a traversal cost based on the node and the set of input variable values; determining a lower bound based on the node and the set of input variable values, wherein the lower bound corresponds to an upper-bound probability estimate based on one or more of the plurality of nodes and the set of input variable values; pruning one or more of the plurality of nodes based on the traversal cost, the lower bound, and a pruning bound; and returning a result including a non-empty set of output variable values based on the set of input variable values, the node, the traversal cost, and the lower bound.

Abstract: The subject matter disclosed herein relates to generating a search result comprising one or more candidate documents selected based at least in part on one or more criteria associated with an input value of a visual information metric.

Abstract: Techniques are disclosed for accessing a dimensional data model when processing a query. In one embodiment, the query is processed by performing a two-stage zigzag join operation including a zigzag main join and a zigzag back join. The zigzag main join is configured to generate a set of row identifiers of fact records satisfying any local predicates in the query. The zigzag back join is configured to generate query results based on the set of row identifiers. The query results are returned responsive to the query.

Abstract: According to a present invention embodiment, a system conducts a scan on a database object index with one or more gaps. The system generates one or more combinations of values for the gaps within an index with respect to an operation. Each combination of values is generated by scanning the index based on a combination of one or more scan values, adjusting a value for a gap based on scan results, and adjusting the scan values for a succeeding scan based on the scan results to reduce a quantity of scans. The index includes at least two database object elements. One or more scans of the index utilizing the combinations of values are conducted to retrieve data from the database and accommodate each gap in the index. Present invention embodiments further include a method and computer program product for conducting the index scan.

Abstract: A search query to provide a search result may be received, which identifies source and target nodes and an application for generating the search result. The application accesses a data structure holding landmark nodes, which store a shortest path tree in the form of a set of parent links. Each parent link can identify an adjacent vertex node in a shortest path between each node in the data structure and the landmark node. The location of the source node and the target node in the shortest path trees may be identified to the landmark node. For each landmark node, using the identified locations of the target node and source node, a measure of distance between the source node and the target may be generated. The landmark node with the shortest distance may be determined. A search result related to the shortest path tree of that landmark node may be provided.

Abstract: In various example embodiments, a system and method for personalization of search results are provided. In example embodiments, a user interface that allows a user to establish optimization preferences used to personalize results based on a query is provided. The optimization preferences include values that are a portion of a total allowed value assigned to interrelated optimization factors. The optimization preferences are received via the user interface. The optimization preferences are applied to matches obtained based on the query to generate a personalized result set.

Abstract: A data management system receives a query. A query optimizer determines an access plan for the query. The access plan has a plurality of stages, where each stage may have a different degree of parallelism for processing threads executing the stage. The query optimizer determines a maximum degree of parallelism for the plurality of stages and reserves processor cores based on the maximum degree of parallelism. The data management system schedules threads on the reserved processor cores for a first stage of the access plan. The data management system changes simultaneous multi-threading (SMT) mode for the processor cores when a second stage of the access plan having a different degree of parallelism is executed.

Abstract: An enterprise business intelligence system includes a data access service. In one example, a method comprises receiving, with a data access service, a query and a report specification from an application, wherein the data access service is positioned between the application and a data source; creating a run tree that comprises a sequence of executable decoration nodes; executing the query on the data source, thereby providing a query result set comprising query results drawn from the data source that are responsive to the query; and executing the sequence of decoration nodes on the query result set. The decoration nodes modify the query result set, thereby producing a decorated result set based on the query result set and the decoration nodes. Producing the decorated result set comprises associating members or values in the query results with corresponding positions or calculated members in the report specification.

Abstract: Provided are techniques for processing a multidimensional query. For each multidimensional expression in the multidimensional query, the multidimensional expression is evaluated to generate a representation that includes an evaluation context, a degeneration status, and condensed value storage that does not store data that would be replicated due to degeneration, and the representation is stored.

Abstract: A fuzzy joins system that is integrated in a database system generates fuzzy joins between records from two datasets. The fuzzy joins system includes a tokenizer to generate tokens for data records and a transformer to find transforms for the tokens. The fuzzy joins system invokes a signature generator, running within a runtime layer of the database system, to generate signatures for data records based on the tokens and their transforms. Subsequently, an equi-join operation joins the records from the two datasets with at least one equal signature. A similarity calculator, running within a runtime layer of the database system, computes a similarity measure using the token information of the joined records. If the similarity measure for any two records is above a threshold, the fuzzy joins system generates a fuzzy join between such two records.

Abstract: A cost estimator may estimate execution costs for execution of at least one query against a database, using at least one existing index, if any, and based on estimation criteria determined from analyzing the query execution. A candidate index provider may provide candidate indexes, based on the estimation criteria, and re-estimate the execution costs to obtain updated execution costs, using the candidate indexes. An index recommender may recommend a recommended index, based on the updated execution costs.

Abstract: A reusable ERP data retrieval object, in particular, a wide application query object provides a systematic and standardized approach to data retrieval. In one embodiment, the wide application query object is an encapsulated query object in that multiple queries are aggregated into one master query object (i.e., the wide application query object) that can, but does not necessarily have to, span multiple disparate data sources. In another embodiment, data retrieved in accordance with the wide application query logic is manipulated by code in any of a variety of different ways using a trigger model and specialized constructs. In still another embodiment, public parameters are utilized to trigger functions that impact the substance and layout of the query output.

Abstract: A system and method of collecting statistics on a database for performing at least one insurance related structured query language (SQL) query are disclosed. The system and method includes providing at least one insurance related SQL query, determining the relationships of tables subject to the provided at least one insurance related SQL query, transforming the determined relationships of tables into a display representing communities of tables, and collecting statistics on at least one community of tables based on the at least one insurance related SQL query. The tables of the system and method represent insurance data.

Abstract: A method includes receiving a query for data, the query including a deadline for completion. The method includes determining a plurality of access plans for the query. The method includes selecting an access plan from the plurality of access plans, wherein the access plan is selected according to an execution time for the access plan that indicates the query can be completed prior to the deadline for completion and wherein the access plan is selected to provide a lowest resource usage among access plans that can be completed prior to the deadline for completion.

Abstract: A query explain plan is described for use with a distributed data system in order to help developers and IT experts to detect bottlenecks and to determine which queries are to blame for a slow running system. In accordance with an embodiment, the distributed data grid utilizes a facility to provide a distributed explain plan. This distributed explain plan provides visibility into how a query was answered by each node in the cluster. For example, one node may have applied the filters of the query in one sequence, while another node may have used a different sequence. Additionally, the distributed query explain plan can provide execution tracing, rendering information about the execution time of each step, total execution time and the like.

Abstract: A partially built index is used in a computer database system. When a database index is being built, or rebuilt, the database manager keeps track of the records processed using a relative row number (RRN) to track what part of the partially built index is complete. Queries are optimized by a query optimizer associated with the database manager that uses the portion of the index that is complete with reference to the RRN. The remainder of the database table beyond the RRN can be estimated or implemented using the completed data or can be determined by searching the relevant portion of the database table.

Abstract: Systems, methods and articles of manufacture are disclosed for matching an inbound identity record to existing entities. Entity resolution (ER) candidate-building keys may be determined for a received identity record. A query may be generated from the ER candidate-building keys. When executing the query, a generic key may be identified. Execution of the query may be aborted upon a condition involving the generic key being satisfied.

Abstract: A tag management device executes a process including adding, to data received, sort-free identifiers that indentifies 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: A partially built index is used in a computer database system. When a database index is being built, or rebuilt, the database manager keeps track of the records processed using a relative row number (RRN) to track what part of the partially built index is complete. Queries are optimized by a query optimizer associated with the database manager that uses the portion of the index that is complete with reference to the RRN. The remainder of the database table beyond the RRN can be estimated or implemented using the completed data or can be determined by searching the relevant portion of the database table.

Abstract: An optimizer apparatus and method for application in a query engine of a database management system is provided for optimizing a query expression. One or more blocks are identified in the initial query expression, each of the one or more blocks being identified based on a predetermined sub-expression of the initial query expression. The optimization process is partitioned into one or more sub-tasks, wherein each sub-task corresponds to a respective block. An optimal query plan for each of the sub-tasks is determined.

Abstract: Mechanisms for performing database queries are provided. With these mechanisms, in response to a query request, a query plan intended for minimum query response time and a query plan intended for minimum query total time for the query request are obtained execution of the minimum query response time query plan and the minimum query total time query plan is started. Before the execution of the minimum query total time query plan reaches a specified point, an initial query result obtained from the execution of the minimum query response time query plan is output. In response to the execution of the minimum query total time query plan reaching the specified point, continuing the execution of the minimum query total time query plan to output remaining query results.

Abstract: There is provided a computer-implemented method of dynamically reordering operations in a query plan. An exemplary method comprises processing a first set of tuples according to a first operation. The query plan is pipelined and specifies that the first operation generates input for a second operation. The query plan further specifies that the second operation is executed after the first operation. The computer-implemented method further includes determining that the second operation is to precede the first operation based on a specified policy. The computer-implemented method further includes executing the second operation for a second set of tuples before executing the first operation for the second set of tuples. The second operation generates an input for the first operation. The first operation is executed after the second operation.

Abstract: Methods, systems, and apparatus, including computer program products, for caching input suggestions are provided. In one aspect, a method includes receiving a first textual input in an input field from a user; sending the first textual input to a server before a user submits a request for results based on the first textual input; receiving a set of input suggestions from the server; storing the set of input suggestions in a local cache; displaying a first subset of input suggestions from the set of input suggestions to the user; receiving additional textual input from the user after the first textual input is sent to the server; analyzing the stored set of input suggestions to identify a new subset of input suggestions based on the additional textual input; and displaying the new subset of input suggestions.

Abstract: More efficient querying of a multi-tenant database using dynamic tuning of database indices. A layer of meta-data associates data items with tenants, e.g., via tags, and the meta-data is used to optimize searches by channeling processing resources during a query to only those pieces of data bearing the relevant tenant's unique tag.

Abstract: SEO for an entire website can change the presence of the website on the internet, and change which webpages of the website rank higher for different internet searches. The SEO optimized website can provide a particular webpage in response to a particular search engine query rather than a generic landing page. SEO can determine a unified website configuration having individual webpages with higher search engine rankings for specific search engine parameters. This can allow for enhanced search engine optimization that directs search engine results to rank selected pages within a website higher than others to provide a more directed search result within the website.

Abstract: In an embodiment, a threshold value is calculated for a current entry in a first column of an index. If the current entry has been read a number of times by execution of an execution plan that is more than the threshold value and the current entry points to at least one row in a table and not all of the at least one row have been selected by the execution plan for inclusion in a result set as satisfying a query that the execution plan implements, then a new entry is added to the index.

Abstract: A database management system stores data form a plurality of logical tables as independent copies in different format. In one specific example the system organizes tables into table groups and de-normalizes the table in each table group. It also organizes data in a second format including vertical column containers that store all the data for one attribute, there being one column container for each table and each attribute within that table. The receipt of a query causes the system to develop a query plan that can interact with either or both of the container sets.

Abstract: Among other disclosed subject matter, a computer-implemented method of analyzing a form page for indexing includes identifying a form page that is configured for use in requesting any of multiple target pages, the form page including at least one text input control for retrieving any of the multiple target pages. The method includes identifying at least one keyword as being informative with regard to the text input control. The method includes updating an indexing record associated with the form page to reflect the identified keyword.

Abstract: Methods, systems and apparatus, including computer program products, for expanding search queries. One method includes receiving a search query, selecting a synonym of a term in the search query based on a context of occurrence of the term in the received search query, the synonym having been derived from statistical machine translation of the term, and expanding the received search query with the synonym and using the expanded search query to search a collection of documents. Alternatively, another method includes receiving a request to search a corpus of documents, the request specifying a search query, using statistical machine translation to translate the specified search query into an expanded search query, the specified search query and the expanded search query being in the same natural language, and in response to the request, using the expanded search query to search a collection of documents.

Abstract: The present invention discloses a docbase management system, including a first module, adapted to parse a received invocation from an application and generate an execution plan which comprises operations on physical storage; a second module, adapted to execute the execution plan to schedule a third module to execute the operations on physical storage in the execution plan; and the third module, adapted to execute the operations on physical storage in the execution plan under the scheduling of the second module. Since the implementation of the docbase management system is divided into hierarchies, and the hierarchies are independent of each other, the docbase management system is well extendable, scalable and maintainable.

Abstract: A system and a method of retrieving information is described. In a system according to the invention, software modules may be used to provide the user with information that is most likely to be the information desired.

Abstract: Techniques are disclosed for query processing. In one embodiment, a query is received for execution in a processing environment. Based on a measure of current load of the processing environment, a maximum amount of a resource that the query is allowed to consume is determined. An amount of the resource that the query is to consume is estimated. Execution of the query is managed based on a comparison between the maximum amount and the estimated amount.

Abstract: Systems, methods and articles of manufacture are disclosed for generating an online analytical processing (OLAP) query against a cube. The cube may have dimensions, each dimension having a hierarchy of members. A report specification may be received against a hierarchy of the cube. An OLAP query may be generated from the report specification. The OLAP query may include projected members not having any descendant at the detail level of the hierarchy, thus producing more accurate results.

Abstract: Various embodiments of systems and methods for database consistent sample data extraction are described herein. The technique uses production data as input and outputs sample data in the same relational schema while preserving the integrity of joins of the different tables in the schema. For a given relational schema, the master tables are found. Then a subset is created by placing selection criteria in a query defining how to sample the data for these master tables. Following the joins, the dependent tables are added to the query automatically.

Abstract: Methods and systems related to the display of primary and secondary search results are provided. Search results are displayed to the user without requiring the user to perform any tasks to view the entire set of search results. The user may then request secondary searches based on the displayed primary search results through performing a single action. Secondary search results are displayed along with the primary search results.

Abstract: A query plan for executing a query within a relational database system including at least one non-relational data source is generated by analyzing expressions that reference a non-relational data source within a query for the database system via an interface for that non-relational data source, determining for each analyzed expression at least one of the database system and interface capable of processing that analyzed expression for executing the query, providing an indicator for each of the analyzed expressions that indicates at least one of the database system and interface determined to process that analyzed expression, and generating the query plan for execution of the query, via the database system, based on the indicators for the expressions of the query.

Abstract: Various embodiments of systems and methods for join tuple assembly by partial specializations are described herein. The join tuple assembly by partial specializations is a phase of the method for join query evaluation by semi-join reduction. By using partial specializations of the non-join part of the WHERE clause of a join query and matching sets, the join tuple assembly is organized in a manner that all computations are necessary, none are repeated, and failure to complete a partial join tuple to a full tuple is detected as early as possible. The method can be applied to inner and outer joins, and to arbitrary join graphs and non-join conditions in the WHERE clause. It can also be used outside the context of semi-join reductions.