Patent application number | Description | Published |
20140095472 | ADAPTIVE QUERY OPTIMIZATION - Techniques for processing queries are provided. In one approach, an execution plan for a query includes multiple sub-plans, one or more of which are selected at runtime while one or more other sub-plans are not executed during execution of the execution plan. In another approach, data about misestimate is generated and stored persistently for subsequent queries. In another approach, statistics for a database object are generated automatically and efficiently while the database object is created or data items are added thereto. In another approach, a hybrid histogram is created that includes a feature of frequency histograms and a feature of height-balanced histograms. In another approach, computer jobs are executed in such a way to avoid deadlock. In another approach, changes to a database object trigger a hard parse of a query even though an execution plan already exists for the query. | 04-03-2014 |
20140095474 | CREATING AND USING DATA THAT INDICATES MISESTIMATES OF ACTUAL COSTS - Techniques for processing queries are provided. In one approach, an execution plan for a query includes multiple sub-plans, one or more of which are selected at runtime while one or more other sub-plans are not executed during execution of the execution plan. In another approach, data about misestimate is generated and stored persistently for subsequent queries. In another approach, statistics for a database object are generated automatically and efficiently while the database object is created or data items are added thereto. In another approach, a hybrid histogram is created that includes a feature of frequency histograms and a feature of height-balanced histograms. In another approach, computer jobs are executed in such a way to avoid deadlock. In another approach, changes to a database object trigger a hard parse of a query even though an execution plan already exists for the query. | 04-03-2014 |
Patent application number | Description | Published |
20140280023 | ADAPTIVE SELECTION OF A DISTRIBUTION METHOD DURING EXECUTION OF PARALLEL JOIN OPERATIONS - A method, system, and computer program product for high-performance database systems. The method commences by estimating, during a compile phase, a statically-calculated system cost of performing parallel join operations over two relations, then selecting, during the compile phase, a first distribution method to perform the parallel join operations. Instructions (e.g., table partitioning) are communicated to two or more execution units for execution of the parallel join operations, and during execution, various measurements are taken pertaining to the performance of a first portion of the parallel join operations using the selected first distribution method. Then, responsive to the measurements a second distribution method is selected and corresponding instructions are communicated to the two or more execution units. The parallel join operations continue, now using the second distribution method. | 09-18-2014 |
20150234894 | QUERY PLANS FOR ANALYTIC SQL CONSTRUCTS - A system and method for managing data storage and data access with querying data in a distributed system without buffering the results on intermediate operations in disk storage. | 08-20-2015 |
20150234896 | ADAPTIVE DISTRIBUTION METHOD FOR HASH OPERATIONS - A method, apparatus, and system for join operations of a plurality of relations that are distributed over a plurality of storage locations over a network of computing components. | 08-20-2015 |
Patent application number | Description | Published |
20120197822 | SYSTEM AND METHOD FOR USING CLUSTER LEVEL QUORUM TO PREVENT SPLIT BRAIN SCENARIO IN A DATA GRID CLUSTER - A system and method is described for use with a data grid cluster, which uses cluster quorum to prevent split brain scenario. The data grid cluster includes a plurality of cluster nodes, each of which runs a cluster service. Each cluster service collects and maintains statistics regarding communication flow between its cluster node and the other cluster nodes in the data grid cluster. The statistics are used to determine a status associated with other cluster nodes in the data grid cluster whenever a disconnect event happens. The data grid cluster is associated with a quorum policy, which is defined in a cache configuration file, and which specifies a time period that a cluster node will wait before making a decision on whether or not to evict one or more cluster nodes from the data grid cluster. | 08-02-2012 |
20120198055 | SYSTEM AND METHOD FOR USE WITH A DATA GRID CLUSTER TO SUPPORT DEATH DETECTION - A system and method is described for use with a data grid cluster to support death detection. A network ring is formed by connecting a plurality of process nodes in the data grid, wherein each node in the network ring watches another node. A death of a first process node in the network ring can be detected by a second process node, when the second process node notices that its connection to the first process node has closed. The first process node then informs other process cluster nodes in the network ring that the first node is dead. In accordance with an embodiment, machine level death detection can also be supported in the data grid cluster by using an Internet Protocol (IP) monitor. | 08-02-2012 |
20120198455 | SYSTEM AND METHOD FOR SUPPORTING SERVICE LEVEL QUORUM IN A DATA GRID CLUSTER - A system and method is described for use with a data grid cluster, for supporting service level quorum in the data grid cluster. The data grid cluster includes a plurality of cluster nodes that support performing at least one service action. A quorum policy, defined in a cache configuration file associated with the data grid cluster, can specify a minimum number of service members that are required in the data grid cluster for performing the service action. The data grid cluster uses the quorum policy to determine whether the service action is allowed to be performed, based on a present state of the plurality of cluster nodes in the data grid cluster. | 08-02-2012 |
20130073538 | QUERY EXPLAIN PLAN IN A DISTRIBUTED DATA MANAGEMENT SYSTEM - A query explain plan is described for use with a distributed data system in order to help developers and IT experts to detect bottlenecks and to determine which queries are to blame for a slow running system. In accordance with an embodiment, the distributed data grid utilizes a facility to provide a distributed explain plan. This distributed explain plan provides visibility into how a query was answered by each node in the cluster. For example, one node may have applied the filters of the query in one sequence, while another node may have used a different sequence. Additionally, the distributed query explain plan can provide execution tracing, rendering information about the execution time of each step, total execution time and the like. | 03-21-2013 |
20130074083 | SYSTEM AND METHOD FOR HANDLING STORAGE EVENTS IN A DISTRIBUTED DATA GRID - A system and method can handle storage events in a distributed data grid. The distributed data grid cluster includes a plurality of cluster nodes storing data partitions distributed throughout the cluster, each cluster node being responsible for a set of partitions. A service thread, executing on at least one of said cluster nodes in the distributed data grid, is responsible for handling one or more storage events. The service thread can use a worker thread to accomplish synchronous event handling without blocking the service thread. | 03-21-2013 |
20130074101 | SYSTEM AND METHOD FOR SUPPORTING A SERVER-SIDE EVENT MODEL IN A DISTRIBUTED DATA GRID - A system and method can provide a server-side event model in a distributed data grid with a plurality of cluster nodes storing data partitions distributed throughout the cluster, each cluster node being responsible for a set of partitions. The system can map one or more event interceptors to an event dispatcher placed in the cluster. The one or more event interceptors can handle at least one event dispatched from the event dispatcher, wherein the at least one event is associated with an operation in the distributed data grid. The system can defer completion of the operation in the distributed data grid pending completion of the handling of the at least one event by said one or more event interceptors. | 03-21-2013 |
20140108347 | SYSTEM AND METHOD FOR PROVIDING PARTITION PERSISTENT STATE CONSISTENCY IN A DISTRIBUTED DATA GRID - A system and method can provide partition persistent state consistency in a distributed data grid. The distributed data grid can provide a plurality of copies of a partition on a plurality of cluster nodes in the distributed data grid, wherein the plurality of cluster nodes includes a primary owner node and one or more backup nodes for the partition. The primary owner node can propagate one or more modifications of the partition from the primary owner node to the one or more backup nodes. The distributed data grid can ensure consistency among the plurality copies of the partition on the plurality of cluster nodes in the distributed data grid. | 04-17-2014 |
20140108358 | SYSTEM AND METHOD FOR SUPPORTING TRANSIENT PARTITION CONSISTENCY IN A DISTRIBUTED DATA GRID - A system and method can support transient partition consistency in a distributed data grid. A cluster node in the distributed data grid can maintain a storage data structure and an index data structure. The storage data structure can store data in one or more partitions maintained on the cluster node, and the index data structure contains a plurality of indexes, wherein each index supports indexing at least one data grid operation on the one or more partitions. Furthermore, the distributed data grid ensures consistency between the storage data structure and the index data structure for the data stored in the one or more partitions maintained on the cluster node | 04-17-2014 |
20140108532 | SYSTEM AND METHOD FOR SUPPORTING GUARANTEED MULTI-POINT DELIVERY IN A DISTRIBUTED DATA GRID - A system and method can support guaranteed multi-point message delivery in a distributed data grid. A messaging facility in the distributed data grid can receive an incoming message that is adaptive to be delivered to a plurality of nodes in the distributed data grid. The messaging facility can deliver the incoming message to the plurality of nodes according to an order in a list. Furthermore, a node in the plurality of nodes operates to skip a next node in the list to deliver the incoming message, when the next node is dead or unavailable. | 04-17-2014 |
20150186181 | SYSTEM AND METHOD FOR SUPPORTING FLOW CONTROL IN A DISTRIBUTED DATA GRID - Systems and methods can support flow control in a distributed data grid. The distributed data grid includes a plurality of server nodes that are interconnected with one or more communication channels. The distributed data grid can provide a flow control mechanism, which controls the execution of the tasks in an underlying layer in the distributed data grid. Then, the system allows the client to interact with the flow control mechanism in the distributed data grid, and use the flow control mechanism to configure and execute one or more tasks that are received from the client. | 07-02-2015 |
20150186489 | SYSTEM AND METHOD FOR SUPPORTING ASYNCHRONOUS INVOCATION IN A DISTRIBUTED DATA GRID - Systems and methods can support asynchronous invocation in a distributed data grid with a plurality of server nodes. The system allows a server node in the distributed data grid to receive one or more tasks from a client, wherein said one or more tasks are associated with a unit-of-order. Furthermore, the system can execute said one or more tasks on one or more said server nodes in the distributed data grid, based on the unit-of-order that is guaranteed by the distributed data grid. | 07-02-2015 |
Patent application number | Description | Published |
20100262646 | OBTAINING INSTRUMENTATION DATA - An apparatus described herein includes a request receiver component that receives a request for application data over a network from a client computing device. The apparatus also includes an instrumentation component that causes instrumentation logic to be transmitted to the client computing device responsive to receipt of the request for the application data. The instrumentation logic is configured to cause the client computing device to analyze a cookie to determine whether to capture instrumentation data pertaining to the client and, if it is determined that instrumentation data is desirably captured. The instrumentation logic is also configured to cause the client computing device to capture quantitative instrumentation data pertaining to the requested application data and cause the client computing device to transmit the quantitative instrumentation data over the network to a data repository. | 10-14-2010 |
20110202608 | EMAIL SYSTEM LATENCIES AND BANDWIDTHS - One or more techniques and/or systems are disclosed for measuring a client's network latency and the client's connection bandwidth. A network latency is determined by adding a randomly generated variable to a browser query string for a get request for a test file on a remote server, where the test file fits in one response packet. A first amount of time it takes for the test file to be received by the browser from when the get request is sent is determined and used to determine the network latency between the client and remote server. A connection bandwidth is determined by determining a second amount of time it takes for an email response to be received by the browser for an email request from the browser to a remote server. The size of the response is identified and combined with the second time to determine the connection bandwidth. | 08-18-2011 |
20120259969 | CACHED DATA DETECTION - A service assigns session identifiers to usage sessions of a program on a computing device, and maintains records in a log of received page requests and associated session identifiers, as well as received cached data detection requests and associated session identifiers. This log can be used to determine how many usage sessions existed over a particular amount of time, and how many of the usage sessions used data from a local cache rather than from the service. The service also returns, in response to a received cached data detection request, a response including an indication that the response is from the service. The program can determine that the response was received from the service if the indication is included in the response, and that the response was received from a local cache of the computing device if the indication is not included in the response. | 10-11-2012 |
20150180996 | CACHED DATA DETECTION - A service assigns session identifiers to usage sessions of a program on a computing device, and maintains records in a log of received page requests and associated session identifiers, as well as received cached data detection requests and associated session identifiers. This log can be used to determine how many usage sessions existed over a particular amount of time, and how many of the usage sessions used data from a local cache rather than from the service. The service also returns, in response to a received cached data detection request, a response including an indication that the response is from the service. The program can determine that the response was received from the service if the indication is included in the response, and that the response was received from a local cache of the computing device if the indication is not included in the response. | 06-25-2015 |