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 in a non-limiting embodiment of an import export trade transaction storage and retrieval system.

Abstract: Provided is a method for processing a multi-way join query comprising: filling matrix-based synopses according to input source stream and generating a result vector evaluating a query equation defined by the matrix multiplication operation of the matrix-based synopses corresponding to nodes of a query walk; and generating a result tuple for the multi-way join query from the matrix-based synopses based on the result vector.

Abstract: A method, article of manufacture, and apparatus for processing queries, comprising analyzing a query tree, determining at least one operator based on the query tree analysis, assigning a memory allocation for each of the at least one operator, and storing the assignment in a storage device. In some embodiments, a memory classification for each of the at least one operator is determined. In some embodiments, assigning a memory allocation for each of the at least one operator includes assigning a memory allocation based on the memory classification.

Abstract: A portal having one or more associated data sources is defined, the portal including one or more portlets for displaying information associated with the one or more associated data sources. An index of the one or more associated data sources is generated. A search query is transmitted to a search engine. The index is searched for data associated with the search query. A result set is received based, at least in part, upon the index and the data associated with the search query.

Abstract: Provided are techniques for creating one or more fine-grained access control rules that are associated with a base table. A materialized query table is created from the base table without applying the one or more fine-grained access control rules associated with the base table when obtaining data from the base table. A fine-grained access control protection indicator is turned on for the materialized query table. In response to receiving a direct access request to the materialized query table in a query referencing the materialized query table, access is provided to the data in the materialized query table by applying one or more fine-grained access control rules associated directly with the materialized query table to the data in the materialized query table before returning the data.

Abstract: Systems and methods for automatically determining the availability of resources, such as Internet advertising opportunities, are described herein. The systems and methods efficiently process bulk queries that specify multiple target values for at least one attribute associated with the resources, such bulk queries being useful for determining the availability of a wide variety of different resource types.

Abstract: In an example embodiment, signals are collected from one or more first channels in a communication network. The one or more first channels may include at least one of organic search, paid search, or social media. Based on the collected signals, a recommendation is made with respect to a campaign within a second channel.

Abstract: A query is received and processed to determine one or more specified and unspecified attributes in the query. The specified and unspecified attributes may correspond to attributes of one or more items. A graph is generated for the items and includes a node for each item and an edge between each unique pair of nodes. Each node is assigned a cost based on a distance between the specified attributes of the query and the attributes of the item associated with the node. Each edge is assigned a weight based on a distance between the unspecified attributes associated with the nodes of the node pair corresponding to the edge. A set of nodes from the graph is selected by minimizing a total cost of the nodes while maximizing a dispersion of the nodes based on the edge weights.

Abstract: A select query or a data referencing a calculation scenario is received by a database server from a remote application server. The specified calculation scenario is one of a plurality of calculation scenarios and it defines a data flow model that includes one or more calculation 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 executes the operations defined by the calculation nodes of the instantiated calculation scenario to result in a responsive data set. This data set is then provided by the database server to the application server. Related apparatus, systems, techniques and articles are also described.

Abstract: Methods, systems and computer program products for traversing a level in a search path in a tree data structure by recording a version number of a node on the search path, finding a child pointer in the node on the search path, recording a version number of a child node corresponding to the child pointer, reading a version number of the node on the search path, comparing the recorded version number of the node to the read version number of the node, reading at least one child pointer in the node and comparing the read child pointer to an address of the child node.

Abstract: Techniques are described for managing query execution using additional performance capabilities from a set of system resources. Embodiments may receive a query and calculate a first estimated execution time for processing the query using a first amount of performance capabilities from a first set of system resources. If embodiments determine that the first estimated execution time exceeds a threshold amount of time, a second estimated execution time is then calculated for processing the query using a second amount of performance capabilities from the first set of system resources. Here, the second amount of performance capabilities is in addition to the first amount of performance capabilities. If the second estimated execution time does not exceed the threshold amount of time, the query is executed using the second amount of performance capabilities from the first set of system resources.

Abstract: Online information is retrieved for a user. An original query submitted by the user is received which includes a plurality of query terms the user associates with particular online information the user is interested in. The original query is then analyzed using data from an online knowledge repository and a historical query log of a search engine to determine central concepts of the original query. A revised query results from this analysis which includes one or more of the central concepts. The revised query is then submitted to the search engine. Search results for the revised query are then provided to the user.

Abstract: In a networked computer system that includes multiple nodes and multiple networks interconnecting the nodes, a database query optimizer takes network choice into consideration when optimizing a query. The query optimizer logs historical information for queries that includes network information. A network monitor determines network characteristics of the multiple networks. The query optimizer then selects a network for a query based on the network characteristics, and optionally based on the historical information as well. The result is a query optimizer that takes network choice into consideration, thereby providing a query that is optimized according to the characteristics of the networks.

Abstract: One example discloses a database management system that can comprise a memory for storing computer executable instructions and a processing unit for accessing the memory and executing the computer executable instructions. The computer executable instructions can comprise a compiler to hold a query received at a query input, thereby preventing the query from executing based on a cost comparison between an estimated resource execution cost of a query plan for the query and cost rules.

Abstract: A pattern matching accelerator (PMA) for assisting software threads to find the presence and location of strings in an input data stream that match a given pattern. The patterns are defined using regular expressions that are compiled into a data structure comprised of rules subsequently processed by the PMA. The patterns to be searched in the input stream are defined by the user as a set of regular expressions. The patterns to be searched are grouped in pattern context sets. The sets of regular expressions which define the pattern context sets are compiled to generate a rules structure used by the PMA hardware. The rules are compiled before search run time and stored in main memory, in rule cache memory within the PMA or a combination thereof. For each input character, the PMA executes the search and returns the search results.

Abstract: There is provided a computer-implemented method of executing a query plan against a database. An exemplary method comprises accessing a first subset of rows of a database table using a direct access method for an index. The query plan may comprise the direct access method. The exemplary method also comprises determining a processing cost of accessing the first subset of rows. The exemplary method further comprises modifying the direct access method for the index in response to determining that the processing cost exceeds a specified threshold. Additionally, the exemplary method comprises accessing a second subset of rows of the database table using the modified direct access method.

Abstract: A method and apparatus for generating at least one data record in respect to a database query comprising a fetch command. A database may be updated according to the at least one data record. In an exemplary embodiment, a database management system may be tested by performing the database query against the database. In another exemplary embodiment, a data record that satisfies the database query is generated in order to increase coverage when testing a database management system.

Abstract: A method is provided for transforming entity and relation data using a proxy engine. A proxy data engine can intercept a virtual query directed to a data provider application on a data repository device. The proxy data engine can transform the virtual query into a native query capable of being processed by the data provider application. The virtual query can include a virtual entity-relation object not included in the native query. The proxy data engine can transform a native result into a virtual result including the virtual entity-relation object. The native result can be a response to the native query and the native result can be received by the data provider application.

Abstract: A system, method, and computer-readable medium for optimized processing of queries that feature maximum or minimum equality conditions are provided. The disclosed mechanisms provide for a single-scan of the table on which the group-by query is applied. When the table is scanned, each processing module dynamically keeps track of the row(s) having a value of the attribute on which the equality condition is applied that equals or exceeds the maximum attribute value (assuming a maximum equality condition is applied) previously encountered by the processing module. Subsequently, a global aggregation process is then performed to compute the query's result without rescanning the table. Queries featuring a minimum equality condition are similarly processed in accordance with the disclosed embodiments.

Abstract: A system and method for implementing incremental evaluation that is advantageous over nonincremental evaluation. The system and method incrementally maintain each individual aggregate value, for non-nested queries, using a constant amount of work.

Abstract: A “Book of Business” (or Book) is a set of business domain data of one or more book types. This set of data is identified by a “driving condition” or quality. A driving condition typically arises from a business practice, and may be further qualified by local conditions. Accordingly, data may be organized based on local activities or conditions that may not be explicitly stored in a database. In one embodiment, a method for querying the database includes identifying data in a database. The data is organized into one or more segments. A book of business associated with a segment in the one or more segments is then generated. The book of business includes a set of references to the data organized into the segment. A query plan may be determined based on the book of business. A set of results may then be generated based on the query plan.

Abstract: Adaptive index density in a database management system is provided, which includes receiving a number of partitions for an index for a database table, the index subject to creation. The adaptive index density also includes selecting a column from the database table, the column selected based upon an estimated frequency of execution of database queries for the column. The adaptive index density further includes calculating an estimated cost of executing each of the database queries for the column, and determining data to reside in each of the partitions of the index responsive to the estimated cost.

Abstract: A system and methods for implementing a materialized view for a query are provided. The query system includes a database that includes a base table. The base table can include a set of data. The query system also includes a materialized view associated with a portion of the set of data, and a MVQR component to translate each of a range predicate of the materialized view and a range predicate of a query into a canonical range representation (CRR) format in materialized view metadata and query metadata, respectively, to enable the query to search the materialized view.

Abstract: Systems and apparatuses are provided for integrating user defined functions into an analytical data processing framework. The system includes a plurality of user defined functions (28), each having metadata defining an associated class type.

Abstract: Methods and apparatus, including computer program products, for selection of rows and values from indexes with updates. In general, rows of an index may be associated with validity flags that indicate whether a row has been updated with an update inserted in a delta index; one scheme for value identifiers may be used for an index and another scheme for one or more delta indexes where all of the indexes are, to at least some extent, compressed according to dictionary-based compression; and multiple delta indexes may be used in alternation such that one delta index may accept updates while another is being updated. The delta indexes may also have validity flags and all updates, such as modifications of values, deletion of records, and inserting of new records may be handled as updates accepted by one or more delta indexes.

Abstract: Database tables can have different types of database indices defined for the database tables and different numbers of database indices. The efficiency of reading the indexes can vary with the different profiles of the indexes, which impacts the costs of access plans that use the indexes. Weights can be predefined to reflect the relative efficiencies of the different characteristics. Costs can be computed in accordance with a variety of techniques (e.g., based on edge traversals). The weights can be predefined to reduce costs, increase costs, or a combination thereof. A database management application or associated application or program can also refine or revise these weights based on statistical data gathered about the operation of the database and/or heuristics that are developed based on observations/research. The corresponding weights can be adjusted accordingly.

Abstract: A method and system for rewriting Structured Query Language (SQL) statements. A SQL statement having search criteria including conditions pertaining to fields in database tables is received. A table from the SQL statement listing all combinations of the search criteria is created, every combination reflecting a subset of information used to determine combined results. A set of patterns among the possible combinations of the SQL statement based on the fields referenced in the combinations is identified. The table based on the set of patterns is sorted. Based on the sorting, the table is divided into temporary tables which are joined with the SQL statement. New temporary tables are generated. Each new temporary table includes results of a search conducted using a separate portion of the SQL statement as joined with the set of temporary tables. All results from the new temporary tables are combined into a single result table.

Abstract: A system and method for distributing information (collectively the “system”) is disclosed. The system includes category-based, geography-based, and ratings-based attributes to better “focus” the information distributed by the system. In the processing of listing-based attributes (e.g. attributes limited to a particular listing), the system can also be influenced by relationship-based attributes (e.g. attributes between the administrator of the system and the advertisers, and even potentially users).

Abstract: According to an embodiment, a receiving apparatus includes a memory, a first generator, a second generator, a transmitter, a receiver. The memory stores service information including search criteria set in a memory device and a connection method for connecting with the memory device. The first generator generates a common search query that is a search query expressing search conditions used in searching contents and that includes at least a pair of a common search condition attribute and a common search condition attribute value. The second generator generates a search query according to the search criteria specified in the service information with the use of the generated common search query. The transmitter transmits the generated search query to the memory device based on the connection method specified in the service information. The receiver receives, from the memory device, the attribute information obtained as a result of executing the search query.

Abstract: A search index structure which extends a typical composite index by incorporating an index which is optimized for fast retrieval from storage and which eliminates data which is specific to phrase searching. Other data is represented in a manner which allows it to be calculated rather than stored. Associating variable length entries with logical categories allows their length to be inferred from the category rather than stored. Using delta values between document IDs rather than the ID itself generates a compact, dense symbol set which is efficiently compressed by Huffman encoding or a similar compression method. Using an upper threshold to remove large, and thus rare, delta values from the symbol set prior to encoding further improves the encoding performance.

Abstract: Systems and methods for automatically processing a textual document by identifying occurrences of a piece of text having a predetermined format in the textual document; determining a depth-of-treatment value for each piece of formatted text in the textual document, the depth-of-treatment value indicating a depth of treatment in the textual document afforded to the particular piece of formatted text; associating an abstract with each piece of formatted text in the textual document; and generating a data record containing each identified piece of formatted text from the textual document, the depth-of-treatment value and the abstract associated with each piece of formatted text in the textual document.

Abstract: Devices, methods and systems for processing database queries formatted differently than the database storage model being queried are disclosed. Processing database queries independent of the storage model of the queried database may be performed by receiving a query for one or more data items stored in a database, determining whether to use at least one query operator that uses data having a format different from the storage model format of at least one of one or more data items stored in the database and converting the format of the data used by the at least one query operator to a format that matches the storage model format of at least one of one or more data items stored in the database. Related systems, methods, and articles of manufacture are also described.

Abstract: A method, article of manufacture, and apparatus for processing information are disclosed. In some embodiments, this includes receiving a query plan, generating a work file based on the query plan, associating the query plan with a work file, storing the association, and storing the work file in a storage device after the query plan has executed. In some embodiments, a hash of the query plan may be generated.

Abstract: The claimed subject matter provides a system and method for automatic allocation of tenants to database services. An exemplary method comprises determining a query plan based on a workload for each tenant. A distance metric is created based on the query plan for each tenant, and tenants are clustered based on the distance metric into a predetermined number of clusters which is equal to the predetermined number of databases.

Abstract: An agent based system assists in preparing an individual for an upcoming meeting by helping him/her retrieve relevant information about the meeting from various sources based on preexisting information in the system. The system obtains input text in character form indicative of the target meeting from a calendar program that includes the time of the meeting. As the time of the meeting approaches, the calendar program is queried to obtain the text of the target event and that information us utilized as input to the agent system. Then, the agent system parses the input meeting text to extract its various components such as title, body, participants, location, time etc. The system also performs pattern matching to identify particular meeting fields in a meeting text.

Abstract: A system, a program product and an associated method is provided for data processing management in a computing environment having at least a processor. The method comprises creating in the memory an invalidation index having a plurality of rows, each row further comprising a search key field, an ID list field for IDs of records associated with the database, and a count value field. Every time a new reference query is received the processor searches for a row in said invalidation index with an already created search key and then decreases count value of a counter when a match is found and when a match is not found creating a new search key and a new row in an associated invalidation index for said new key.

Abstract: Certain example embodiments described herein relate to techniques for user feedback driven dynamic query rewriting in complex event processing (CEP) environments. In certain example embodiments, the adjustment of already-initiated queries may be permitted during runtime in order to help continuously or substantially continuously meet a user's requirements. In certain example embodiments, parameters of a query may be adapted dynamically, e.g., without the need to redeploy it. Adaptable parameters in certain example embodiments may be identified and/or based on, for instance, an automatic determination from original query creation, user specifications, the way in which a user interacts with a user interface for visualizing the results of queries, etc.

Abstract: Described herein are technologies pertaining to migrating state information of operators in a first continuous query plan to a second continuous query plan in an asynchronous manner, such that the first continuous query plan need not cease executing during the migrating of the state information. State information pertaining to stateful operators, such as join operators, is migrated from the first continuous query plan to the second continuous query plan by way of a transformation plan. State matching is utilized to generate the transformation plan.

Abstract: A method for optimizing data types includes the step of generating a data structure providing access to at least one data element, the data structure associated with a first representation of the at least one data element. A user is provided with a plurality of data types for accessing the at least one data element. A request for access to the at least one data element is received, the request including at least one of the plurality of data types. The request is responded to with a second representation of the at least one data element, the second representation generated responsive to the at least one of the plurality of data types.

Abstract: Systems and associated methods for providing scalable presence subscriptions in federated presence environments are described. Embodiments provide for intelligent addition of subscriptions to a presence system. Embodiments identify if a virtualized presentity (corresponding to a new query) can be composed from existing virtualized presentities, and if so, corresponding query processing cells (QPCs) (servicing existing queries) are reused to retrieve the presence information (partially or fully) for the new incoming query. Embodiments organize the existing QPCs into a hierarchy such that a QPC/virtual presentity at a higher layer fetches presence information of all or some presentities from QPCs/virtual presentities at lower layer(s) to service the new query.

Abstract: Methods and apparatus, including computer program products, are provided for providing for processing calculation plans. In one aspect, there is provided a computer-implemented method. The method may include generating a calculation plan including a plurality of nodes; determining whether at least one of the nodes includes a function node; and compiling the function node into executable code to enable execution of the plurality of nodes including the function node at the database. Related apparatus, systems, methods, and articles are also described.

Abstract: Techniques for collecting statistics of column data or R-Tree indexes are provided. A distributed database system includes a plurality of processing nodes controlling portions of spatial data. The nodes are instructed to create minimum bounding rectangles (MBR's) for their spatial data or R-Trees. The individual MBR's are merged and reformatted into a grid of equally sized cells. Each processing node is provided a copy of the grid to update based on statistics of each processing node's spatial data for a target table. The updated grids are then merged into a single grid and used by an optimizer to evaluate queries before the queries are executed.

Abstract: A method that identifies common peaks among unidentified peaks in the data from different LC-MS or LC-MS/MS runs is provided. The method employs an algorithm, herein referred to as “Precision Peak Matching (PPM).” The different runs can be from different laboratories, instruments, and biological samples that result in a significant variability in the data. PPM allows estimation and control of precision, defined as the fraction of truly identical peptide pairs among all pairs retrieved, in the matching process. PPM finds the maximal number of peptide pairs at a prescribed precision, thereby allowing quantitative control over the trade off between the number of true pairs missed, and false pairs found. PPM finds common peptides from a database of LC-MS runs of heterogeneous origins, and at the specified precision. PPM fills a much-needed role in proteomics by extracting useful information from disparate LC-MS databases in a statistically rigorous and interpretable manner.

Abstract: Embodiments of the present invention address deficiencies of the art in respect to subscribing and updating nodes within XML documents and provide a novel and non-obvious method, system and computer program product for matching various combinations of XML Path Language (XPATH) Uniform Resource Identifiers (URIs). In one embodiment of the invention, a method for matching various combinations of XML Path Language (XPATH) Uniform Resource Identifiers (URIs) that includes receiving a XPATH expression for a node in an XML document, retrieving the node identified by the XPATH expression, determining if a template exists for the identified node, where the template resides in a database of a document management system, comparing the template expression to the XPATH expression and determining if the expressions match.

Abstract: MESA utilizes novel tools and strategies to more efficiently search and retrieve records from an electronic database. An Integrated System Optimizer (ISO) programmable computer system is electronically linked to related database platform systems to dynamically monitor, supervise, control, track and communicate the status of each database query. ISO analyzes IVR speaker dependent and speaker independent confidence levels; determines number of records in initial, subsequent and final subsets of records formed by AlphaOmega combinations and subsets formed by statistical, subjective and objective virtual search parameters; selects optimum search algorithms or search sequence for each query; determines the frequency of occurrence for AlphaOmega combinations; transmits optimum search activity for each query to database subsystems including Intelligent Queries to disambiguate similar records.

Abstract: Systems and methods are described herein that can implemented by a middle tier of a multi-tier data retrieval system to select data operation(s) that correspond to a query. The query may be received from a front tier. The selection is performed by comparing the query to a query template associated with each data operation. The query template for each data operation includes an algebraic description of queries that each respective data operation can satisfy. The selected data operation(s) are then executed against a data service to obtain data, which is then provided to the front tier. In some embodiments, an execution plan may be created by the middle tier for satisfying the query. The execution plan can include the selected data operation(s) and post-processing step(s). The post-processing step(s) can be applied to the obtained data to satisfy the query. The post-processed data is then provided to the front tier.

Abstract: A base/inversion component extractor calculates an occupancy rate of each component of a vector of user preference information obtained from information stored on a user preference database, and extracts a base component from the user preference information in accordance with the calculated occupancy rate of the base component. The base/inversion component extractor extracts a similar base component from item preference information obtained from information stored on an item metadatabase. A recommendation engine calculates a similarity between a base vector of the user preference information and a base vector of the item preference information, and identifies, as candidate items, items of the predetermined number in the order of from high to low similarity. The recommendation engine further calculates a similarity between an inversion vector of the user preference information and an inversion vector of the item preference information, and identifies an item candidate having a low similarity.

Abstract: Disclosed are an apparatus, method, and program product which each provide an enhanced database engine. Access to precise values is provided while permitting unfettered access to those who are not interested in precise values. This is accomplished via an enhanced database index and indexing method. The entries of the database index are normalized to exclude precision. Individuals interested in precision can then specify precision as part of their query through use of a PRECISE keyword. Results are then filtered to account for the specified precision.

Abstract: Techniques for managing query execution based on memory usage using memory compression. Embodiments may receive a query from a requesting entity and estimate an amount of memory required to execute the query. Upon determining that executing the query would consume an impermissible amount of memory, embodiments may optimize the query by adjusting an amount of memory compression used in executing the query. The optimized query may then be executed to produce a set of query results, which may then be returned to the requesting entity.

Abstract: Systems, methods and articles of manufacture for determining at least one algorithm from a pool of algorithms to optimize a query. An embodiment includes building optimization blocks for the subplan, determining the complexity of the subplan based on the optimization blocks and selecting an algorithm from a pool of search space generation algorithms based on complexity of the subplan and characteristics of the selected algorithm, and optimizing the subplan with the selected algorithm.