Entries |
Document | Title | Date |
20100082599 | Characterizing Queries To Predict Execution In A Database - One embodiment is a method that obtains query plans for queries in the workload. The query plans include a tree of operators and estimated cardinalities for nodes in the tree. The method then groups the operators for the queries and characterizes the workload in terms of grouped operators to predict performance of the queries before the queries execute in a database. | 04-01-2010 |
20100094861 | SYSTEM AND METHOD FOR APPLICATION SESSION TRACKING - A system and method for application session tracking includes activating an application component for execution using an application session tracking facility (ASTF) and intercepting resource requests by the ASTF acting on behalf of this application. Resources are managed by allocating or releasing resources in accordance with resource usage profiles determined by system or application administrators of an application. The ASTF approach allows for controlling the usage of (potentially) distributed resources such as temporary space, database assets such as materialized views, directory services, shared memory segments among others during runtime and their return to their respective free pools and any necessary subsequent cleanup tasks upon a session termination. | 04-15-2010 |
20100100537 | SYSTEM AND METHOD FOR IDENTIFYING TRENDS IN WEB FEEDS COLLECTED FROM VARIOUS CONTENT SERVERS - Systems and methods for identifying trends in web feeds collected from various content servers are disclosed. One embodiment includes, selecting a candidate phrase indicative of potential trends in the web feeds, assigning the candidate phrase to trend analysis agents, analyzing the candidate phrase, by each of the one or more trend analysis agents, respectively using the configured type of trending parameter, and/or determining, by each of the trend analysis agents, whether the candidate phrase meets an associated threshold to qualify as a potential trended phrase. | 04-22-2010 |
20100106708 | Eliminating unnecessary statistics collections for query optimization - A method and system for eliminating unnecessary statistics collections for query optimization in a database stored on a computer. Statistics are unnecessary when a re-generated query execution plan that does not use the statistics is equivalent to an original query execution plan that uses the statistics. To determine this, an original query execution plan is created for each query in a specified workload using the statistics in the database. A search is performed of the statistics in order to enumerate one or more candidate sets of statistics to be eliminated. One or more of the candidate sets of statistics are removed from consideration prior to creating the re-generated query execution plan for each query in the specified workload. The re-generated query execution plan, which was created with one or more of the candidate sets of statistics removed from consideration, is compared with the original query execution plan, which was created using the statistics, in order to determine whether the re-generated query execution plan and the original query execution plan are equivalent. The one or more of the candidate sets of statistics removed from consideration are identified as unnecessary when the re-generated query execution plan and the original query execution plan are equivalent. | 04-29-2010 |
20100106709 | FILE SEARCH SYSTEM AND FILE SEARCH SERVER DEVICE - Provided is a mechanism that, when presenting a search result to a user while reducing the load on a file server, sets a file to be accessible to the user only when the user is authorized to access the file and folders of all hierarchical levels. In the case of adapting a search method that includes, under the condition of using a file system having a folder hierarchical structure where the right of access to each folder and file is set, creating an index file for files to be searched for in advance, and searching for a file specified as a search target with reference to the index file, an appropriate right of access to each file and folder is set in creation of the index file, whereby it becomes possible to display as search results only the files that the relevant user is authorized to read. | 04-29-2010 |
20100114865 | Reverse Mapping Of Feature Space To Predict Execution In A Database - One embodiment is a method that generates points from an input space obtained from a query for a database. A kernel function maps the points from the input space to a feature space. Given a point in the feature space, a reverse mapping identifies coordinates in the input space for the point to predict performance of the query before the query executes in the database. | 05-06-2010 |
20100114866 | CREATING AND ADMINISTERING A PROCESS STUDY - Described are computer-based methods and apparatuses, including computer program products, for creating and administering a process study. An administrator creates and configures a process study on a site on a network. A server on the network creates a process sampling module based on the process study. Participants in the study install the process sampling modules on their end client computing devices. The process sampling modules collect process sampling data from the participants and transmit the data to the server for collection. | 05-06-2010 |
20100114867 | Virtual Environment Spanning Desktop and Cloud - A method and system are given for providing a virtual environment spanning a desktop and a cloud. In one example, the method includes receiving a query template over a data set that resides in the cloud, optimizing the query template to segment the query template into an offline phase and an online phase, executing the offline phase on the cloud to build one or more indexes, and sending the one or more indexes to the desktop. | 05-06-2010 |
20100121836 | SYSTEM, METHOD, AND COMPUTER-READABLE MEDIUM FOR ELIMINATING UNNECESSARY SELF-JOINS IN A DATABASE SYSTEM - A system, method, and computer-readable medium for optimizing query performance in a database system are provided. In one embodiment, join predicates of a self outer join are evaluated. If each join predicate is respectively based on a common join attribute, and each join attribute has a not null constraint applied thereto, the self outer join may be re-written as a self inner join. In another embodiment, if not null and unique constraints are applied to each join attribute of an inner join featuring join predicates each respectively based on a common join attribute, the inner join may advantageously removed thereby resulting in a select operation. | 05-13-2010 |
20100121837 | Apparatus and Method for Utilizing Context to Resolve Ambiguous Queries - A computer readable storage medium includes executable instructions to derive from a database schema an irreducible ambiguous group comprising a sub-schema with a set of vertices wherein any two vertices are part of a loop. Contexts are defined on the sub-schema. For each context, joins in the sub-schema are designated as mandatory joins, excluded joins and neutral joins. A selection of a context from multiple contexts invoked by a path characterizing a query is processed. The query is resolved using the context. | 05-13-2010 |
20100125565 | Actively managing resource bottlenecks in a database system - A computer-implemented method, apparatus and article of manufacture for optimizing a database query. Resource usage of one or more resources of the computer system are monitored. A condition code representative of the monitored resource usage is stored. A cost model is modified using the stored condition code. A query execution plan is generated for the database query using the modified cost model. The query execution plan is then executed in order to retrieve data from a database stored on the computer system, wherein the retrieved data is presented to a user for subsequent use and analysis. | 05-20-2010 |
20100138405 | Hybrid Push/Pull Execution of Continuous SQL Queries - Illustrative embodiments provide a computer-implemented method for hybrid push/pull of continuous structured query language queries. The computer-implemented method receives stream input, wherein the stream input comprises events of interest, builds and a state machine and stream plans, based on an original query, and replicates the stream input. Responsive to a push sub-query trigger, the computer-implemented method submits a pull sub-query to the database to produce a result, and sends the result to a requester. | 06-03-2010 |
20100138406 | File access method and system - Disclosed is a file accessing method of a file system which manages data by a block unit of a fixed size having an index and provides information associated with a file via a plurality of entries having an index and linked information of each of blocks forming the file. The file accessing method includes providing a hint information area to each of the plurality of entries so as to record an access mode or continuous allocation information for the file, allocating the plurality of blocks to record contents of the file, and recording the access mode in each of the hint information areas of entries corresponding to a first chain group of the allocated blocks and the continuous allocation information in the hint information area of at least one entry corresponding to a second chain group of the allocated blocks. | 06-03-2010 |
20100138407 | GENERATING HISTOGRAMS OF POPULATION DATA BY SCALING FROM SAMPLE DATA - Histograms formed based on samples of a population, such as histograms created from random page-level samples of a data store, are intelligently scaled to histograms estimating distribution of the entire population of the data store. As an optional optimization, where a threshold number of duplicate samples are observed during page-level sampling, the number of distinct values in the overall population data is presumed to be the number of distinct values in the sample data. Also, during estimation of distinct values of an overall population, a “Chao” estimator can optionally be utilized as a lower bound of the estimate. The resulting estimate is then used when scaling, which can take domain knowledge of the data being scaled into account in order to prevent scaled estimates from exceeding the limits of the domain. Also, a “sum of the parts” mathematical relationship can be taken into account during scaling that the sum of the scaled distinct values for each bin of an estimate histogram should total an estimate for the total distinct values of the entire population. | 06-03-2010 |
20100145929 | ACCURATE AND TIMELY ENFORCEMENT OF SYSTEM RESOURCE ALLOCATION RULES - A computer-implemented method, apparatus and article of manufacture for optimizing a database query. A query execution plan for the database query is generated using estimated cost information; one or more steps of the query execution plan are executed to retrieve data from a database stored on the computer system. Actual cost information is generated for each of the executed steps, and the estimated cost information is re-calculated using the actual cost information. One or more resource allocation rules defined on one or more steps of the query execution plan are executed, based on the estimated cost information, wherein the resource allocation rules include one or more defined actions. The estimated cost information may be re-calculated using the actual cost information when confidence in the estimated cost information is low, but the estimated cost information may not be re-calculated when confidence in the estimated cost information is high. In addition, the estimated cost information may be re-calculated using the actual cost information, only when the step has one or more resource allocation rules defined thereon. | 06-10-2010 |
20100161589 | Graphical Representation of Query Optimizer Search Space In A Database Management System - A system, method, and computer program product are provided for generating a graphical representation of a query optimization process. The method comprises the steps of parsing a search space log, presenting one or more evaluated access plans on an axis of a timeline, identifying a best access plan on the timeline, and outputting a graphical representation of the timeline. An additional system, method, and computer program product are provided for recording a query optimization process of a query optimizer. | 06-24-2010 |
20100169302 | SYSTEM, METHOD, AND COMPUTER-READABLE MEDIUM FOR GROUPING DATABASE LEVEL OBJECT ACCESS COUNTS PER PROCESSING MODULE IN A PARALLEL PROCESSING SYSTEM - A system, method, and computer-readable medium for grouping of database object access counts per processing module in a parallel processing system are provided. Each processing module manages an intermediate cache allocated thereto that stores database object access counts local to the respective processing module. The processing modules are configured in a hierarchical configuration and processing modules at the lowest level of the configuration forward their respective intermediate cache to a processing module configured as a parent to the respective processing module. On receipt of intermediate cache(s) from lower level processing modules, a processing module merges the received intermediate caches with the intermediate cache allocated to the processing module. The process is iteratively repeated until a root processing module receives the intermediate caches from processing modules configured as child nodes thereto. The root processing module merges the received intermediate cache(s) with the root processing module's intermediate cache thereby generating a final cache. An objects access count data structure is then generated by the root processing module. The object access count data structure of the final cache includes data blocks of object access counts where each data block is associated with a particular access module processor (AMP). The data blocks may then be forwarded to the associated AMPs. | 07-01-2010 |
20100174701 | MULTI-COLUMN STATISTICS USAGE WITHIN INDEX SELECTION TOOLS - In an example embodiment, a method is illustrated to determine multi-column indexes, the method including receiving one or more structured query language (SQL) queries, the one or more SQL queries defining a workload. A database index analysis tool may be used to determine a plurality of index configurations for executing the workload. Further, leading index configurations may be determined, leading index configurations including a subset of the plurality of index configurations. Also, a statistics database may be updated with complete statistics for the leading index configurations. | 07-08-2010 |
20100174702 | INDEPENDENT COLUMN DETECTION IN SELECTIVITY ESTIMATION - Techniques for independent column detection in selectivity estimations are provided. Values for database statistics are sampled and two independent tests are performed against the values for a first column and a second column. When each test determines that the first and second columns are independent, the first and second columns are said to be independent columns for selectivity estimation. | 07-08-2010 |
20100191716 | STRUCTURED PARALLEL DATA INTENSIVE COMPUTING - Methods, systems, and computer program products are provided for performing structured parallel data intensive computations. A SQL-FCF framework that defines a SQL construct based interface for performing the computations is provided. The computations within an application are coded as table valued functions (TVFs). Data for the application is partitioned into data partitions to co-locate and load balance the data partitions and corresponding computations. The TVFs are invoked and applied to corresponding ones of the data partitions in a structured order defined by function control forms (FCF). | 07-29-2010 |
20100191717 | OPTIMIZATION OF QUERY PROCESSING WITH TOP OPERATIONS - A query processing system performs multiple optimizations of a merge sort for “top” operations. An illustrative query processing system comprises a receiver that receives database query inputs with a top request, and a sort logic that sorts the inputs using temporary files to store intermediate sort data and applies top qualifications to sorted output. An optimizing logic that modifies operation of the sort logic and reduces the number of records in the inputs copied into temporary files. | 07-29-2010 |
20100198806 | EVALUATION OF SET OF REPRESENTATIVE QUERY PERFORMANCE USING ROBUSTNESS MAPPING - Computer-implemented systems and associated operating methods use atomic query maps to identify and evaluate database query plan robustness landmarks. The computer-implemented system comprises logic that evaluates robustness of a selected atomic query by measuring performance of atomic query execution in a predetermined range of runtime conditions that include data characteristics. The logic produces a set of measurements that can be displayed as one or more performance maps and analyzes the measured performance to identify landmarks indicative of database atomic query performance degradation greater than a predetermined amount. | 08-05-2010 |
20100198807 | WORKLOAD MANAGEMENT USING ROBUSTNESS MAPPING - Computer-implemented systems and associated operating methods use performance maps created by evaluating robustness of a database operator, query plan, or query to analyze health of a currently-executing query. The computer-implemented system comprises logic that receives one or more robustness maps of measured database system performance acquired during database execution in a predetermined range of runtime conditions. The logic analyzes state of a currently-executing query by locating the query's performance on the robustness maps. | 08-05-2010 |
20100198808 | DATABASE SYSTEM IMPLEMENTATION PRIORITIZATION USING ROBUSTNESS MAPS - Computer-implemented systems and associated operating methods take measurements and landmarks associated with robustness maps and perform tests evaluating the robustness of a database engine's operator implementations and/or query components. The illustrative computer-implemented system comprises logic that receives one or more robustness maps of measured database system performance acquired during database execution in a predetermined range of runtime conditions and uses information from the robustness map or maps to prioritize potential changes that improve robustness of a database system implementation wherein landmarks in the robustness map or maps are operated upon as a robustness bug describing conditions under which a predetermined implementation of a database operator or query component degrades in a manner different from a predetermined expected manner. | 08-05-2010 |
20100198809 | DATABASE SYSTEM TESTING USING ROBUSTNESS MAPS - Computer-implemented systems and associated operating methods take measurements and landmarks associated with robustness maps and perform tests evaluating the robustness of a database engine's operator implementations and/or query components. The illustrative computer-implemented system comprises logic that receives one or more robustness maps of measured database system performance acquired during database execution in a predetermined range of runtime conditions and uses information from the robustness map or maps to perform regression testing wherein landmarks in the robustness maps are operated upon as a robustness bugs describing conditions under which a predetermined implementation of a database operator or query component degrades in a manner different from a predetermined expected manner. | 08-05-2010 |
20100217758 | METHOD, SYSTEM, AND COMPUTER PROGRAM PRODUCT FOR OPTIMIZING A DATABASE QUERY - 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. | 08-26-2010 |
20100223253 | AUTOMATIC QUERY EXECUTION PLAN MANAGEMENT AND PERFORMANCE STABILIZATION FOR WORKLOADS - A method, apparatus, and computer program product are disclosed for managing query execution plans for a workload. In one embodiment, the method includes gathering an initial set of performance characteristics generated from a database management system (DBMS) executing a database workload according to one or more query execution plans (QEPs). The database workload includes one or more database statements. The method determines a QEP change for one or more QEPs of the database workload. In addition, the method gathers a subsequent set of performance characteristics generated from the DBMS executing the one or more QEPs of the database workload influenced by the QEP change. Furthermore, the method determines a performance difference created by the QEP change based on the initial set of performance characteristics and the subsequent set of performance characteristics and responds to the performance difference in accordance with a monitoring policy. | 09-02-2010 |
20100235344 | MECHANISM FOR UTILIZING PARTITIONING PRUNING TECHNIQUES FOR XML INDEXES - Techniques are provided for utilizing partition pruning for XML indexes. The computer-implemented method comprises storing XML documents in a document table, which is equi-partitioned with a corresponding index table, and wherein the partitioned document table and the partitioned index table can be searched using a query comprising a partitioning pruning directive. | 09-16-2010 |
20100235345 | INDIRECT DATABASE QUERIES WITH LARGE OLAP CUBES - A large OLAP cube includes data and dimensions not required for a particular query, or for a collection of queries. A response to a query is generated by using the large OLAP cube rather than using an OLAP cube tailored to the query, and rather than querying the relational database directly. The large OLAP cube may be created after identifying a set of frequently sought data and/or filters used in queries to the relational database. Data may be staged by creating a smaller OLAP cube with data extracted from the large OLAP cube. The cubes may then be queried, browsed, and used to prepare reports or generate flat files. | 09-16-2010 |
20100235346 | MULTI-TIERED SYSTEM FOR SEARCHING LARGE COLLECTIONS IN PARALLEL - The system includes a pre-retrieval predictor which determines which collection to submit the query to with a certain degree of confidence. The query is then submitted to either one collection, or multiple collections in parallel. When the results are returned, they are assessed and if they are deemed adequate they are shown to the user. If they are inadequate, the results from the smaller and larger collections are merged and shown to the user. Only if the predictor failed to send the query to more than one collection and the result is not adequate, the query is sent to other collections and executed in a sequential fashion. Overall, large scale searching can be accomplished much more efficiently with no degradation in the quality of the retrieved results and a small increase in processing cost. | 09-16-2010 |
20100235347 | TECHNIQUES FOR EXACT CARDINALITY QUERY OPTIMIZATION - An exact cardinality query optimization system and method for optimizing a query having a plurality of expressions to obtain a cardinality-optimal query execution plan for the query. Embodiments of the system and method use various techniques to shorten the time necessary to obtain the cardinality-optimal query execution plan, which contains the query execution plan when all cardinalities are exact. Embodiments of the system and method include a covering queries technique that leverages query execution feedback to obtain an unordered subset of relevant expressions for the query, an early termination technique that bounds the cardinality to determine whether the processing can be terminate before each of the expressions are executed, and an expressions ordering technique that finds an ordering of expressions that yields the greatest reduction in time to obtain the cardinality-optimal query execution plan. | 09-16-2010 |
20100268703 | METHOD OF SEARCH STRATEGY VISUALIZATION AND INTERACTION - A method for visually representing a search query that includes obtaining a desired search query, preparing a collection of search strategies for a query service, submitting the collection of search strategies to a query service, processing the search results, and displaying a visualization map of the search results that graphically represents the plurality of search strategies. The collection of search strategies is composed of a plurality of core search strategies for the desired search query and at least one combination of at least two core search strategies. The visualization map includes a plurality of graphical objects, and a graphical object represents a search strategy of the collection of query strategies. | 10-21-2010 |
20100299319 | METHOD, APPARATUS, AND ARCHITECTURE FOR AUTOMATED INTERACTION BETWEEN SUBSCRIBERS AND ENTITIES - A method for interaction between a subscriber and an entity includes determining a current locus and acquiring change in status information for a subscriber. Preference information, for one or more searchable parameters selected by the subscriber, and association information, for one ore more contacts made by the subscriber, are acquired. First and second strength information is then acquired. First strength information pertains to the subscriber's affinity for the preference information and second strength information encompasses the subscriber's affinity for the association information. Responsive to the change in status information, a group of first entities is selected. First entity information about the group of first entities is then generated. The current locus information, the preference information, the association information, the first strength information, and the second strength information are correlated with the first entity information to produce correlation information. Finally, the correlation information is provided to the subscriber to be displayed. | 11-25-2010 |
20100306188 | PERSISTENT QUERY PLANS - A system and method for processing database queries. An optimizer produces query plans based on queries. Query plans are stored in a persistent storage. In response to receiving a query, the system selectively retrieves a stored query plan corresponding to the query for execution. Optimization of the query may be selectively performed. A stored query plan or a new query plan may be executed. Based on metrics collected during execution, the system may automatically revert to a stored plan other than the one being executed. Based on metrics of a reverted to plan, the system may roll back to the first plan. The persistent storage enables the use of query plans after a system restart, transfer to another device, or other changes. | 12-02-2010 |
20100318509 | METHODS AND SOFTWARE FOR ANALYSIS OF RESEARCH PUBLICATIONS - In one aspect, the invention comprises a computer system for searching databases and displaying search results, comprising databases storing information regarding publications and authors comprising author, title, date of publication, cited references, and citing references data; and Internet servers in communication with those databases; wherein at least one of those Internet servers is in communication with and operable to transmit data to a Web browser resident on a user's computer, and wherein the data is sufficient to enable the browser to display a citation overview page comprising: (a) a list of one or more titles of publications or names of authors, and (b) one or more displayed numerals representing how many publications in one or more specified categories cite to each of the publications, or, for author names, how many publications in one or more specified categories cite to publications on which those names are listed as authors. | 12-16-2010 |
20110004589 | DIAGNOSTICS IN A DISTRIBUTED DIRECTORY SYSTEM - Providing diagnostic functions for a distributed directory employed in an industrial control environment is described herein. By way of example, status of directory entries can be monitored, updated based on activity within the control environment, and propagated to entities coupled with the environment by way of distributed directory nodes. Directory entries can be validated over time and optionally flagged as valid or deleted if invalid. In some aspects, validation can occur via direct communication with entities coupled to the control environment. Changes to directory entries can be tracked, and can be propagated through the distributed directory. Further, automatic reconfiguration of control entities can be implemented based on the changes, resulting in a dynamic and self-adapting control environment. | 01-06-2011 |
20110022581 | DERIVED STATISTICS FOR QUERY OPTIMIZATION - A method and system for maintaining derived statistics within a database system. The method includes associating initial statistical information with at least one relation within the database system; composing derived statistics involving the at least one relation; deriving distinctiveness information including at least one relation; and augmenting the derived statistics with the derived distinctiveness information. The derived statistics are associated with the at least one relation. The initial statistical information and the derived statistics are exposed to a query optimizer. | 01-27-2011 |
20110029506 | METHOD AND APPARATUS FOR BOUNDING LARGE QUERY OPERATIONS - Bounding of large queries is provided in a network analysis environment by receiving a user query of a data set of network transactions, submitting a meta data query to the data set to determine whether the query would require an unreasonable amount of time to complete, and notifying the user to re-formulate the query if it would require too much time. | 02-03-2011 |
20110040744 | SYSTEM, METHOD, AND APPARATUS FOR SCAN-SHARING FOR BUSINESS INTELLIGENCE QUERIES IN AN IN-MEMORY DATABASE - A computer-implemented method for scan sharing across multiple cores in a business intelligence (BI) query. The method includes receiving a plurality of BI queries, storing a block of data in a first cache, scanning the block of data in the first cache against a first batch of queries on a first processor core, and scanning the block of data against a second batch of queries on a second processor core. The first cache is associated with a first processor core. The block of data includes a subset of data stored in an in-memory database (IMDB). The first batch of queries includes two or more of the BI queries. The second batch of queries includes one or more of the BI queries that are not included in the first batch of queries. | 02-17-2011 |
20110055197 | SYSTEM AND METHOD FOR QUERY EXPRESSION OPTIMIZATION - A method provided for optimizing a query expression on a database engine of a database server. The query expression is sent to the database engine. The query expression contains a plurality of query language elements. The database engine initiates query processing of the query expression. An evaluation counter within the database engine increments an evaluation counter value corresponding to a query language element result. A flag is set within the database engine when the evaluation counter value reaches a threshold value. The database engine can then evaluate the efficiency of the query language elements in the query expression by comparing the evaluation counter value for each query language element against a set of optimization criteria. | 03-03-2011 |
20110055198 | SYSTEM AND METHOD FOR OPTIMIZING QUERIES - There is provided a computer-implemented method of optimizing a query. An exemplary method comprises receiving a first request from an optimizer that specifies a table, a first predicate and a first sample size, wherein the optimizer is optimizing a relational query language statement that specifies the table and the first predicate. The exemplary method also comprises generating a sample table, comprising a first subset of rows from the table, based on the request. The exemplary method also comprises selecting a second subset of rows from the sample table based on the predicate. The exemplary method additionally comprises sending a count of rows in the second subset to the optimizer. | 03-03-2011 |
20110072003 | METHOD AND APPARATUS FOR CREATING AND UTILIZING INFORMATION SIGNATURES - An approach is provided for efficiently searching information in an information space utilizing information signatures. A signature application receives queries over information sources. The signature application, for each of the queries, generates a polynomial by defining the each query against the information sources as input parameters in polynomial form. The signature application provides irreducible polynomials over a finite field of a degree of orthogonality by factoring polynomials generated from the queries. The signature application adjusts the degree of orthogonality of the irreducible polynomials to provide adjusted irreducible polynomials, each of which is a signature and corresponds to a signature fragment, such that the signature fragments have overlapping portions. The signature application causes at least in part storage of the signatures or the signature fragments in a signature domain over an information space. | 03-24-2011 |
20110078133 | Searching Multi-Dimensional Data - Techniques for searching multi-dimensional data are provided. The techniques include providing a parallelization framework for a search algorithm, wherein the search algorithm exposes one or more architecture-sensitive tunable optimization parameters, and using the one or more architecture-sensitive tunable optimization parameters to tune the search algorithm to search multi-dimensional data in any underlying architecture. | 03-31-2011 |
20110078134 | SYSTEM AND METHOD FOR AVIDING THREE-VALUED LOGIC IN PREDICATES ON DICTIONARY-ENCODED DATA - According to one embodiment of the present invention, a method for dictionary encoding data without using three-valued logic is provided. According to one embodiment of the invention, a method includes encoding data in a database table using a dictionary, wherein the data includes values representing NULLs. A query having a predicate is received and the predicate is evaluated on the encoded data, whereby the predicate is evaluated on both the encoded data and on the encoded NULLs. | 03-31-2011 |
20110093451 | Systems and methods for executing a database query to perform multi-level deployment - Systems and methods for generating an optimized deployment scheme include generating a request identifying a type of resource requested by hierarchically arranged organizational entities including a first organizational entity located at a first level and a second organizational entity at a second level, executing a database query to retrieve business data corresponding to the first and second organizational entities, determining, based on the business data, a first quantity and a second quantity, the first quantity identifying a quantity of the resource available for deployment to the first organizational entity, and the second quantity identifying a quantity of the resource available for deployment to the second organizational entity, modifying the first quantity based on the second quantity, and generating, by using a processor of the computer system, an optimized deployment scheme based on the first quantity, the modified first quantity, and the second quantity. | 04-21-2011 |
20110106788 | DOCUMENT STREAM OPERATING SYSTEM - A document stream operating system and method is disclosed in which: (1) documents are stored in one or more chronologically ordered streams; (2) the location and nature of file storage is transparent to the user; (3) information is organized as needed instead of at the time the document is created; (4) sophisticated logic is provided for summarizing a large group of related documents at the time a user wants a concise overview; and (5) archiving is automatic. The documents can include text, pictures, animations, software programs or any other type of data. | 05-05-2011 |
20110106789 | DATABASE SYSTEM AND METHOD OF OPTIMIZING CROSS DATABASE QUERY - A database system and a method of optimizing cross-database query. The database system includes a plurality of databases. At least two of the databases are stored with one or more data collections composed of tables with the same structure. A federated view of the data collection is created on each of the databases. A request routing layer for routing, in response to a query request crossing the data collections, the query request crossing the data collections to one of the at least two databases according to a predetermined routing rule, so as to query by using the federated view of the database. | 05-05-2011 |
20110113025 | Systems and Methods for Data Storage and Retrieval Using Algebraic Relations Composed from Query Language Statements - Systems and methods for storing and accessing data. A query language statement may reference a plurality of data sets and a plurality of algebraic relations between the data sets may be composed from the query language statement. The algebraic relations may be used to define new data sets and to optimize access to data sets. A store of algebraic relations may be accumulated over time. Alternative collections of algebraic relations may be generated and evaluated to determine an optimized collection of algebraic relations to use in calculating and providing a requested data set. The optimization may be performed using the algebraic relations rather than retrieving underlying data sets from storage. As a result, optimization may be performed at processor speeds to minimize the amount of time required for data to be retrieved from slower storage. | 05-12-2011 |
20110131197 | OPTIMIZING CACHING PERIOD OF LOCATION DATA FOR NETWORK BASED LOCATION SERVICES - A system and associated method for optimizing caching period of location data for network based location services. A location caching server receives a location request from a mobile device. The location caching server calculates, pursuant to a predefined calculation rule, a caching period of a location cache entry for the mobile device based on a precision level requested by the mobile device and a service precision level assigned for a type of location service for which the location request was made. The location caching server obtains real location data of the mobile device of the calculated caching period is expired. The location caching server subsequently adjusts the caching period based on a distance traveled by the mobile device pursuant to a predefined adjustment rule, and updates the location cache entry. | 06-02-2011 |
20110137888 | INTELLIGENT CACHING FOR REQUESTS WITH QUERY STRINGS - An intelligent caching system is described herein that intelligently consolidates the name-value pairs in content requests containing query strings so that only substantially non-redundant responses are cached, thereby saving cache proxy resources. The intelligent caching system determines which name-value pairs in the query string can affect the redundancy of the content response and which name-value pairs can be ignored. The intelligent caching system organically builds the list of relevant name-value pairs by relying on a custom response header or other indication from the content server. Thus, the intelligent caching system results in fewer requests to the content server as well as fewer objects in the cache. | 06-09-2011 |
20110137889 | System and Method for Prioritizing Data Storage and Distribution - Various systems and methods for prioritizing data storage and distribution by a data prioritizer device are provided. For example, the data prioritizer device may receive from a consumer a registration that includes one or more record identifiers, which identify one or more data records in which the consumer is interested. The data prioritizer device may receive from a producer a data record identified by a record identifier and store the data record when the record identifier is among the one or more record identifiers, thereby storing the data record when the consumer has indicated an interest in the data record. The data prioritizer device may queue the data record in a consumer queue allocated for the consumer and provide the data record to the consumer from the consumer queue. | 06-09-2011 |
20110153591 | METHOD AND SYSTEM FOR IMPROVING INFORMATION SYSTEM PERFORMANCE BASED ON USAGE PATTERNS - Usage patterns of structure model are utilized to determine a personalized structure model associated with a user. The personalized structure model is constructed such that retrieval of data associated with the personalized structure model is expected to improve performance of retrieving data from the data provider. The personalized structure model may be arranged based on an order of retrieval, based on groups of structure objects that may be retrieved together or the like. The personalized structure model may be a flat structure model to further improve performance of retrieving data from the data provider. | 06-23-2011 |
20110153592 | Dividing A Travel Query Into Sub-Queries - Techniques for dividing a travel query into sub-queries for execution by a travel planning system is described. The techniques can divide the travel query according to some optimization such as by taking query processing difficulty into consideration or loading on the travel planning system. | 06-23-2011 |
20110167055 | HARDWARE ACCELERATED RECONFIGURABLE PROCESSOR FOR ACCELERATING DATABASE OPERATIONS AND QUERIES - Embodiments of the present invention provide a hardware accelerator that assists a host database system in processing its queries. The hardware accelerator comprises special purpose processing elements that are capable of receiving database query/operation tasks in the form of machine code database instructions, execute them in hardware without software, and return the query/operation result back to the host system. For example, table and column descriptors are embedded in the machine code database instructions. For ease of installation, the hardware accelerators employ a standard interconnect, such as a PCle or HT interconnect. The processing elements implement a novel dataflow design and Inter Macro-Op Communication (IMC) data structures to execute the machine code database instructions. The hardware accelerator may also comprise a relatively large memory to enhance the hardware execution of the query/operation tasks requested. The hardware accelerator utilizes hardware-friendly memory addressing, which allows for arithmetic derivation of a physical address from a global database virtual address simply based on a row identifier. The hardware accelerator minimizes memory reads/writes by keeping most intermediate results flowing through IMCs in pipelined and parallel fashion. Furthermore, the hardware accelerator may employ task pipelining and pre-fetch pipelining to enhance its performance. | 07-07-2011 |
20110191322 | Stochastic optimization techniques of evolutionary computation search strategies for an information sharing system - An information sharing system to solve one or more information retrieval problems is concerned with the novel, hybrid use of the stochastic optimization techniques of evolutionary computation (EC) search strategies for computer information systems such as search engines, or service oriented architectures (SOAs). The information sharing system uses stochastic optimization agents for task distribution and communication when foraging a system of stored documents for information, assessing the computational effort required to retrieve information in the form of stored documents, sharing information among stochastic optimization agent processes and processors, and extracting knowledge from the information. The field of evolutionary computation encompasses stochastic optimization techniques, such as randomized search strategies, in the form of evolutionary strategies (ES), evolutionary programming (EP), genetic algorithms (GA), classifier systems, evolvable hardware (EHW), and genetic programming (GP). The information sharing system is an attempt to harness information processing models by adapting to information system fluctuations that occur within a computer, a local area network, and a wide area network that encompasses the whole Internet. | 08-04-2011 |
20110196856 | PROCESSING A DATA STREAM - Methods, database management systems (“DBMS”) and computer-readable media are provided for processing unbounded stream data using a traditional DBMS. Execution of a query that includes a data stream as a data source may be initiated. Tuples may be processed in accordance with the query as the tuples are received through the data stream until an indication is received that execution of the query should cease. | 08-11-2011 |
20110225143 | QUERY MODEL OVER INFORMATION AS A NETWORKED SERVICE - Data is published by publishers to an information service configured to receive data sets and allow consumers to consume the data sets via queries. Structural information of the data sets (e.g., column information) is presented to the publishers to select which information of the data sets can be a search parameter and which information can be returned in query results. Query interfaces are automatically created based on the selections by the publisher, and the back end databases are optimized for such query interfaces, e.g., creation of indexes based on the search parameters or query results selected by the publisher. A query aggregator can automatically combine a given query interface with other query interfaces to form more complicated (but still permitted) queries based on the intersection of permissions for the given query interface and the other query interfaces. | 09-15-2011 |
20110225144 | QUERY EVALUATION USING ANCESTOR INFORMATION - Provided are techniques for processing a query. A query is received, wherein the query is formed by one or more paths, and wherein each path includes one or more steps. A hierarchical document including one or more document nodes is received. While processing the query and traversing the hierarchical document, one or more extraction entries are constructed, wherein each extraction entry includes a step instance match candidate identifying a document node and a step instance ancestor path for the document node, and one or more tuples are constructed using the one or more extraction entries by associating the step instance match candidate from one of the one or more extraction entries with the step instance match candidate from at least one of the one or more other extraction entries. | 09-15-2011 |
20110246445 | METHODS AND SYSTEMS FOR QUERYING EVENT STREAMS USING MULTIPLE EVENT PROCESSORS - In one embodiment, a system for distributed event processing includes a first event processor and a second event processor. The first event processor receives event data associated with an event stream. The second event processor receives a query associated with the event stream. A request to the first event processor is generated by the second event processor based on the query for a first portion of event data associated with the event stream. The second event processor receives the first portion of event data from the first event processor. The second event processor then generates an event based on the first portion of event data. | 10-06-2011 |
20110246446 | OPTIMIZING, DISTRIBUTING, AND TRACKING ONLINE CONTENT - The subject matter described herein relates to systems and techniques for optimizing, distributing, and tracking the use of content online in, for example, Internet search engines and other Internet distribution networks. | 10-06-2011 |
20110264647 | QUERY PROCESSING FOR WEB SEARCH - A computer-implemented method for processing user entered query data to improve results of a search of pages using a database, when searching the internet, is disclosed. The method includes receiving the user entered query data and parsing each word of the query data and segmenting words using probability to determine a likelihood that the word is for a particular name. And, associating the particular names with a name tag to create one or more tagged name terms. Then, normalizing each of the tagged name terms and the normalizing including boosting information if found in the database and determining proximity between selected ones of the tagged name terms. The method then generates an optimized search query that incorporates normalized terms and operators. The optimized search query being applied to the internet to enable search results to be produced and displayed to the user in response to the entered query data. | 10-27-2011 |
20110295833 | Framework for Testing Query Transformation Rules - Described is a test framework for testing transformation rules of query optimizers. Rule patterns obtained as tree structures from a query optimizer are used to generate queries that are used to test the rule optimizer's transformation rules. The test framework tracks which rules are exercised for each query, and also determines the correctness of the transformation rule by comparing the results of the query processing with the rule and without the rule (by turning off the rule). The test framework creates a composite pattern corresponding to two or more rules, such as to test rules in a set (e.g., as pairs). Also described is the efficient execution of a test suite for correctness testing, in which queries of the test suite are selected based upon cost information. | 12-01-2011 |
20110295834 | METHOD FOR OPTIMIZING A SEARCH QUERY - A user is provided with an analytical function which indicates an individual contribution of each search term used in a complex search query by a graphical, typographical or numerical indicator. For this purpose there is started in the background for each search term a search query which consists of the complex search query without the respective search term. The hit count obtained in this way is subtracted from the total hit count of the search query with the respective search term. The difference is a numerical indicator for the individual contribution of the respective search term to the total hit count. Thus, the user quickly and conveniently obtains a reference point indicating which search terms are crucial to the search query. The user can thus selectively refine the search query by explicitly specifying less significant search terms or removing overly restrictive search terms. | 12-01-2011 |
20110295835 | Expanding Attribute Profiles - A method and system for expanding attribute profiles are presented in which primary attributes from one or more attribute profiles are used to derive secondary attributes which are added to the respective attribute profiles to generate expanded attribute profiles. The expanded attribute profiles are generated to increase the strength of association of a query attribute with one or more attribute profiles associated with query-attribute-positive individuals. | 12-01-2011 |
20110307470 | DISTRIBUTED DATABASE MANAGEMENT SYSTEM AND DISTRIBUTED DATABASE MANAGEMENT METHOD - Provided is a non-shared type database system capable of efficiently manipulating data in a distributed database. A distributed database management system has a query receiving unit (load balancer) that receives a query; and, plural storage processing units that manipulate data in the distributed database in a cooperative manner on the basis of the received query. Each of the storage processing units includes: a storage device that stores one of partial databases constituting the distributed database; and, a data manipulation unit that manipulates data in the partial databases stored in the storage device on the basis of the received query. | 12-15-2011 |
20110313998 | INFORMATION REPOSITORY SEARCH SYSTEM - A system for receiving a plurality of search criteria from a plurality of users is disclosed. The plurality of search criteria is for application to a common information repository. The plurality of search criteria includes a first search criterion that is received from at least two of the plurality of users. The system further associates the plurality of search criteria with source information. The source information includes a plurality of sources via which the plurality of search criteria are received and communicated. Further, the system maintains a count of instances of the first search criterion received from the at least two of the plurality of users for each of the plurality of sources including the first source. | 12-22-2011 |
20110320431 | STRONG TYPING FOR QUERYING INFORMATION GRAPHS - Described herein is using type information with a graph of nodes and predicates, in which the type information may be used to determine validity of (type check) a query to be executed against the graph. In one aspect, each node has a type, and each predicate indicates a valid relationship between two types of nodes. A type checking mechanism uses the type information to determine whether a query is valid, which may be the entire query prior to query processing/compilation time, or as the query is being composed by a user. One or more valid predicates for a given node may be discovered based upon the node type, such as discovered to assist the user during query composition. Also described is using the type information to optimize the query. | 12-29-2011 |
20110320432 | Managing Parameters in Filter Expressions - A mechanism is provided for generating a filter expression using tree parameters receives an expression wherein operators of the expression bind multiple data items to a single parameter to form a received expression, generates a default prompt control using received metadata and the received expression and prompts for an input selection using the default prompt control. Responsive to receiving selected values in response to the default prompt control to form received values the computer-implemented process generates a native database query using the received expression with the single parameter and the received values, wherein the single parameter is a tree parameter. | 12-29-2011 |
20120066204 | PROVIDING LIGHTWEIGHT MULTIDIMENSIONAL ONLINE DATA STORAGE FOR WEB SERVICE USAGE REPORTING - Distributed and local processes analyze usage data and transform it into objects including timestamps and dimensions. Objects include a position vector to represent dimension analysis and additional attributes associated with measurements of different types. The objects are stored in a multidimensional database indexed on the vector and timestamp attributes. | 03-15-2012 |
20120066205 | Query Compilation Optimization System and Method - A system and method of compiling a query involving clumping contiguous constraints of a query into one or more subqueries based on partition organization parameters and evaluating each subquery against a partition of a graph having data records for the corresponding partition organization parameter value. In one example, clumping of contiguous query constraints based on an RDF data component, such as a subject, may be used to evaluating subqueries of a query against one or more partitions of a graph having RDF data records with that subject. | 03-15-2012 |
20120066206 | Distributed Query Compilation and Evaluation System and Method - A system and method for distributed query compilation and evaluation involving a first table having a first number of partitions and a second table having a second number of partitions. A query operation, such as a join, is performed for each combination of partitions from the first and second tables. The result of each query operation on each combination of partitions is organized into a third number of partitions. A number of tables equal to the third number are generated with each table including one of the partition results from each of the query operation combinations. | 03-15-2012 |
20120072411 | DATA REPRESENTATION FOR PUSH-BASED QUERIES - A query over one or more push-based data sources is transformed into a data representation of the query. The data representation can subsequently be analyzed, optimized, and remoted, among other things. For example, the data representation can be utilized to generate code for an out-of-process execution engine. Additionally, the data representation can be employed with respect to conversions to and from various types and representations of data. | 03-22-2012 |
20120078878 | OPTIMIZED LAZY QUERY OPERATORS - Query operators such as those that perform grouping functionality can be implemented to execute lazily rather than eagerly. For instance, one or more groups can be created and/or populated lazily with one or more elements from a source sequence in response to a request for a group or element of a group. Furthermore, lazy execution can be optimized as a function of context surrounding a query, among other things. | 03-29-2012 |
20120089593 | QUERY OPTIMIZATION BASED ON REPORTING SPECIFICATIONS - Various embodiments of systems and methods for query optimization based on reporting specifications are described herein. A plurality of data provider objects are categorized into one or more used data provider objects that are used in a report at a first instance and one or more unused data provider objects that are not used in the report at the first instance. The plurality of data provider objects is part of a query. A modified query is then created by excluding the unused data provider objects. Data of the used data provider objects is retrieved and stored in a local data source using the modified query. The unused data provider objects are displayed such that they are differentiated from the used data provider objects and can be selected for use in the report at the second instance. | 04-12-2012 |
20120095986 | RUNTIME OPTIMIZATION OF SPATIOTEMPORAL EVENTS PROCESSING BACKGROUND - A method of optimizing runtime spatiotemporal events processing is provided. The method includes the following stages: defining a plurality of spatial contexts or spatiotemporal contexts; specifying a plurality of spatial patterns or spatiotemporal patterns being relationships between events complying with specified policies within the defined spatial contexts and spatiotemporal contexts respectively; identifying events of specified properties out of a stream of incoming events, based on the defined spatial contexts or the defined spatiotemporal contexts; detecting event patterns of specified properties out of the stream of incoming events by grouping the incoming events and applying a pattern matching process based on the specified spatial patterns or spatiotemporal patterns; adaptively generating a spatial evaluation plan that defines an order of processing such that event processing is optimized, based on off-line and runtime data; and processing the incoming events based on the order defined in the spatial evaluation plan. | 04-19-2012 |
20120095987 | SYSTEMS AND METHODS FOR QUERY OPTIMIZATION - In accordance with certain embodiments, a query from a client may be received at a server, and a default query range may be applied to the query. The query may be executed in a first execution using an index comprising a category of information stored in the database and subject to the default query range. If the number of query results from the first execution is outside a predetermined range, then the query range may be adjusted to obtain a number of query results closer to or within the predetermined range. Additionally, the query may be executed in a second execution using the index comprising the category of information stored in the database and subject to the adjusted query range. Thereafter, the query results obtained from the second execution of the query may be sent to the client. | 04-19-2012 |
20120102022 | Accessing Relational Databases As Resource Description Framework Databases - This invention is a system and method for integrating relational databases into a semantic web framework utilizing a simple mapping process and the SQL query optimizer present in the SQL database engine. | 04-26-2012 |
20120109934 | DATABASE CALCULATION ENGINE - 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. | 05-03-2012 |
20120109935 | OBJECT MODEL TO KEY-VALUE DATA MODEL MAPPING - Access to data is facilitated by mapping between an object model and a key-value data model that supports a notion of worlds. The object model can be expressed in a programming language that supports language-integrated queries. One or more query operators comprising a language-integrated query can be specified and executed with respect to a key-value world. | 05-03-2012 |
20120109936 | COST-EFFECTIVE DATA LAYOUT OPTIMIZATION OVER HETEROGENEOUS STORAGE CLASSES - A data layout recommendation system for heterogeneous storages is disclosed. The system has an SSD-aware Time-based query optimizer from the database optimizer. The query optimizer can detect the interaction between the query plans and underlying data layout and dynamically update the cheapest query plan and response time of a query based on the changing data layout. The system also includes a module utilizing the query estimates from the backend to find a cost-effective data layout as well as the capacity and SLAs constrains are guaranteed. | 05-03-2012 |
20120117054 | Query Analysis in a Database - A method of analyzing an expression to infer output data properties, comprises storing, in a storage device, a root node “e” in R, in which “e” is an expression and R is a root node of an abstract syntax tree (AST) of the expression “e”, storing a number of child nodes of R into C | 05-10-2012 |
20120130982 | OPTIMIZING DATABASE QUERY - Embodiments of the present invention relate to a method, computer program product and system for optimizing database transactions configured for receiving a query. The query specifies a set of predicates supplied to the query and a minimal number of predicates to be satisfied for the query to be true. An operation using the query is performed on a repository that is stored in a computer readable storage medium. A set of results satisfying the minimal number of predicated is rendered. | 05-24-2012 |
20120158695 | More efficient search algorithm (MESA) using: integrated system optimizer - 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. | 06-21-2012 |
20120166417 | ASYNCHRONOUS TRANSFER OF STATE INFORMATION BETWEEN CONTINUOUS QUERY PLANS - 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. | 06-28-2012 |
20120166418 | METHODS AND SYSTEMS FOR OPTIMIZING DATA ACCESSES - 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. | 06-28-2012 |
20120173512 | System, Method and Article of Manufacture for Advanced Information Gathering for Targeted Activities - 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. | 07-05-2012 |
20120185460 | SYSTEMS AND METHODS OF BLOCK COMPUTATION - Systems and methods of block computation are disclosed. An example of a method includes buffering a plurality of tuples in a build phase. The method also includes, after buffering a last of the plurality of tuples, applying a computation to all of the buffered tuples in a compute phase. The method also includes returning results of the computation one tuple at a time to a query processing pipeline in a stream-out phase. | 07-19-2012 |
20120197865 | INCREMENTAL QUERY EVALUATION - 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. | 08-02-2012 |
20120197866 | OPTIMIZING PROCESSING OF GROUP-BY QUERIES FEATURING MAXIMUM OR MINIMUM EQUALITY CONDITIONS IN A PARELLEL PROCESSING SYSTEM - 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. | 08-02-2012 |
20120197867 | Query-Based Generation of Data Records - 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. | 08-02-2012 |
20120203761 | PATTERN MATCHING ACCELERATOR - 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. | 08-09-2012 |
20120221549 | Database Calculation Engine - 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. | 08-30-2012 |
20120239641 | MEMORY QUOTA - 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. | 09-20-2012 |
20120271814 | OPTIMIZATION OF QUERIES ON A REPOSITORY BASED ON CONSTRAINTS ON HOW THE DATA IS STORED IN THE REPOSITORY - Constraints that restrict how corresponding identifiable groups of files are stored in a database, are enforced on corresponding file data. In response to a query on any data from an identifiable group of files, the effect of the constraint on how the corresponding data is stored is determined. The original query is rewritten, based on the effect of the constraint, so that the rewritten query is directed to a particular subset of the data stored in the database. Consequently, the search space is restricted to an identifiable subset of the database and execution of the rewritten query is more efficient than execution of the original query. | 10-25-2012 |
20120278305 | DYNAMIC MERGING OF EXECUTABLE STRUCTURES IN A DATABASE SYSTEM - Embodiments of the present invention relate to dynamically merging executable structures in a database system. In one embodiment, there is provided a method of dynamically merging executable structures in a database system that includes, in response to a query to the database system, extracting a stem and a branch of a query statement. The query statement includes query conditions, and the branch includes at least a subset of the query conditions. An executable structure of the stem is obtained from a cache of the database system, and an executable structure of the branch is generated. The executable structure of the stem and the executable structure of the branch are merged into a runtime executable structure. | 11-01-2012 |
20120296889 | NET CHANGE NOTIFICATION BASED CACHED VIEWS WITH LINKED ATTRIBUTES - Local data caching for views with linked attributes are optimized based on net change notifications. Data requests may be made periodically to a server, each request with a specific set of constraints on timestamps of entity types involved in a view and each ordered by a primary item's identifier (ID). Applying the results of these requests to a client-side cache of the view results enables the client-side cache to stay “relatively fresh” with respect to the server's data. The server may handle view data requests where all conditions on related tables' columns are applied with an “and” operation, and the specific set of conditions on the timestamps of the related items are applied to get the net changes with minimum redundancy. The server may also handle stateless view data requests limited by the number of results, and a “sort by ID” may be applied to ensure consistent results over time. | 11-22-2012 |
20120310916 | Query Execution Systems and Methods - 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. | 12-06-2012 |
20120317092 | APPARATUS AND METHOD FOR CALCULATING THE SELECTIVITY OF A RANGE QUERY FOR MULTIDIMENSIONAL DATA - An apparatus and method for calculating the selectivity of a range query for multidimensional data using a multidimensional histogram are provided. A data space may be partitioned into one or more sub-spaces based on a sum of skew values of the one or more sub-spaces, a space-partitioning tree may be generated for the data space, and a multidimensional histogram may be generated for the data space based on the space-partitioning tree. A range query for multidimensional data may be processed based on the multidimensional histogram. | 12-13-2012 |
20120323884 | TRANSPARENT ANALYTICAL QUERY ACCELERATOR - A method and apparatus for transparent analytical query acceleration identifies within a database management system (DBMS) if a query is an analytical type. The query is processed with an analytical query processor if the query is the analytical type. In addition, the query is processed within the DBMS if the query is not the analytical type. | 12-20-2012 |
20130006959 | Method for providing a searchable, comprehensive database of proposed rides - A method is disclosed that matches travelers for ride sharing according to personal preferences, such as smoking, music, allergies, drive sharing, expense sharing, number of riders, and gender, as well as basic trip details. In preferred embodiments the method is accessed via a website, and trips can be over any distance and/or by any land, air, or water vehicle. Embodiments require traveler verification by a payment and/or other means, and/or require travelers to supply identifying information. Matches can take into account ratings of travelers by other travelers. Confirmations, reminders, and ride sharing advice can be sent to riders before scheduled rides, and information about a shared ride can be sent to a non-rider. Fees can be charged, and credited if no match is accepted. Communications can be secure and requesting and/or accepting matches can be logged. Origin and/or destination radii can be automatically enlarged to provide more matches. | 01-03-2013 |
20130006960 | Optimizing Database Queries - Some embodiments of the inventive subject matter include a method for transforming queries in a database management system. The can include detecting a first query, wherein the first query produces a first result upon evaluation by the database management system. The method can also include determining that the first query includes at least one operator, wherein the operator is selected from a union operator, an intersect operator, and an except operator, and wherein the operator has a first branch and second branch. The method can also include determining that the first branch of the operator accesses a first table, and wherein the second branch of the union operator also accesses the first table, and transforming the first query into a second query, wherein the second query does not include the operator, and wherein the second query produces the first result upon evaluation by the database management system. | 01-03-2013 |
20130031083 | Determining keyword for a form page - 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. | 01-31-2013 |
20130054566 | ACCELERATION OF RANKING ALGORITHMS USING A GRAPHICS PROCESSING UNIT - Methods, computer systems, and computer-readable media for accelerating a learning-to-rank algorithm using a central processing unit (CPU) and a graphics processing unit (GPU) are provided. The GPU processes document pairs created by the CPU in parallel to generate a lambda-gradient value and a weight for each document. The CPU builds a regression tree for the documents. The GPU is utilized to accelerate this process by constructing histograms of feature values, wherein the address of bins collecting the same feature value are shifted during the construction of the histogram. The output of the regression tree is a score for each document which is used to rank or order the document on a search engine results page. | 02-28-2013 |
20130080416 | SYSTEM AND METHOD OF INSURANCE DATABASE OPTIMIZATION USING SOCIAL NETWORKING - 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. | 03-28-2013 |
20130086037 | ENCAPSULATED, MODEL-CENTRIC AGGREGATION OF DATA FROM DIFFERENTIATED DATA SOURCES - 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. | 04-04-2013 |
20130091119 | Method and Server for Handling Database Queries - A method and a server ( | 04-11-2013 |
20130097149 | ENCAPSULATION OF MULTIPLICITY AND SPARSITY IN MULTIDIMENSIONAL QUERY EXECUTION SYSTEMS - 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. | 04-18-2013 |
20130110818 | PROFILE DRIVEN EXTRACTION | 05-02-2013 |
20130138626 | Table Parameterized Functions in Database - Systems, methods and computer program product embodiments for providing table parameterized function (TPF) functionality in a database are disclosed herein. An embodiment includes defining a TPF in a database, wherein the definition of the TPF defines one or more parameters of the TPF, at least one of the parameters being a table parameter. A query is received that operates to call the TPF, wherein the query defines one or more input parameters, the input parameters comprising at least one table input parameter to be used as input for calling the TPF. The query is processed to produce a result, and the result of the query is returned. | 05-30-2013 |
20130144865 | MANAGING ELECTRONIC PROCUREMENT TRANSACTIONS USING AN OPTIMIZED SEARCH TOOL - Various embodiments of systems and methods for retrieving open purchase orders using an optimized search tool are described herein. The method involves rendering a set of search parameters on a graphical UI of a computer. In an aspect, the method further includes receiving data relating to at least a first search parameter of the set of search parameters. Further, the method includes determining that data relating to at least a second search parameter of the set of search parameters is unavailable and determining the data relating to the at least second search parameter based on extrapolating the data relating to the at least first search parameter. In an aspect, the method involves performing a search based on the data relating to the at least first search parameter and the at least second search parameter. Based on the performed search, one or more open purchase orders are retrieved for further processing. | 06-06-2013 |
20130159278 | TECHNIQUES FOR EFFICIENTLY SUPPORTING XQUERY UPDATE FACILITY IN SQL/XML - 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. | 06-20-2013 |
20130159279 | Method For Monitoring And Controlling The Processing Of Database Searches - Systems, methods, and apparatus for preventing misuse of searches of a database system are provided. This prevention of misuse of database searches can enable reliable operation of the database system, as an improper query using a regular expression will not shut down or severely affect an application process that provides access to the database system. A thread of the application process determines whether an input character characters string matches the regular expression. To prevent misuse, a computational effort of the search is tracked, and compared to a threshold value. When the threshold is exceeded, an operation of the thread is exited or stopped. | 06-20-2013 |
20130166531 | DATA BROWSER FOR GROUP-BY DATA ACCESS - 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. | 06-27-2013 |
20130166532 | STRING SEARCHES IN A COMPUTER DATABASE - A query optimizer improves string searches in a computer database that sequentially search for a string in a database record. The query optimizer optimizes the query to search records of a database from a specified start position other than the beginning of the record. The specified start position of the search may be determined by from historical information stored from previous searches. Alternatively, the query optimizer determines the specified start position of the search based on an overriding starting position provided by a system administrator. The query optimizer may also direct that the database record be reorganized to more efficiently search for strings in the record. | 06-27-2013 |
20130166533 | STRING SEARCHES IN A COMPUTER DATABASE - A query optimizer improves string searches in a computer database that sequentially search for a string in a database record. The query optimizer optimizes the query to search records of a database from a specified start position other than the beginning of the record. The specified start position of the search may be determined by from historical information stored from previous searches. Alternatively, the query optimizer determines the specified start position of the search based on an overriding starting position provided by a system administrator. The query optimizer may also direct that the database record be reorganized to more efficiently search for strings in the record. | 06-27-2013 |
20130173584 | DELTA MEASURES - A system may include reception of a selection of a set of one or more elements of a data visualization, the set associated with a measure and each of the one or more elements associated with a value of the measure for a respective combination of one or more dimension members, reception of an instruction to create a second set of one or more elements associated with a calculated measure, where a value of the calculated measure for a respective combination is based on two values of the measure for the respective combination, and where a first value of the two values of the measure is associated with a first time and a second value of the two values of the measure is associated with a second time, and automatic generation of a query to produce the value of the calculated measure for each of the combinations | 07-04-2013 |
20130173585 | OPTIMIZING MAP/REDUCE SEARCHES BY USING SYNTHETIC EVENTS - A processor-implemented method, system, and/or computer program product optimizes a search for data from documents. A processor receives an instruction to perform an initial map/reduce search for a specific set of data in documents from a first database. A synthetic event, which is a non-executable descriptor of the specific set of data in documents from the first database, is generated, and a revised map/reduce search for the synthetic event in a second database is conducted. The processor then returns a solution for the revised map/reduce search. | 07-04-2013 |
20130173586 | SYSTEM, METHOD, AND COMPUTER-READABLE MEDIUM FOR REDUCING RESPONSE TIME VARIATION IN A WORKLOAD MANAGEMENT SYSTEM - A system, method, and computer readable medium are provided for reducing response time variation in a workload management system for a database system. When a query response is generated in response to a database query from a client, a determination may be made as to whether response time of the query response is less than a predetermined amount of time. Delivery of the query response to the client is delayed when an amount of time associated with the query response is less than the predetermined amount of time. | 07-04-2013 |
20130173587 | METHOD FOR PROCESSING STREAM DATA AND SYSTEM THEREOF - A network interface receives stream data and a processor processes the stream data. The processor: constructs an operator graph comprising information regarding a plurality of operators for processing the stream data based on a query; assigns an operator execution order to the plurality of operators based on an inter-operator input and output relation, with respect to all of the operators on the operator graph; extracts a set of the operators that maintains the stream data assigned with a time stamp, a time of which is earlier than or equal to a reference time, in an input queue; and executes processing of the stream data assigned with the time stamp, having the earliest time, in the operator assigned a minimum operator graph execution order among the operators and maintaining the stream data assigned with the time stamp having the earliest time, among the extracted set of the operators. | 07-04-2013 |
20130179432 | QUERY EXECUTION AND OPTIMIZATION WITH AUTONOMIC ERROR RECOVERY FROM NETWORK FAILURES IN A PARALLEL COMPUTER SYSTEM WITH MULTIPLE NETWORKS - A database query execution monitor determines if an network error or low performance condition exists and then where possible modifies the query. The query execution monitor then determines an alternate query execution plan to continue execution of the query. The query optimizer can re-optimize the query to use a different network or node. Thus, the query execution monitor allows autonomic error recovery for network failures using an alternate query execution. The alternate query execution could also be determined at the initial optimization time and then this alternate plan used to execute a query in the case of a particular network failure. | 07-11-2013 |
20130185278 | QUERY OPTIMIZATION IN A PARALLEL COMPUTER SYSTEM TO REDUCE NETWORK TRAFFIC - A database query optimizer optimizes a query that uses multiple networks. The query optimizer optimizes a query to reduce network traffic on a network or node that is overloaded or above an established parameter in a node/network attribute table. The query optimization to reduce network traffic may result in a sub-optimal query in other respects such as execution time. The result is a query optimizer that rewrites or optimizes a query to execute on multiple nodes or networks to reduce traffic on a network or node according to the loading characteristics and assigned attributes of a node or network. | 07-18-2013 |
20130185279 | QUERY OPTIMIZATION IN A PARALLEL COMPUTER SYSTEM WITH MULTIPLE NETWORKS - A database query optimizer optimizes a query that uses multiple networks. The database query optimizer optimizes a query that uses multiple networks to satisfy the query by splitting the query execution to use multiple networks. Thus, the query optimizer rewrites or optimizes a query to execute on multiple nodes or networks to more efficiently execute the query and reduce network traffic on a network. The query optimizer uses plan cache statistics to determine whether to use multiple networks to optimize the query. | 07-18-2013 |
20130191368 | SYSTEM AND METHOD FOR USING MULTIMEDIA CONTENT AS SEARCH QUERIES - A method and system for searching a plurality of information sources using a multimedia element. The method comprises receiving at least one multimedia element; generating at least one signature for the at least one multimedia element; generating a textual search query using at least the one generated signature; searching the plurality of information sources using the generated textual search query; and causing the display of search results retrieved from the plurality of information sources on a user device. | 07-25-2013 |
20130198163 | SYSTEM AND METHOD FOR STORING DATA IN A RELATIONAL DATABASE - In a method for storing data in a relational database system using a processor, a collection of values is assigned to a structure dictionary, each of the values represents the value of a row for an attribute and has a unique ordinal number within the collection. and the structure dictionary contains structures defined based on at least one of interaction with a user of the system via an interface, automatic detection of structures occurring in data, automatic detection of frequencies of values occurring in data, analysis of a history of queries, and predetermined information about structures relevant to data content that is stored in the system. For each structure, forming a structure match list from ordinal numbers of values matching the structure, and a structure sub-collection from values matching the structure, using the processor. An outlier match list is formed from ordinal numbers of values that are not null and do not match any structure in the structure dictionary, and an outlier sub-collection is formed from values that are not null and do not match any structure in the structure dictionary. The collection of values is stored in the relational database in a form of structure match lists, structure sub-collections, outlier match list and outlier sub-collection. | 08-01-2013 |
20130238595 | METHODS AND SYSTEMS FOR OPTIMIZING QUERIES IN A MULTI-TENANT STORE - Methods and systems for optimizing queries in a multi-tenant store are described. In one embodiment, such a method includes retrieving data from a multi-tenant database system having a relational data store and a non-relational data store, receiving a request specifying data to be retrieved, retrieving one or more locations of the data to be retrieved, generating a database query based on the request, in which the database query specifies a plurality of data elements to be retrieved, the plurality of data elements including one or more data elements residing within the non-relational data store and one or more other data elements residing within the relational data store, generating an optimized database query having an optimized query syntax that is distinct from a query syntax of the database query, and executing the optimized database query against the multi-tenant database system to retrieve the data. | 09-12-2013 |
20130246391 | CONFIGURATION INFORMATION MANAGEMENT APPARATUS AND RETRIEVAL METHOD - A configuration information management apparatus includes a control unit which, generates a retrieval formula pattern representing a pattern of a first relationship retrieval formula which has been input, executes retrieval processing on the retrieval formula pattern, measures a state required for the retrieval processing which has been executed, determines whether or not the state satisfies a first condition, and when the first condition is satisfied, stores a retrieval condition relating to a retrieval subject configuration item in the retrieval formula pattern satisfying the first condition in a database as a short retrieval key, and retrieves, when a second relationship retrieval formula is input and a retrieval formula pattern of the second relationship retrieval formula satisfies a second condition, the retrieval subject configuration item in the second relationship retrieval formula, on the basis of the short retrieval key. | 09-19-2013 |
20130246392 | Conversational System and Method of Searching for Information - A system and method for performing an operation based on a contextual command, which operation further comprises interactively searching for information, comprising: receiving an input in a context, returning a result in respect of the received context by at least one of reducing, relaxing, and location handling in respect of the input value, and performing an operation based upon the context of the input criteria. Reducing comprises narrowing the total number of results by their contextual relevance, wherein the narrowing is comprised in dynamically generated real-time interactions. Relaxing further comprises, when an exact result is not found, broadening the input search criteria automatically, and where appropriate, obtaining a result. The location handling further comprises disambiguating addresses and locations where there are conflicts based on an input history, and establishing relationships within addresses based upon the input history. | 09-19-2013 |
20130254182 | KNOWLEDGE REPOSITORY - A knowledge storage system is described. A specific embodiment is a computer system comprising a knowledge base of general knowledge in structured form which can be added to and queried by untrained users. Various embodiments include the facility for remote computers to access the knowledge stored in the system, natural language questions to be answered, profile screens giving general knowledge about an object in the system, and methods for distinguishing between reliable and unreliable facts. | 09-26-2013 |
20130262431 | Method and Apparatus for Identifying and Recommending Content - A method for matching a search request from a client device includes detecting the search request from the client device, storing content listings within a content database where each of the content listings represents content, and searching for a match result between the search request and the content listings. A subscription to a subscribed content provider is detected and associated with the client device. The match result is displayed to indicate the content listings associated with the subscribed content provider. | 10-03-2013 |
20130262432 | SYSTEM AND METHOD FOR IMPROVED PROCESSING OF AN SQL QUERY MADE AGAINST A RELATIONAL DATABASE - A system and method for improved processing of an SQL query made against a relational database is disclosed. In one example embodiment, the method includes parsing the SQL query, received against the relational database, to obtain each operator and associated one or more operands and sequence of execution of the operators. Further, it is determined whether all needed closure-friendly operators exist. Furthermore, any available closure-friendly operators are obtained from a pattern repository if all needed closure-friendly operators do not exist. In addition, remaining or all non-available closure-friendly operators are dynamically generated. Moreover, the available closure-friendly operators and the dynamically generated closure-friendly operators are grouped into one or more patterns and impact of each pattern on a queried relational database and a database schema is classified. Also, the SQL query is executed using the one or more patterns based on sequence of the execution of the operators. | 10-03-2013 |
20130268509 | SYSTEM AND METHOD FOR STORING AND RETRIEVING DATA - Systems and methods for storing and retrieving data are disclosed where creation of new partitions in a database is driven by write requests. The requests can arrive at pseudo random moments of time. Each partition in the database is associated with a time interval. Different time intervals do not need to be consecutive. Whenever a write request is obtained, the system determines whether the write request is received within a latest partition time interval defined by start and end times. If yes, the data is written into a database partition corresponding to that interval. If not, a new partition is created having associated time interval with its own start and end times defining a new partition time interval. The process is repeated as new data is streaming in. | 10-10-2013 |
20130290292 | Augmented Query Optimization by Data Flow Graph Model Optimizer - A query is received, and in response, an initial data flow graph is generated that includes a plurality of nodes for executing the query with at least one of the nodes having at least one associated hint. The initial data flow graph is subsequently optimized using a model optimizer having a rules engine using a plurality rules to optimize the initial data flow graph. The at least one associated hint is used by the model optimizer to change how at least one of the plurality of rules is applied. Thereafter, execution of the query is initiated using the optimized data flow graph. Related apparatus, systems, techniques and articles are also described. | 10-31-2013 |
20130311441 | Distributed Database with Modular Blocks and Associated Log Files - A system includes a master node and worker nodes controlled by the master node. Each worker node stores 25 or more modular blocks of a distributed database, where each modular block has a size of 5 G bytes or less and has an associated log file. | 11-21-2013 |
20130325841 | SQL TRANSFORMATION-BASED OPTIMIZATION TECHNIQUES FOR ENFORCEMENT OF DATA ACCESS CONTROL - Techniques are provided for a database server to identify a query that comprises an access check operator specifying a data access control policy, and if so, to re-write the query to produce an optimized query execution plan. A first technique rewrites a query comprising an access check operator based on the privileges associated with the database principal requesting the query. The rewritten query exposes the access predicates relevant to the requesting principal to subsequent database optimization processes. A second technique rewrites a query comprising an access check operator that specifies a data security policy that does not include a denied privilege. A third technique rewrites a query that comprises an access check operator specifying one or more database table columns that store row-specific access control lists. The rewritten queries are used to generate a query execution plan that provides for several query execution optimizations. | 12-05-2013 |
20130332446 | EFFICIENT PARTITIONING TECHNIQUES FOR MASSIVELY DISTRIBUTED COMPUTATION - A repartitioning optimizer identifies alternative repartitioning strategies and selects optimal ones, accounting for network transfer utilization and partition sizes in addition to traditional metrics. If prior partitioning was hash-based, the repartitioning optimizer can determine whether a hash-based repartitioning can result in not every computing device providing data to every other computing device. If prior partitioning was range-based, the repartitioning optimizer can determine whether a range-based repartitioning can generate similarly sized output partitions while aligning input and output partition boundaries, increasing the number of computing devices that do not provide data to every other computing device. Individual computing devices, as they are performing a repartitioning, assign a repartitioning index to each individual data element, which represents the computing device to which such a data element is destined. The indexed data is sorted by such repartitioning indices, thereby grouping together all like data, and then stored in a sequential manner. | 12-12-2013 |
20130332447 | Systems and Methods for Matching Records Using Geographic Proximity - Contact objects in one or more databases can be matched using various systems and methods to determine geographical proximity between the objects. Location attributes associated with first and second objects can be compared to determine a distance between the locations associated with the objects. The objects can then be grouped if the distance is less than a threshold distance. | 12-12-2013 |
20130332448 | Apparatus and Method of Semantic Service Correlation System - A correlation-based service mediator consists of Semantic Query Generator, Service Query Manager, Service Invocation Flow Generator, Service Invocation Manager, Expression Interpreter and Service Invocation Result Cache. The Semantic Query Generator converts service request to Semantic Query based on input/output parameters in the service request. The Service Query Manager interfaces with an Ontology Engine, passing query results to Service Invocation Flow Generator, which creates service invocation flow definition based on passed query results. The Service Invocation Manager executes flow definitions. It also manages a service invocation result cache, so that invocation results can be saved and reused for later service request. When the execution results are not available in cache, the Service Invocation Manager invokes service according to flow definition. When attribute dependent functions are invoked Expression Interpreter compute the execution results. The service mediator possesses two major functionalities: service matching and service invocation. | 12-12-2013 |
20130339339 | ACCELERATED SEARCHING OF SUBSTRINGS - Accelerated sub-string searches on large data sets can be performed using filtering processes that can improve or optimize run time performance. A first filtering process can include partitioning a binary tree into sections to enable an exact search to replace a substring search for part of the binary tree and for part of the binary tree to be potentially excluded from substring searching. A second filtering process can include comparing count representations of entries in the binary tree and of a received input string to potentially further exclude entries from substring searching. | 12-19-2013 |
20130339340 | SEMANTIC SEARCH FOR BUSINESS ENTITIES - Systems and methods for using a semantic search to address business entities that fulfill certain criteria are provided. A free search term may be determined by a user for the semantic search. The free search term may include any object type, element or parameter the user would like to search for. An ontology which relates to a specific business or industry may be used for the semantic search. The ontology may include various business classes, roles, and individuals. In some implementations, the ontology may be generated from metadata of business objects. The semantic search may be conducted across the entire ontology to obtain search results that match the free search term. As a result, business entities that fulfill the free search term may be retrieved and provided to the user. | 12-19-2013 |
20140006378 | SYSTEMS AND METHODS FOR AUDIT PROJECT AUTOMATION | 01-02-2014 |
20140019436 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING SYSTEM, INFORMATION PROCESSING METHOD AND INFORMATION PROCESSING PROGRAM - An information processing apparatus receives a query specifying a value range; generates keys indicating values in the query; generates a key range (KR) group containing at least one KR which is a set of prescribed keys; stores a key indicating bounds of keys managed by each apparatus; receives the KR group; specifies, with respect to each KR in the received KR group, one key as an address key based on the relation between the value indicated by a prescribed key contained in the KR and the values indicated by each stored key respectively; appends the keys contained in the KR to a group of KR which is a set of keys associated with a node identifier of an apparatus identified based on the value of the specified address key; and forwards each group of KR to the apparatus identified by the node identifier associated with each group of KR respectively. | 01-16-2014 |
20140025658 | VALIDATING DATABASE TABLE PARTITIONING SCHEMES USING STRATIFIED RANDOM SAMPLING - A method, system, and computer program product for validating database table partitioning from partition advisors. The method commences by receiving a workload comprising a plurality of queries, then analyzes the queries to determine stratification buckets based on the usage of tables in the queries. Further analysis of the queries results in assigning the queries into one or more of the stratification buckets from which buckets a number n of queries (n being smaller than the total number of queries in the received workload) are drawn from the stratification buckets to form a representative workload having a confidence interval C and a margin of error M. Now, having a representative workload that is smaller, yet statistically representative of the received workload, a computer evaluates each of a plurality of partition schemes using the representative workload to determine an optimal partitioning scheme. The confidence interval C can be increased or decreased. | 01-23-2014 |
20140032525 | AGGREGATION FRAMEWORK SYSTEM ARCHITECTURE AND METHOD - Database systems and methods that implement a data aggregation framework are provided. The framework can be configured to optimize aggregate operations over non-relational distributed databases, including, for example, data access, data retrieval, data writes, indexing, etc. Various embodiments are configured to aggregate multiple operations and/or commands, where the results (e.g., database documents and computations) captured from the distributed database are transformed as they pass through an aggregation operation. The aggregation operation can be defined as a pipeline which enables the results from a first operation to be redirected into the input of a subsequent operation, which output can be redirected into further subsequent operations. Computations may also be executed at each stage of the pipeline, where each result at each stage can be evaluated by the computation to return a result. Execution of the pipeline can be optimized based on data dependencies and re-ordering of the pipeline operations. | 01-30-2014 |
20140046927 | DETECTING MULTI-COLUMN COMPOSITE KEY COLUMN SETS - An aspect includes a computer-implemented method for detecting one or more multi-column composite key column sets. The method includes accessing a plurality of first columns, each first column representing a parameter, each first column including a set of distinct parameter values of its respective parameter, each distinct parameter value being stored in association with one or more object identifiers. Two or more of the first columns are selected for use as a current candidate column set, the current candidate column set including at least a first and a second candidate column, the current candidate column set being of a current cardinality. The method also includes determining, by comparing object-identifiers, whether for the current candidate column set at least one tuple of parameter values exists with parameter values respectively stored in association with two or more shared ones of the object identifiers to identify a multi-column composite key column set. | 02-13-2014 |
20140052710 | DEVICE AND METHOD OF MASS DATA STORAGE BASED ON TREE STRUCTURE - The present invention proposes a device and method of mass data storage based on tree structure, wherein the device of mass data storage based on tree structure includes an input/output module, a data creating module, a data query module, a data maintenance module, a memory and a main control module. The device and method of mass data storage based on tree structure disclosed in the present invention is easy to be extended, saving storage space, and can significantly improve the query efficiency. | 02-20-2014 |
20140059037 | DETERMINING CAPACITY OF SEARCH STRUCTURES - A system for storing target images for object recognition predicts a querying performance for the target image if the target image were included in a search tree of a database. The search tree has a universal search tree structure that is fixed so that it does not change with the addition of new target images. The target image is selected for inclusion or exclusion in the search tree based on the based on the querying performance, wherein the fixed tree structure of the search tree does not change if inclusion of the target image is selected. | 02-27-2014 |
20140095468 | HARDWARE FOR TABLE SCAN ACCELERATION - Techniques for processing a query are provided. One or more operations that are required to process a query are performed by a coprocessor that is separate from a general purpose microprocessor that executes query processing software. The query processing software receives a query, determines one or more operations that are required to be executed to fully process the query, and issues one or more commands to one or more coprocessors that are programmed to perform one of the operations, such as a table scan operation and/or a lookup operation. The query processing software obtains results from the coprocessor(s) and performs one or more additional operations thereon to generate a final result of the query. | 04-03-2014 |
20140101128 | ESTIMATING ROWS RETURNED BY RECURSIVE QUERIES USING FANOUT - In an embodiment, a recursive query is received that comprises a first select statement with a seed select statement and a second select statement with a recursive reference, wherein the recursive query further identifies at least two columns in at least one table, wherein the at least two columns have parent-child relationships represented by nodes in a graph, wherein the graph represents the organization of values in rows in the at least one table. A target recursion depth is calculated for the graph based on a fanout of the graph. In an embodiment, the target recursion depth is calculated by summing the fanout at each recursion depth of the graph multiplied by a number of nodes at each recursion depth of the graph. An estimated number of rows that the recursive query will return is estimated based on the target recursion depth. | 04-10-2014 |
20140114950 | FORMULATING GLOBAL STATISTICS FOR DISTRIBUTED DATABASES - 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. | 04-24-2014 |
20140149386 | DATABASE ROW ACCESS CONTROL - A method, system, and computer program product to create an access control bit mapping (ACBM) structure for a corresponding database table are disclosed. The ACBM structure may include a relative record number (RRN) bit map. The RRN bit map may describe the access rights for a parameter. The computer-implemented method may maintain one or more statistics describing the RRN bit map. The method may additionally provide for updating the ACBM structure. The method may also provide for using the ACBM structure to process a database query. | 05-29-2014 |
20140149387 | DATABASE ROW ACCESS CONTROL - A method, system, and computer program product to create an access control bit mapping (ACBM) structure for a corresponding database table are disclosed. The ACBM structure may include a relative record number (RRN) bit map. The RRN bit map may describe the access rights for a parameter. The computer-implemented method may maintain one or more statistics describing the RRN bit map. The method may additionally provide for updating the ACBM structure. The method may also provide for using the ACBM structure to process a database query. | 05-29-2014 |
20140156632 | SYSTEM-WIDE QUERY OPTIMIZATION - A locally optimized plan for executing a command using a sequence of steps can be determined for a single computing node. However, the locally optimized sequence of steps may not be optimized for a combined system comprising multiple computing nodes, any one of which may be tasked with executing the command. A plan that is optimized for the combined system may be determined by comparing the predicted cost of locally optimized plans for computing nodes in the combined system. | 06-05-2014 |
20140156633 | Scalable Multi-Query Optimization for SPARQL - Multiquery optimization is performed in the context of RDF/SPARQL. Heuristic algorithms partition an input batch of queries into groups such that each group of queries can be optimized together. The optimization incorporates an efficient algorithm to discover the common sub-structures of multiple SPARQL queries and an effective cost model to compare candidate execution plans. No assumptions are made about the underlying SPARQL query engine. This provides portability across different RDF stores. | 06-05-2014 |
20140172822 | SYSTEM AND METHOD FOR DISTRIBUTING AND CREATING PRESENTATIONS - A slide customization system, comprising an administrator, wherein at least one information presentation is received at the administrator, at least one database, wherein the at least one information presentation is stored, a validator, wherein validation of the at least one information presentation is performed by the validator by validating the at least one information presentation with at least one validation attribute selected by the administrator from a plurality of validation attributes, and wherein the validation of the selected ones of the validation attributes against the at least one information presentation is stored to said at least one database, and a compiler. | 06-19-2014 |
20140181072 | AUTOMATIC TUNING OF DATABASE QUERIES - A database query is modified to improve performance by identifying portions of database tables that are likely to be reused and modifying the database query accordingly. According to certain embodiments, the degree of selectivity with which a table is accessed is used to identify tables that are likely to be reused in subsequent database operations. | 06-26-2014 |
20140195512 | METHOD FOR OPTIMIZING PERFORMANCE OF DATABASE/WEB-SERVICE BACKED APPLICATIONS BY AUTOMATICALLY PREFETCHING QUERY RESULTS - The present disclosure proposes the method for optimizing the performance of data base/web-service backed applications by automatically prefetching query results. The proposed system and methods automatically insert prefetch instructions at the earliest possible points across procedure calls in application source code, in presence of conditional branching and loops. A data flow analysis technique called anticipable expressions analysis is extended, to analyze anticipability of queries. The benefit of prefetching is limited due to the presence of assignment statements and conditional branches that precede the query execution statement. Enhancements such as code motion, chaining and rewriting prefetch requests are devised to increase benefits of prefetching. These techniques perform equivalence preserving program and query transformations. | 07-10-2014 |
20140195513 | SYSTEM AND METHOD FOR USING ON-IMAGE GESTURES AND MULTIMEDIA CONTENT ELEMENTS AS SEARCH QUERIES - A method and system for searching a plurality of information sources using a multimedia content element are provided. The method comprises receiving an input search query including the multimedia content element and at least one on-image gesture detected thereon; generating at least one signature for the multimedia content element; analyzing the at least one on-image gesture to determine at least one portion of the multimedia content element in which a user is interested; generating at least one signature for each of the at least one portion of the multimedia content element; generating a textual search query using the at least the one generated signature; searching the plurality of information sources using the generated textual search query; and causing the display of search results retrieved from the plurality of information sources on a user device. | 07-10-2014 |
20140214793 | Cost-Effective Data Layout Optimization Over Heterogeneous Storage Classes - A system to optimize layout of database objects in a relational database management system stored on a plurality of storage classes each characterized by a price and a storage capacity includes a time-based query optimizer and a layout recommender coupled to the time-based query optimizer to estimate a total cost of operation (TCO) for a query workload on each data layout. The layout recommender includes an auxiliary object selection comprising database objects that include auxiliary objects that are optional to place with auxiliary object candidates being given from an auxiliary object recommender component. | 07-31-2014 |
20140222777 | RELATING TO USE OF COLUMNAR DATABASES - A method of searching for sets of data in a very large columnar database is described. The method comprises carrying out a first query by querying the very large columnar database for a first desired set of data, the database having a range of possible data storage locations; creating a compressed columnar representation of the locations within the very large columnar database of members of the first desired set of data; wherein the compressed columnar representation comprises a plurality of representations covering the entire range of the very large database, wherein each representation provides a descriptor describing a distribution of the desired data results within the sub-range of the entire range; storing the compressed columnar representation in a data cache; and applying a logical operation on first desired set of data stored within the very large columnar database by using the compressed columnar representation stored in the data cache in preference to data stored within the very large columnar database. | 08-07-2014 |
20140236920 | STREAMING DELAY PATTERNS IN A STREAMING ENVIRONMENT - The method and system receive streaming data to be processed by a plurality of processing elements comprising one or more stream operators. One embodiment is directed to a method and a system for managing processing in a streaming application. A stream operator may select a delay pattern. The stream operator may compare one or more performance factors from the delay pattern to one or more optimal performance factors. The stream operator may delay the stream of tuples using the delay pattern if the performance factors are determined by the optimal performance factors. | 08-21-2014 |
20140250102 | METHOD AND APPARATUS FOR DATA PREHEATING - Embodiments of the present invention disclose a method and an apparatus for data preheating, which relate to database technologies, so as to increase a responding speed of a database system, reduce frequent IO on a magnetic disk, and improve overall performance of the database system. The method includes: when a database is started, reading hit ratio information from a flash memory device and reading user configuration information from a hard disk; obtaining a union set of a preset hot data table in the user configuration information and a hot data table in the hit ratio information; determining the total number of to-be-loaded hot data blocks from the union set; according to the storage proportions, determining the to-be-loaded hot data block to be stored into a shared buffer and the flash memory device; and separately storing the to-be-loaded hot data block into the shared buffer and the flash memory device. | 09-04-2014 |
20140280018 | METHOD, APPARATUS, AND SYSTEM FOR PROVIDING AND USING SUBSCRIPTIONS AND FILTERING BASED ON TREE STRUCTURES - Methods and systems are provided such that users, servers, and applications may utilize an extensible data filtering model where data is organized into a tree with filtering available at any node level. Accordingly, the node filtering and propagation method and system allows for the efficient management and automatic replication of common information for multiple applications at all data levels. | 09-18-2014 |
20140304250 | Vertical-Based Query Optionalizing - In one embodiment, one or more computing devices receive a search query; the computing devices identify in the search query a search term associated with a first object type of multiple object types; the computing devices modify the search query by optionalizing the search term in the search query; the computing devices also send the search query as modified for execution against a first data store storing objects of the first object type. | 10-09-2014 |
20140317084 | CACHING EXTERNAL DATA SOURCES FOR SQL PROCESSING - Techniques are provided for caching external data sources for SQL processing. According to an embodiment, a database system receives a query that requires foreign data from an external data source. In response to receiving the query, the database system determines whether the foreign data currently resides in a cache of the database system. In response to determining that the foreign does not currently reside in the cache, the database system retrieves the foreign data from the external data source, maps the foreign data to a column granule of a table, and stores the column granule in the cache. In another embodiment, the database system receives a second query that requires the foreign data. In response to determining that the foreign data is cached with the stored column granule, the database system retrieves the column granule from the cache. | 10-23-2014 |
20140337313 | EXECUTING DATABASE QUERIES USING MULTIPLE PROCESSORS - A system and a method are disclosed for efficiently executing database queries using a computing device that includes a central processing unit (CPU) and a processing unit based on single instruction multiple thread (SIMT) architecture, for example, a GPU. A query engine determines a target processing unit to execute a database query based on factors including the type and amount of data processed by the query, the complexity of the query, and the current load on the processing units. An intermediate executable representation generator generates an intermediate executable representation for executing a query on a database virtual machine. If the query engine determines that the database query should be executed on an SIMT based processing unit, a native code generator generates native code from the intermediate executable representation. The native code is optimized for execution using a particular processing unit. | 11-13-2014 |
20140344244 | Calculation Engine with Dynamic Partitioning of Intermediate Results - A query is received by a database server from a remote application server. The query is associated with a calculation model that defines a data flow model that includes a plurality of calculation nodes that each define one or more operations to execute on the database server. Thereafter, the database server dynamically determine, using at least one attribute of at least one dataset responsive to the query, that intermediate results provided by at least one of the operations specified by at least one of the nodes of the calculation model require partitioning. The database server then modifies the calculation model to partition operations on the at least one dataset based on the dynamic determination. The database server subsequently instantiates the modified calculation model so that it can be executed to generate at least one result set. | 11-20-2014 |
20140358894 | OPTIMIZING QUERY STATEMENTS IN RELATIONAL DATABASES - Optimizing query statements in relational databases including determining filtering performance for each of at least two complex predicates in a predetermined layer of the query statement based on a result of a query performed on predetermined data records by using only the complex predicate. The results are ranked based on the filtering performance and re-ordered so that a complex predicate with a higher filtering performance is ranked before a complex predicate with a lower filtering performance. These techniques produce shortened data query response times and improved execution efficiency. | 12-04-2014 |
20140379690 | TRANSFORMING A QUERY BY ELIMINATING A SUBQUERY - A method, apparatus, and stored instructions are provided for transforming an initial query by eliminating a subquery nested within the initial query. The initial query may include an outer query that references a first instance of a particular data object. The initial query may also include set operator(s). At least a particular set operator may include a particular subquery that references a different instance of the particular data object. A query processor may transform the initial query to a transformed query that excludes the particular set operator and the particular subquery. The transformed query may instead include an added predicate that is based at least in part on the particular subquery. The added predicate may reference the first instance of the particular data object without referencing the different instance of the particular data object. The transformed query may be used for query execution instead of the initial query. | 12-25-2014 |
20140379691 | DATABASE QUERY PROCESSING WITH REDUCE FUNCTION CONFIGURATION - A distributed system that includes multiple database compute nodes, each operating a database. A control node provides a database interface that offers a view on a single database using parallel interaction with the multiple compute nodes. The control node helps perform a map reduce operation using some or all of the compute nodes in response to receiving a database query having an associated function that is identified as a reduce function. The control node evaluates the target data of the database query to identify one or more properties of the content of the target data. The reduce function is then configured based on these identified properties. | 12-25-2014 |
20150019528 | PRIORITIZATION OF DATA FROM IN-MEMORY DATABASES - Column accesses to columns of one or more database tables may be determined based on database queries accessing the one or more database tables. Row accesses to rows of the one or more database tables may be determined based on the queries. A priority may be assigned to a column of a row from the one or more database tables based on the determined column accesses of the column and the row accesses of the row. The column of the row may be moved from random access memory to hard disk based on the assigned priority. | 01-15-2015 |
20150032720 | OPTIMIZING DATABASE QUERIES - A system and method for database management and accessing data stored in the database may be optimized based on the database structure. For example, data associated with a range (e.g. owners of IP addresses) may have query requests optimized by utilizing two tables. The first table may include all the ranges, such that the ranges are continuous and not overlapping, and an identifier for each of the ranges. The second table may include the identifiers and the data that is associated with the range corresponding with those identifiers. Query requests for a particular range may be optimized by utilizing specialized database queries for the first table and because the data associated with the range is not part of the first table. Further, the second table size is reduced because an identifier may be associated with multiple ranges. | 01-29-2015 |
20150039585 | Global Dictionary for Database Management Systems - A global dictionary is described that corresponds to a database or table stored across multiple partitions. The global dictionary can be used to identify which partitions of the database contain records that are relevant to a user's query on the database. The global dictionary is made up of variable tables. Each variable table corresponds to a column of the database. A given variable table includes value tables where each value table corresponds to a defined value that has been assigned to a record in the database. A value table can include a list of partitions that contain a record having the related defined value. | 02-05-2015 |
20150046427 | ACCELERATING MULTIPLE QUERY PROCESSING OPERATIONS - Embodiments include methods, systems and computer program products a for offloading multiple processing operations to an accelerator includes receiving, by a processing device, a database query from an application. The method also includes performing analysis on the database query and selecting an accelerator template from a plurality of accelerator templates based on the analysis of the database query. The method further includes transmitting an indication of the accelerator template to the accelerator and executing at least a portion of the database query on the accelerator. | 02-12-2015 |
20150074081 | ENTITY-RELATIONSHIP MODEL EXTENSIONS USING ANNOTATIONS - Embodiments extend the relational model and language of standard SQL, to recognize features of higher level entity-relationship models (ERMs). Annotation language is implemented in the data design language (DDL) to incorporate tables and entities Using DDL, annotations are typed structures of metadata. Annotations may be used for types, entities and elements. In the query language (QL), annotations may be added to the standard QL. A reflection program may use the metadata of the annotation language for reflection on the tables or entities. | 03-12-2015 |
20150081665 | INTELLIGENT SEARCH AND SERVICE CUSTOMIZATION - An intelligent search and interface customization system including innovative methods of processing user requests and optimizing search results is disclosed. | 03-19-2015 |
20150081666 | SYSTEMS AND METHODS FOR OPTIMIZING DATABASE QUERIES - A computer-based method for optimizing database queries is provided. The method uses a server computer device including a processor communicatively coupled to a database. The method includes receiving a main query requesting data from a partitioned database table within the database. The partitioned database table includes a plurality of partitions. The method also includes determining a partition list. The partition list includes two or more partitions of the plurality of partitions and excludes at least one partition of the plurality of partitions. The method further includes generating a plurality of sub-queries where each sub-query is associated with one partition included within the partition list, and processing each sub-query of the plurality of sub-queries on the associated partition included within the partition list. | 03-19-2015 |
20150088855 | SHARING INFORMATION BETWEEN TENANTS OF A MULTI-TENANT DATABASE - In a method, system, and computer-readable medium having instructions for sharing information between tenants of a multi-tenant database, information is received on a connection between a first tenant of a multi-tenant database and a second tenant and the connection has information on a scope of data from the first tenant shared with the second tenant, data is allowed for a record of the first tenant to be accessible to the second tenant in accordance with the connection, information is received on a file related to the record of the first tenant, and data is allowed from the file to be accessible to the second tenant in accordance with the connection. | 03-26-2015 |
20150310094 | RULES BASED DATA PROCESSING SYSTEM AND METHOD - Systems, methods and mediums are described for processing rules and associated bags of facts generated by an application in communication with a processing engine, database and rule engine that process the bags of facts in view of the rules and generate one or more rule-dependent responses to the application which performs one or more work flows based on the responses. The rule engine may apply forward-chaining, backward-chaining or a combination of forward-chaining and backward-chaining to process the rules and facts. Numerous novel applications that work in conjunction with the processing engine, database and rule engine are also described. | 10-29-2015 |
20150324383 | OPTIMIZING RELATIONAL DATABASE QUERIES WITH MULTI-TABLE PREDICATE EXPRESSIONS - Responding to relational database queries (for example, SQL queries) in a new way. More specifically, qualifying queries are written (for example, written by a human individual) in a way so that a join operation precedes a row limiting operation. Notwithstanding the fact that the join operation precedes the row limiting operation, when responding to the query, machine logic (for example, software) performs the row limiting operation before the join operation. This can improve time and processing efficiency. | 11-12-2015 |
20150356139 | ADAPTING A RELATIONAL QUERY TO ACCOMMODATE HIERARCHICAL DATA - A method, system and computer program product for processing hierarchical data is provided. A method for processing hierarchical data in a relational database includes receiving an input parameter in an initial query for querying an array in a hierarchical data object stored in a table of a relational database, and transforming the initial query into a transformed query configured to place all elements of the array into a different table and to apply a sub-query against the table for the input parameter. Once transformed, predicate evaluation logic of a relational engine of the relational database is applied to the transformed query that is then mapped to the initial query. Finally, responsive to receiving a subsequent instance of the initial query, the mapping is referred to in order to replace the initial query with the transformed query and to subsequently apply the predicate evaluation logic to the transformed query. | 12-10-2015 |
20150379075 | MAINTAINING DIVERSITY IN MULTIPLE OBJECTIVE FUNCTION SOLUTION OPTIMIZATION - A computer performs searching in order to optimize a plurality of input parameters. Each of the input parameters is input to a time-series trial process. The computer receives a plurality of input parameters and performs a trial process on each of the plurality of input parameters. The computer then calculates an evaluation value of the trial process performed on each of the plurality of input parameters and calculates a degree of similarity among a plurality of trial processes based on a feature value. Each of the feature values is extracted from the trial process performed on a corresponding one of the plurality of input parameters. The computer updates the plurality of input parameters based on the evaluation value of the trial process calculated for each of the plurality of input parameters and the degree of similarity among the plurality of trial processes. | 12-31-2015 |
20150379119 | PERFORMING PREDICATE EVALUATION ON COMPRESSED CHARACTER STRING OF VARIABLE LENGTH - Methods, devices and computer program products for performing predicate evaluation on a compressed variable length character string are disclosed. Aspects include determining upper and lower boundaries of a false positive range for a predicate, the false positive range for the predicate being a range in which a result of the predicate evaluation may lead to a false positive error. Aspects also include compression-encoding the upper and lower boundaries of the false positive range and performing a first comparison for comparing the compressed variable length character string with the compression-encoded upper and lower boundaries of the false positive range. Aspects further include determining a result of the predicate evaluation based on at least a result of the first comparison processing. | 12-31-2015 |
20160019291 | Apparatus And Method For Information Retrieval At A Mobile Device - A topic selection from a user is obtained. The topic selection obtained via user action at a user interface of a mobile device. Based upon the topic selection, one or more questions are retrieved. Each of the questions being linked to an optimized search stored in a memory of the mobile device. A question selection from the user is received. The optimized search is retrieved from memory based upon the question selection of the user. Search results accomplished by the search are received and presented to the user. The search results can be saved for further analysis. The topic and question selections can be saved as a favorite for future use. Also, a handbook with chapters can be provided to display formatted results and is updated each time visited by a user. | 01-21-2016 |
20160026684 | FRAMEWORK FOR VOLATILE MEMORY QUERY EXECUTION IN A MULTI NODE CLUSTER - Techniques are described herein for executing queries on distinct portions of a database object that has been separate into chunks and distributed across the volatile memories of a plurality of nodes in a clustered database system. The techniques involve receiving a query that requires work to be performed on data that resides in a plurality of on disk extents. A parallel query coordinator that is aware of the in-memory distribution divides the work into granules that align with the in-memory separation. The parallel query coordinator then sends each granule to the database server instance with local in memory access to the data required by the granule and aggregates the results to respond to the query. | 01-28-2016 |
20160026685 | REMOTE DOCUMENT RETRIEVAL AND STORAGE SYSTEM - An electronically stored financial document is either maintained in a first storage system when a parameter associated with the document is greater than a pre-selected parameter or in a second storage system when the parameter associated with the document is less than or equal to the pre-selected parameter. A request for a stored financial document is received and the requested financial document parameter is compared to the pre-selected financial document parameter to determine if the electronically stored financial document's parameter is more than, less than, or equal to the pre-selected parameter. In processing the request, a processing unit compares and electronically accesses one of the storage systems in response to the comparison of the pre-selected parameter to the electronically stored financial document's parameters. After accessing the appropriate storage system, the requested electronically stored financial document can be reproduced, and/or distributed. | 01-28-2016 |
20160026686 | SYSTEM AND METHODS TO CONFIGURE A QUERY LANGUAGE USING AN OPERATOR DICTIONARY - Systems and methods to configure a query language using an operator dictionary are described. The system receives, from a first user, a search query to search for document information in a database. The system determines that terms of the search query from the first user are in accordance with dictionary information that corresponds to the first user. The dictionary information includes a first list of compatible query operators. The system applies the search query to the index data structure in the database to identify the document information. The system sends an electronic interface to the first user that includes the document information. | 01-28-2016 |
20160034529 | SYSTEMS AND METHODS FOR A DISTRIBUTED QUERY EXECUTION ENGINE - Various embodiments of the present disclosure can include systems, methods, and non-transitory computer readable media configured to receive at least one database query to be executed. Code corresponding to the at least one database query can be generated. One or more optimizations to the generated code can be performed to produce specialized modular code. The one or more optimizations can include Just-In-Time (JIT) compilation techniques. Respective portions of the code can be distributed to a plurality of distributed computing systems for execution, wherein each of the distributed computing systems is connected to a portion of the plurality of distributed computing systems. A result for the at least one database query can be provided. | 02-04-2016 |
20160034534 | TECHNIQUE FOR UPDATING A CONTEXT THAT FACILITATES EVALUATING QUALITATIVE SEARCH TERMS - The disclosed embodiments relate to a system that updates a context that facilitates evaluating qualitative search terms for an attribute during query processing. During operation, the system extracts a value for the attribute from each data item in a set of data items. Next, the system updates the context based on the extracted attribute values, wherein the context includes a concept-mapping for one or more qualitative search terms applied to the attribute, and wherein each concept-mapping associates a given attribute value with a numerical compatibility index that indicates a compatibility between the given attribute value and a corresponding qualitative search term. | 02-04-2016 |
20160048558 | OPTIMIZED QUERY PROCESSING USING AGGREGATES WITH VARYING GRAIN SIZES - A computer-implemented method and system for querying aggregates in a database include maintaining aggregates based on a dimension in the database with at least two grain sizes; receiving a query of the aggregates for a defined range of the dimension; finding a start and an end for a read operation for a larger grain size of the at least two grain sizes of the aggregates for the defined range; reading a first set from the start to the end in the database of the larger grain size of the at least two grain sizes of the aggregates; reading a second set comprising a smaller grain size of the at least two grain sizes of the aggregates based on the defined range and the start and the end; and adjusting the first set with the second set. | 02-18-2016 |
20160055204 | APPARATUS AND METHOD FOR EXECUTING PARALLEL TIME SERIES DATA ANALYTICS - Time series data is identified that is related to a predetermined characteristic and the predetermined characteristic being at least one of an identity of a sensor or a time range. Based upon the identified time series data, the time series data is moved to selected ones of the plurality of separate data storage devices, and the movement is temporary for processing purposes. In parallel, queries are performed on the time series data on each of the selected ones of the plurality of separate data storage devices to obtain a plurality of results. The plurality of results are aggregated. | 02-25-2016 |
20160063057 | MAINTAINING BACKGROUND KNOWLEDGE IN COMPLEX EVENT PROCESSING - A system and method for maintaining and updating a complex event processing system in response to real-world changes, to avoid non-optimal queries that can lead to poor performance and/or erroneous results. The knowledge model of the complex event processing system is monitored to identify elements that impact query optimization and additional knowledge elements that would impact query optimization if they were present. A watch model is constructed for the identified elements, and responses to monitor queries sent to the event processor are checked to determine if the system requires re-optimization. When monitor query responses indicate that the system requires re-optimization, the affected queries are re-optimized and redeployed automatically. | 03-03-2016 |
20160070761 | PARALLEL DATA STREAM PROCESSING METHOD, PARALLEL DATA STREAM PROCESSING SYSTEM, AND STORAGE MEDIUM - A non-transitory computer-readable storage medium stores a data stream processing program that causes a computer to execute a process. The process includes extracting a relationship between properties included in events in a data stream from the data stream itself, definitions of queries for processing the data stream, or both of the data stream and the definitions of the queries; specifying a common partitioning key common to a subset of the queries to be grouped into a partitioning group based on partitioning keys in the definitions of the queries, the relationship between the properties, and a probability of the relationship; and assigning the subset of the queries belonging to the partitioning group to each of parallel nodes provided for parallel distributed processing based on the specified common partitioning key. | 03-10-2016 |
20160078088 | Systems and Methods for Providing Metadata Aware Background Caching in Data Analysis - In general, the present invention is directed to systems and corresponding methods for providing metadata aware background caching amongst various tables in data processing systems, the system configured to process either an original copy of data stored or data stored in derived tables in one or more data stores, the system including: a query optimization module, a catalog module, and a dataset manager. Each of the query optimization module, catalog module, and dataset manager may be communicatively connected to the original copy of data and the derived tables in one or more data stores. The query optimization module configured to conduct queries against data stored in the original copy of data or in the derived tables; the catalog module configured to register tables of data across various types and formats of data stores; and the dataset manager configured to maintain the freshness of the data in the derived tables. | 03-17-2016 |
20160092505 | FRAMEWORK FOR HANDLING WRAPPER PROCEDURES - A framework for handling a wrapper procedure is provided herein. In accordance with one aspect, a user definition of a wrapper procedure encapsulating a stored procedure is received. The framework retrieves metadata associated with the stored procedure. The framework may prepare at least one query statement to invoke the stored procedure using an input parameter identified from the metadata. The framework may further set at least one value of at least one identified input parameter based on the metadata, and execute the prepared query statement using the set value of the input parameter to generate at least one value for an output parameter. | 03-31-2016 |
20160092508 | REARRANGING SEARCH OPERATORS - A system and method for rearranging search operators of a search query are disclosed. In some example embodiments, a first initial search query is received from a first user. The first initial search query comprises at least one search operator and at least one search term. A first rewritten search query is generated based on the first initial search query. The generating of the first rewritten search query comprises rewriting at least one optional search operator in the first initial search query using at least one required search operator and at least one exclusion search operator in response to a determination that the first initial search query comprises the at least one optional search operator and does not comprise any required search operators. A first set of search results is generated for the first rewritten search query and caused to be presented to the first user. | 03-31-2016 |
20160098448 | DYNAMIC DATABASE QUERY EFFICIENCY IMPROVEMENT - Examples of dynamic database query efficiency improvement are provided herein. Query portions of a received database query can be identified as candidates for replacement. The candidates for replacement can be query portions that reduce the efficiency of the query. Alternative queries can be determined that include substitute query portion(s) in place of candidate(s) for replacement. An expected performance of the alternative queries can be determined. Based at least in part on the expected performance of the alternative queries, one or more alternative queries can be selected as replacement database queries for the received database query. | 04-07-2016 |
20160117417 | DETECTION OF THE N-QUERIES VIA UNIT TEST - In one aspect, there is provided a method. The method may include intercepting a request including one or more select queries sent to a database; generating a parametric form for each of one or more select queries; processing the parametric form to determine whether the one or more select queries cause an n-query issue comprising multiple selects, when executed at the database; and indicating an exception, when the one or more select queries cause the n-query issue. Related systems, methods, and articles of manufacture are also disclosed. | 04-28-2016 |
20160125026 | PROACTIVE QUERY MIGRATION TO PREVENT FAILURES - An example method of processing a federated query includes receiving a first federated query from a first client and receiving a second federated query from a second client. The first federated query includes a first source query that is in accordance with a target data source's query model, and the second federated query includes a second source query. The method also includes sending the second source query to the target data source and determining whether the second source query has failed at the target data source. The method further includes in response to determining that the second source query has failed, migrating the second source query in accordance with the first source query. | 05-05-2016 |
20160125033 | STREAM DATA PROCESSING METHOD WITH TIME ADJUSTMENT - Some stream data (e.g., sensor streams) has characteristics in which data is periodically sent to a stream data processing server. When data arrives periodically, to hold a certain period is the same as to hold a certain amount. Example implementations described herein are directed to replacing the range window, which holds a period of stream data, with a row window which holds an amount of stream data. In the same manner, the example implementations replace the range rstream, which outputs results every period, with a row rstream which outputs results for every amount. | 05-05-2016 |
20160140171 | METHOD AND SYSTEM FOR EFFICIENT PERFORMANCE PREDICTION OF STRUCTURED QUERY FOR BIG DATA - Disclosed is a system for predicting an Elapsed Response Time (ERT) of a query to be executed in a production database. The system includes a database emulator module for creating an emulated database based on empty schema derived by extrapolating statistical information from the development environment. The system also includes an execution plan generation module for generating a query execution plan of the query. The system further includes a query classifying module for classifying each sub-query based on the operational parameters into at least one of a full table scan, a primary index scan, a fast index scan and a non-unique index scan. The system also includes a time determination module for executing each sub-query on the emulated database to determine an Input Output (IO) access time and an operator time. Moreover, the system includes an ERT prediction module for predicting the ERT of the query to be executed in the production database based on the IO access time, the operator time, and a network time. | 05-19-2016 |
20160147872 | NEW TERMS FOR QUERY EXPANSION USING UNSTRUCTURED DATA - A processor determines a set of terms frequently occurring within unstructured data associated with criteria of a query. The processor analyzes the unstructured data to match a term of the set of terms, to criteria of the query. Matching terms are retained and unmatched terms are checked for semantic similarity to terms of the criteria to determine an inferred match of the term of the unstructured data to terms of the criteria of the query. In response to determining an inferred match, the inferred match term is added to the second set of terms, and the processor compares the second set of terms to the terms of the criteria of the query, and removes matching terms, resulting in a third set of terms added to the set of criteria terms of the query. The additional query terms will enhance the recall without diluting the precision. | 05-26-2016 |
20160162544 | METHOD AND SYSTEM FOR DYNAMICALLY OPTIMIZING CLIENT QUERIES TO READ-MOSTLY SERVERS - A system and method of query optimization are disclosed. A complexity measure of a client query received from a client application is compared to a predetermined threshold, which is determined using at least one of system data and query execution data. An optimized query is generated by modifying the client query to reduce the complexity measure of the client query if the complexity measure of the client query exceeds the predetermined threshold. The optimized query is submitted to a server application on a server and a post-processing routine to be applied to the result set is selected. | 06-09-2016 |
20160179935 | TECHNIQUES FOR MODIFYING RECIPES TO REDUCE PREPARATION TIMES AND/OR INCORPORATE PREFERRED INGREDIENTS | 06-23-2016 |
20160378777 | PROVIDING QUERY RECOURSE WITH EMBEDDED QUERY ADJUSTMENT OPTIONS - A user query may be evaluated to provide a result set. In case the results do not reflect the user's intent, the device may provide recourse options for adjusting the query in a manner that yields more desirable results, e.g., a suggestion at the top of the result set for a different spelling, or recommendations at the end of the results set for additional query techniques that may yield more accurate results. However, such presentation of recourse options may clutter the user interface and/or go unnoticed by the user. Instead, an adjusted query may be identified with an interpreted probability of reflecting the intent of the query. An adjustment option describing the adjusted query may be inserted into the result set, between a higher-probability first result and a lower-probability second result. Selection of the adjustment option may cause the adjusted query to be evaluated on behalf of the user. | 12-29-2016 |
20180025052 | INFRASTRUCTURE AWARE QUERY OPTIMIZATION | 01-25-2018 |
20190147087 | PREDICTIVE QUERY IMPROVEMENT | 05-16-2019 |
20190147092 | DISTRIBUTING PARTIAL RESULTS TO WORKER NODES FROM AN EXTERNAL DATA SYSTEM | 05-16-2019 |
20220138195 | USER DEFINED FUNCTIONS FOR DATABASE QUERY LANGUAGES BASED ON CALL-BACK FUNCTIONS - A parallel database system processes database queries invoking a user defined function (UDF). The database query is specified in a database query language, for example, the structured query language (SQL) and the UDF is specified in a programming language different from the database query language, for example, C/C++. The UDF may include multiple phases. The parallel database system generates optimized code for the UDF. The parallel database system includes a leader node and a plurality of compute nodes. The database query processes one or more database tables such that each compute node processes a slice of each database table. The leader node sets up a global context structure and provides it to each compute node. The global context may be shared across multiple executions of the query. The UDF may be used for efficient execution of extraction, transformation, and loading of data from external systems. | 05-05-2022 |
20220138196 | AUTOMATIC PRUNING CUTOFF IN A DATABASE SYSTEM - During a query compilation process, a query is received that is directed to a set of source tables, each source table from the set of source tables being organized into at least one micro-partition and the query including at least one pruning operation. During the query compilation process, a modification of the query is performed for adjusting the at least one pruning operation, the modification being based on a set of statistics collected for previous pruning operations on at least a portion of the set of source tables and a set of heuristics, the set of statistics indicating at least an amount of execution time for each previous query associated with each of the previous pruning operations. The query is compiled including the modification of the query. The compiled query is provided to an execution node of a database system for execution. | 05-05-2022 |