Patent application number | Description | Published |
20090177697 | CORRELATION AND PARALLELISM AWARE MATERIALIZED VIEW RECOMMENDATION FOR HETEROGENEOUS, DISTRIBUTED DATABASE SYSTEMS - A method is provided for generating a materialized view recommendation for at least one back-end server that is connected to a front-end server in a heterogeneous, distributed database system that comprises parsing a workload of federated queries to generate a plurality of query fragments; invoking a materialized view advisor on each back-end server with the plurality of query fragments to generate a set of candidate materialized views for each of the plurality of query fragments; identifying a first set of subsets corresponding to all nonempty subsets of the set of candidate materialized views for each of the plurality of query fragments; identifying a second set of subsets corresponding to all subsets of the first set of subsets that are sorted according to a dominance relationship based upon a resource time for the at least one back-end server to provide results to the front-end server for each of the first set of subsets; and performing a cost-benefit analysis of each of the second set of subsets to determine a recommended subset of materialized views that minimizes a total resource time for running the workload against the at least one back-end server. | 07-09-2009 |
20090281818 | QUALITY OF SERVICE AWARE SCHEDULING FOR COMPOSITE WEB SERVICE WORKFLOWS - A method of assigning web service requests to service providers includes searching for an optimal assignment from all possible assignments using a genetic algorithm (GA) that represents possible assignments as chromosomes, and converging towards an assignment of web service request to service providers that maximizes overall business value for all workflows to the service providers. An adaptive mutation scheme is used to introduce mutation into populations of chromosomes. The mutation scheme includes a mutation rate that increases when chromosomes under evaluation fail to improve its workload against the metric over a certain number of generations. | 11-12-2009 |
20130006988 | PARALLELIZATION OF LARGE SCALE DATA CLUSTERING ANALYTICS - A cluster selector may determine a plurality of sample clusters, and may reproduce the plurality of sample clusters at each of a plurality of processing cores. A sample divider may divide a plurality of samples stored in a database with associated attributes into a number of sample subsets corresponding to a number of the plurality of processing cores, and may associate each of the number of sample subsets with a corresponding one of the plurality of processing cores. A joint operator may perform a comparison of each sample of each sample subset at each corresponding core of the plurality of processing cores with respect to each of the plurality of sample clusters reproduced at the corresponding processing core, based on associated attributes thereof. | 01-03-2013 |
20130066455 | DEMAND-DRIVEN COLLABORATIVE SCHEDULING FOR JUST-IN-TIME MANUFACTURING - A schedule manager may include a chromosome comparator configured to compare a plurality of schedule chromosomes, each schedule chromosome including a potential schedule of use of manufacturing resources within one or more time intervals in producing one or more items, and configured to compare each of the plurality of schedule chromosomes relative to constraints, to thereby output a selected subset of the plurality of schedule chromosomes. The schedule manager may include a chromosome combiner configured to combine schedule chromosomes of the selected subset to obtain a next generation of schedule chromosomes for output to the chromosome comparator and for subsequent comparison therewith of the next generation of schedule chromosomes with respect to the constraints, as part of an evolutionary loop of the plurality of schedule chromosomes between the chromosome comparator and the chromosome combiner, and a scheduler configured to select a selected schedule chromosome therefrom. | 03-14-2013 |
20130066774 | METHOD AND SYSTEM FOR WORKING CAPITAL MANAGEMENT - In accordance with aspects of the disclosure, a system and methods are provided for managing working capital by scheduling payments to be paid for accounts payable based on payments received for accounts receivable relative to one or more time intervals while maintaining a predetermined working capital reserve threshold. The systems and methods may include calculating accounts receivable patterns for each customer to determine a confidence level in receiving payments from each customer within the one or more time intervals, generating one or more potential payment schemes for each vendor, and generating a payment schedule for accounts payable for each vendor within the one or more time intervals based on the determined confidence level for each customer and the one or more potential payment schemes for each vendor while maintaining the predetermined working capital reserve threshold. | 03-14-2013 |
20130117752 | HEURISTICS-BASED SCHEDULING FOR DATA ANALYTICS - A scheduler may receive a plurality of jobs for scheduling of execution thereof on a plurality of computing nodes. An evaluation module may provide a common interface for each of a plurality of scheduling algorithms. An algorithm selector may utilize the evaluation module in conjunction with benchmark data for a plurality of jobs of varying types to associate one of the plurality of scheduling algorithms with each job type. A job comparator may compare a current job for scheduling against the benchmark data to determine a current job type of the current job. The evaluation module may further schedule the current job for execution on the plurality of computing nodes, based on the current job type and the associated scheduling algorithm. | 05-09-2013 |
20130346380 | DATABASE ACCESS ACCELERATION - A system includes a request analyzer configured to receive a plurality of database requests and classify the plurality of database requests as transaction requester or non-transaction requests, and further configured to route the transaction requests to a transaction server for application against a transaction database, including write access to an identified portion thereof, and to route the non-transaction requests to a non-transaction server to thereby read data obtained from a non-transaction database. The system also includes an update manager configured to update the non-transaction database, based on the application of the transaction requests against the transaction database. | 12-26-2013 |
20140019984 | FEEDBACK-DRIVEN TUNING FOR EFFICIENT PARALLEL EXECUTION - A parallel execution manager may determine a parallel execution platform configured to execute tasks in parallel using a plurality of available processing threads. The parallel execution manager may include a thread count manager configured to select, from the plurality of available processing threads and for a fixed task size, a selected thread count, and a task size manager configured to select, from a plurality of available task sizes and using the selected thread count, a selected task size. The parallel execution manager may further include an optimizer configured to execute an iterative loop in which the selected task size is used as an updated fixed task size to obtain an updated selected thread count, and the updated selected thread count is used to obtain an updated selected task size. Accordingly, a current thread count and current task size for executing the tasks in parallel may be determined. | 01-16-2014 |
20140031965 | PRODUCTION SCHEDULING MANAGEMENT - In accordance with aspects of the disclosure, systems and methods are provided for production scheduling management by scheduling production events for each of a plurality of production resources used to manufacture one or more products relative to one or more time intervals while considering constraints related to product dependency trees for each of the one or more products. The systems and methods may include determining the constraints related to the product dependency trees for each of the one or more products, generating one or more potential production scheduling schemes for use of each production resource within the one or more time intervals while considering the constraints related to the product dependency trees for each of the one or more products, and generating a production schedule for the production events within the one or more time intervals based on the one or more potential production scheduling schemes. | 01-30-2014 |
20140032514 | ASSOCIATION ACCELERATION FOR TRANSACTION DATABASES - An association rule accelerator may be used to access a transaction database storing a plurality of transactions, each transaction including one or more items. The association rule accelerator also may select a sampling rate based on an item frequency of frequent items within the transaction database, relative to a sampled item frequency of sampled items within a corresponding sampled transaction database. An an association rule selector may determine, using the selected sampling rate and corresponding sampled transaction database, frequent item sets within the sampled transactions, and may further determine an association rule relating at least two items of the sampled transactions, based on the frequent item sets. | 01-30-2014 |
20140067601 | SUPPLY CHAIN FINANCE PLANNING - In accordance with aspects of the disclosure, a system and methods are provided for supply chain finance planning by generating a loan plan with a relatively low interest payment for an orders set having collateral related assets while maintaining a working capital reserve at a predetermined threshold. The systems and methods may include retrieving account information for buyers related to the collateral related assets, retrieving lending information for lenders and evaluating interest payment patterns for each lender based on the collateral related assets, generating one or more potential loan schemes for each lender based on accounts receivable patterns for each buyer and the interest payment patterns for each lender, and generating the loan plan with the relatively low interest payment for the orders set having the collateral related assets while maintaining the working capital reserve at the predetermined threshold based on the potential loan schemes for each lender. | 03-06-2014 |
20140089331 | INTEGRATED ANALYTICS ON MULTIPLE SYSTEMS - The embodiments provide a federated system for supporting an application to perform analytics. The federated system includes a first distributed system for performing one or more first tasks including processing incoming data into a set of data blocks, an in-memory database system for performing one or more second tasks including receiving the set of data blocks from the first distributed system and storing the set of data blocks in an internal storage, and a second distributed system for performing one or more third tasks including receiving at least one data block of the set from the in-memory database system and performing analytics on the at least one data block. Execution of the first, second, and third tasks are controlled via a scripting language utilized by the application and associated with the in-memory database system. | 03-27-2014 |
20140100992 | MATCHING ORDERS WITH INCOMING SHIPMENTS - The embodiments provide a system for matching orders with incoming shipments. The system may include a product shipment handler configured to receive product shipment information specifying incoming products, a product order handler configured to receive product order information specifying a plurality of product orders and input parameter information associated with each product order, a job dispatcher configured to create a plurality of jobs based on the product shipment information and the product order information, a modeling tool configured to model each job as a separate constrained linear optimization problem, and a linear solver configured to solve each constrained linear optimization problem based on the input parameter information and the product shipment information including generating a delivery plan for each product order within a respective job that matches at least one incoming product with a corresponding product order over a period of time. | 04-10-2014 |
20140101024 | PREDICTING FINANCIAL OUTCOME - The embodiments provide a system for predicting financial outcome of an order. The system includes a discriminant model training module configured to receive historical orders from a data source and to generate discriminant model parameters based on the historical orders, a discriminant model engine configured to receive at least one order to be analyzed and to calculate a probability for each of a plurality of outcomes for the at least one order to be analyzed based on the discriminant model parameters, and a strategy comparison module configured to calculate an expected business value for at least one strategy based on, in part, the probabilities for the plurality of outcomes to evaluate a risk associated with the at least one order. | 04-10-2014 |
20140164170 | CONFIGURABLE MULTI-OBJECTIVE RECOMMENDATIONS - The method includes determining at least one business objective on which to base a recommendation list for a first item, associating a configurable target with the business objective, the configurable target being based on a goal for a second item, determining at least one business constraint relating the first item with the second item, the at least one business constraint being based on the business objective and the associated configurable target and generating the recommendation list for the first item based on a list of candidate items and the business constraint. | 06-12-2014 |
20140279662 | TRANSPORTATION TIME ESTIMATION BASED ON MULTI-GRANULAR MAPS - An index engine may receive historical path data characterizing transportation paths in terms of associated conditions, and may define path segments of varying levels of granularity based on the historical path data, wherein relatively shorter path segments have relatively finer levels of granularity than those of path segments of relatively coarser levels of granularity. The index engine may then index each path segment, based on its corresponding level of granularity and its associated conditions. Then, a query processor may receive a query for a new transportation route, and determine a predicted transportation time for the new transportation route, using the indexed path segments. | 09-18-2014 |
20140379520 | DECISION MAKING CRITERIA-DRIVEN RECOMMENDATIONS - The embodiments provide a system for decision-making criteria-based recommendations. The system may include a decision engine configured to receive a request for recommendations for an option problem associated with a product or service category, and determine options among a plurality of options for the product or service category based on preference information. The preference information may include activated decision-making criteria and corresponding weight values. The corresponding weight values may represent a relative importance of each activated decision-making criterion. The decision engine may be configured to determine options among the plurality of options including calculating scores for the plurality of options based on, in part, the activated decision-making criteria and the corresponding weight values and selecting the options among the plurality of options based on the calculated scores. The decision engine may be configured to provide a display of the determined options as the recommendations for the product or service category. | 12-25-2014 |
20140379638 | CONCURRENT REQUEST HANDLING FOR DATABASE TRANSACTIONS - A request handler may receive transaction requests for transactions to be executed using data of a database, and may classify a first transaction request of the transaction requests as a simple transaction request, and a second transaction request of the transaction requests as a complex transaction request. A key-value store engine may execute a first transaction satisfying the first transaction request, using a key-value store of pre-calculated results determined prior to receipt of the first transaction request, and based on the data, and may update a key-value delta reflecting a change, if any, of the key-value store caused by the first transaction. A relational store engine may cause the at least one processor to execute a second transaction satisfying the second transaction request, using a relational store including a subset of the data, and may update a relational delta reflecting a change, if any, of the relational store caused by the second transaction. A synchronizer may execute a synchronization of the key-value store and the relational store, based on the key-value delta and the relational delta. | 12-25-2014 |
20150063123 | METHODS AND SYSTEMS FOR ROUTING SELECTION BASED ON ROUTING DISTANCE AND CAPACITY - A system, computer-readable storage medium storing at least one program, and computer-implemented method for route selection based on payload delivery capacity and routing distance are described. Network demand information is obtained. The network demand information may include a network graph and information related to an outbound demand of each node of the network graph. A simplified demand graph based on the outbound demand of each node and a distance between each node pair is generated. A plurality of return routes for the simplified network graph is generated and a payload delivery capacity of each of the routes is calculated. An advised return route from the plurality of return routes is generated based in part on the payload delivery capacities of the plurality of return routes. | 03-05-2015 |
20150074066 | DATABASE OPERATIONS ON A COLUMNAR TABLE DATABASE - A computer system includes at least one processor and at least one memory operably coupled to the at least one processor. The memory includes a memory pool and a database partitioned into multiple fragments. Each of the fragments is allocated a block of memory from the memory pool and the fragments store compressed data in a columnar table format. A database operation is applied in a compressed format to the compressed data in at least one of the fragments. | 03-12-2015 |
20150081077 | PRODUCTION RESOURCE MANAGEMENT - In accordance with aspects of the disclosure, systems and methods are provided for managing production resources including scheduling production events for production resources used to manufacture products relative to time intervals while maintaining collaboration among the production resources. The systems and methods may include retrieving information related to each production resource, evaluating each production event for each product to determine a sequence of the production events, and generating potential production scheduling schemes for use of each production resource within the time intervals while maintaining collaboration among the production resources. The systems and methods may include generating a production schedule for the production events within the time intervals based on the potential production scheduling schemes for use of each production resource within the time intervals while maintaining collaboration among the production resources. | 03-19-2015 |
20150081360 | Order/Vehicle Assignment Based on Order Density - Example systems and methods of assigning shipping orders to delivery vehicles are presented. In one example, a delivery region may be segmented into delivery blocks. A shipping order density may be determined for each of the delivery blocks. Adjacent delivery blocks having corresponding shipping order densities may be merged to yield delivery areas. A cost of using each type of available delivery vehicle to transport a delivery job may be determined relative to a cargo capacity of the vehicle type, a delivery distance, and a shipping order density. Each of the delivery areas may be partitioned into delivery jobs based on the cost of using each of the vehicle types. Each of the delivery jobs may be assigned to one of the available delivery vehicles based on minimizing a total cost of using the vehicles to transport the delivery jobs. | 03-19-2015 |
20150081471 | PERSONAL RECOMMENDATION SCHEME - A system may include a similarity measurement processing unit configured to determine a plurality of similar users that are similar to a user based on similarity values including calculating the similarity values for pairs of users based on an importance vector and differences between rated items. The importance vector may include importance values corresponding to a plurality of items, and each importance value may represent a similarity importance of a corresponding item. Each similarity value may represent a level of similarity between the user and another user. Also, the system may include a rating processor configured to estimate a rating value of an unrated item for potential recommendation based on recommendations from the plurality of similar users, and provide a recommendation for the item based on the rating value. | 03-19-2015 |
20150081656 | PROVISION OF SEARCH REFINEMENT SUGGESTIONS BASED ON MULTIPLE QUERIES - A query collector may be configured to receive a plurality of queries applied by a search engine to obtain corresponding search results. A graph manager may be configured to generate, based on the plurality of queries, a directed graph of nodes, each node corresponding to at least one query and connected to another node, and further configured to merge at least two of the nodes based on a similarity of corresponding queries thereof, to obtain a merged node, and generate at least one representative query representing the merged node. A suggestion generator may be configured to match a current query with a matching node of the nodes, determine that the merged node is a successor node of the matching node within the directed graph, and provide the at least one representative query as a suggested query for a future search to be conducted by the search engine. | 03-19-2015 |
20150081911 | MIGRATION EVENT SCHEDULING MANAGEMENT - In accordance with aspects of the disclosure, systems and methods are provided for scheduling migration events for server resources in a server cluster relative to a time interval while considering load balance constraints and data transfer constraints of the server cluster. The systems and methods may include generating one or more potential migration scheduling schemes for migration of each server resource to at least one other server resource in the server cluster within the time interval while considering the load balance constraints and the data transfer constraints of the server cluster, and generating a migration event schedule for each migration event within the time interval based on the one or more potential migration scheduling schemes generated for migration of each server resource to at least one other server resource in the server cluster. | 03-19-2015 |
20150088417 | System and Method for Dynamic Path Optimization - Techniques of dynamic path optimization are disclosed. In some embodiments, a method comprises receiving an instruction to determine an optimal path from a source geographical location to a destination geographical location, and determining an optimal path from the source geographical location to the destination geographical location using corresponding historical traffic information for each one of a plurality of sub-paths. The historical traffic information for each sub-path may correspond to an estimated arrival time at a start location for the corresponding sub-path and be used to select sub-paths from the plurality of sub-paths. The selected sub-paths may define the optimal path. In some embodiments, the historical traffic information comprises an indication of traffic flow for the corresponding sub-path. In some embodiments, the indication of traffic flow comprises an average speed of traffic flow. | 03-26-2015 |
20150088571 | SYSTEM AND METHOD FOR TASK ASSIGNMENT IN WORKFLOWS - The method includes determining an assignment completion time distribution based on a task set defining a project, determining a project completion time distribution based on the assignment completion time distribution and the task set, determining a project cost based on assignments of the task set, and generating a list of project task assignments based on the project cost and the project completion time distribution. | 03-26-2015 |
20150088907 | METHOD AND SYSTEM FOR MANAGING DATABASES HAVING RECORDS WITH MISSING VALUES - The method includes selecting a target record from a dataset, the target record including a missing value, partitioning records of the dataset into at least two groups including co-related data, the partitioned records including records having a value for a same field as the missing value in the target record, predicting the missing value based on a relationship between fields in each of the at least two groups associated with the partitioned records, and setting the missing value of the target record to the predicted value. | 03-26-2015 |
20150089358 | MANAGING A DISPLAY OF CONTENT - Techniques for managing display of content include identifying a document to present to a user on a graphical user interface (GUI); extracting at least one property of the document, the property including metadata associated with the document; determining a correlation between the document and one or more document topics associated with the user; determining an amount of time to display a portion of the document to the user through the GUI based at least in part on the property and the correlation; and displaying the portion of the document to the user through the GUI for the determined amount of time. | 03-26-2015 |