Patent application number | Description | Published |
20100131490 | MODULAR QUERY OPTIMIZER - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for modular query optimizer. In one aspect, a method includes selecting one or more projections from a set of projections for each table in a database query wherein each of the selected projections for the table has leads to an estimated lower execution cost for the query as compared to non-selected projections; generating join orders for the query based on data distribution of one or more of the selected projections among sites in a computer network wherein the join orders reflect different combinations of data distribution operations applied to the output of one or more of the query's joins; and selecting a join order from the join orders based on evaluation of the join orders using a cost model. | 05-27-2010 |
20120246147 | MODULAR QUERY OPTIMIZER - Computer programs encoded on a computer storage medium provide for a modular query optimizer. In one aspect, a computer program product includes selecting one or more projections from a set of projections for each table in a database query wherein each of the selected projections for the table has leads to an estimated lower execution cost for the query as compared to non-selected projections; generating join orders for the query based on data distribution of one or more of the selected projections among sites in a computer network wherein the join orders reflect different combinations of data distribution operations applied to the output of one or more of the query's joins; and selecting a join order from the join orders based on evaluation of the join orders using a cost model. | 09-27-2012 |
20120317094 | Sideways Information Passing - Methods, systems and program products for query optimization using sideways information passing. In one implementation, a join clause in a query is identified that specifies an outer table of tuples to be joined with an inner table, the outer table having one or more attributes, and each of the attributes of the outer table having values stored in an attribute file that is distinct from attribute files in which the values of other attributes are stored. A plan for the query is created which, when executed, causes selection of a subset of tuples of the outer table to serve as input to the join clause in place of the outer table based on one or more predicates applied to the inner table. | 12-13-2012 |
Patent application number | Description | Published |
20120290559 | JOIN ORDER RESTRICTIONS - A query that is submitted to a database is analyzed so as to determine a join order restriction. The join order restriction is associated with a join between two tables of a plurality of tables of the database that participate in the query. The join order restriction constrains its associated join to be executed prior to another join of the query. At least one join plan is generated, the join plan being constrained by the join order restriction. Different join plans include different join orders. A join plan is selected from among the join plans for execution of the query. | 11-15-2012 |
20120290590 | CONSTRUCTING A PROJECTION FOR STORING DATA - A method for constructing a projection for storing data on a storage device may include causing a processor to extract characteristics of expected output of a query on the data, and to construct a projection for the data based on the extracted characteristics. | 11-15-2012 |
20120290615 | SWITCHING ALGORITHMS DURING A RUN TIME COMPUTATION - A system and method for switching algorithms during a run time computation, the method including configuring hardware of a networked cluster of processing elements, each processing element with a memory hierarchy, to perform a first-tier algorithm on input data, the input data having cardinality and stored on one or a plurality of nodes in the networked cluster. Performing at least a portion of a second-tier algorithm and determining whether to complete the second-tier algorithm and perform a third or subsequent tier algorithm, the determination dependent on cardinality. Automatically passing data to an output if the cardinality of the second-tier algorithm is greater than a threshold cardinality, and passing the data back to the second-tier algorithm or to one or a plurality of subsequent algorithms, in response to the cardinality being less than the threshold, and automatically passing the data to an output at the completion of the data processing. | 11-15-2012 |
20130246433 | Data-Record Pattern Searching - A record-pattern expression of a record pattern of data records is translated to a character-pattern expression of a character pattern. A data-record series of data records is converted to a character string in which each character in the character string corresponds to a respective data record in the data-record series. Pattern instances of the character pattern in the character string are searched to identify ordinal character positions in the character string of characters in the character pattern instances. Data records at ordinal record positions in the record series of data records corresponding to the ordinal character positions are reported. | 09-19-2013 |
20130290287 | EXECUTING USER-DEFINED FUNCTION ON A PLURALITY OF DATABASE TUPLES - A method for executing a user-defined function on a plurality of input database tuples. The method may include causing a processor to invoke the function once; and to compute results of the function for the plurality of database tuples. | 10-31-2013 |
20150088865 | QUERY PROCESSING - A method for query processing includes receiving a query, and determining a query type by determining if the query is a structured query language (SQL) query including multiple distinct aggregates (MDAs), or a SQL query including cube, rollup or grouping sets operations. Based on the determination, the method includes processing the query to generate an output, and performing a predetermined number of maximum group by operations on the output based on the query type to generate a response to the query. | 03-26-2015 |
20150088939 | MERGING DATA FROM A SOURCE LOCATION INTO A TARGET LOCATION - In an example, data from a source location is merged into a target location containing existing data, in which both the source location and the target location contain tuples of data. For each tuple in the source location, during a single operation, a determination is made as to whether there is a matched tuple in the target location that satisfies a predetermined condition. For each matched tuple that satisfies the predetermined condition, the matched tuple in the target location is updated with a count value that is equal to a count of the matched tuple in the source location and the target location. In addition, for each tuple that does not have a matched tuple that satisfies the predetermined condition, the unmatched tuple is inserted into the target location. | 03-26-2015 |
20150178342 | USER-DEFINED LOADING OF DATA ONTO A DATABASE - As part of managing the loading of data from a source onto a database, according to an example, an interface through which a user is to define logic related to the loading of the data onto the database is provided. The user-defined logic pertains to at least one of a user-defined location identification of the source, a user-defined filter to be applied on the data, and a user-defined parsing operation to be performed on the data to convert the data into an appropriate format for the database. In addition, the user-defined logic is received and the user-defined logic is implemented to load the data onto the database. | 06-25-2015 |
Patent application number | Description | Published |
20140071837 | METHOD AND APPARATUS FOR WIRELESS COMMUNICATION IN A MESH NETWORK WITH CENTRAL CONTROL OF COMMUNICATION RELATIONSHIPS - A method and apparatus for communication in a wireless sensor network. In one embodiment, one or more routers in a network may be available for communication with one or more star nodes at a randomized time and/or frequency. A connectivity assessment, which may be performed at several different frequencies and/or times, may be performed to evaluate the quality of communications between devices in the network. Primary and secondary communication relationships may be formed between devices to provide for system redundancy. One or more proxies may be maintained where each proxy includes a status of one or more devices in the network, e.g., one or more star nodes or routers. Proxies may be used to handle information requests and/or status change requests, e.g., a proxy may be requested to change a communication relationship between devices in the network and may generate command signals to cause the corresponding devices to make the change. | 03-13-2014 |
20140286301 | METHOD AND APPARATUS FOR WIRELESS COMMUNICATION IN A MESH NETWORK USING FREQUENCY SCHEDULE - A method and apparatus for communication in a wireless sensor network. In one embodiment, one or more routers in a network may be available for communication with one or more star nodes at a randomized time and/or frequency. A connectivity assessment, which may be performed at several different frequencies and/or times, may be performed to evaluate the quality of communications between devices in the network. Primary and secondary communication relationships may be formed between devices to provide for system redundancy. One or more proxies may be maintained where each proxy includes a status of one or more devices in the network, e.g., one or more star nodes or routers. Proxies may be used to handle information requests and/or status change requests, e.g., a proxy may be requested to change a communication relationship between devices in the network and may generate command signals to cause the corresponding devices to make the change. | 09-25-2014 |
Patent application number | Description | Published |
20160006579 | MERGING PCP FLOWS AS THEY ARE ASSIGNED TO A SINGLE VIRTUAL CHANNEL - A Network Flow Processor (NFP) integrated circuit receives, via each of a first plurality of physical MAC ports, one or more PCP (Priority Code Point) flows. The NFP also maintains, for each of a second plurality of virtual channels, a linked list of buffers. There is one port enqueue engine for each physical MAC port. For each PCP flow received via the physical MAC port associated with a port enqueue engine, the port enqueue engine causes frame data of the flow to be loaded into one particular linked list of buffers. Each port enqueue engine has a lookup table circuit that is configurable to cause multiple PCP flows to be merged so that the frame data for the multiple flows is all assigned to the same one virtual channel. Due to the PCP flow merging, the second number can be smaller than the first number multiplied by eight. | 01-07-2016 |
20160006580 | REORDERING PCP FLOWS AS THEY ARE ASSIGNED TO VIRTUAL CHANNELS - A Network Flow Processor (NFP) integrated circuit receives, via each of a plurality of physical MAC ports, PCP (Priority Code Point) flows. The NFP also maintains, for each of a plurality of virtual channels, a linked list of buffers. There is one port enqueue engine for each physical MAC port. For each PCP flow received via the physical MAC port associated with a port enqueue engine, the engine causes frame data of the flow to be loaded into one particular linked list of buffers. Each engine has a lookup table circuit that is configurable so that the relative priorities of the PCP flows are reordered as the PCP flows are assigned to virtual channels. A PCP flow with a higher PCP value can be assigned to a lower priority virtual channel, whereas a PCP flow with a lower PCP value can be assigned to a higher priority virtual channel. | 01-07-2016 |
20160006665 | HIGH-SPEED DEQUEUING OF BUFFER IDS IN FRAME STORING SYSTEM - Incoming frame data is stored in a plurality of dual linked lists of buffers in a pipelined memory. The dual linked lists of buffers are maintained by a link manager. The link manager maintains, for each dual linked list of buffers, a first head pointer, a second head pointer, a first tail pointer, a second tail pointer, a head pointer active bit, and a tail pointer active bit. The first head and tail pointers are used to maintain the first linked list of the dual linked list. The second head and tail pointers are used to maintain the second linked list of the dual linked list. Due to the pipelined nature of the memory, the dual linked list system can be popped to supply dequeued values at a sustained rate of more than one value per the read access latency time of the pipelined memory. | 01-07-2016 |
20160006677 | INVERSE PCP FLOW REMAPPING FOR PFC PAUSE FRAME GENERATION - An overflow threshold value is stored for each of a plurality of virtual channels. A link manager maintains, for each virtual channel, a buffer count. If the buffer count for a virtual channel is detected to exceed the overflow threshold value for a virtual channel whose originating PCP flows were merged, then a PFC (Priority Flow Control) pause frame is generated where multiple ones of the priority class enable bits are set to indicate that multiple PCP flows should be paused. For the particular virtual channel that is overloaded, an Inverse PCP Remap LUT (IPRLUT) circuit performs inverse PCP mapping, including merging and/or reordering mapping, and outputs an indication of each of those PCP flows that is associated with the overloaded virtual channel. Associated physical MAC port circuitry uses this information to generate the PFC pause frame so that the appropriate multiple enable bits are set in the pause frame. | 01-07-2016 |
Patent application number | Description | Published |
20110015080 | Solution-based methods for RNA expression profiling - The present invention is directed to novel high-throughput, low-cost, and flexible solution-based methods for RNA expression profiling, including expression of microRNAs and mRNAs. | 01-20-2011 |
20110223171 | Methods and Compositions for the Diagnosis and Treatment of Cyclin A-1 Associated Conditions - The present invention relates to compositions and methods for cancer therapeutics. In particular, the present invention provides compositions and methods for inhibiting cancer metastasis by inhibiting cyclin A1. | 09-15-2011 |
20110263693 | CELASTROL, GEDUNIN, AND DERIVATIVES THEREOF AS HSP90 INHIBITORS - Based on the discovery that celastrol and gedunin are Hsp90 inhibitors, the present invention provides novel inhibitors of Hsp90. and pharmaceutically acceptable salts, derivatives, and compositions thereof. The invention provides two classes of compounds. One class includes celastrol and its derivatives. The other class includes gedunin and its derivatives. The present invention further provides methods for treating disorders wherein Hsρ90 inhibition is desired (e.g., proliferative diseases, cancer, inflammatory diseases, fungal infections, etc.) comprising administering a therapeutically effective amount of an inventive compound to a subject in need thereof. Celastrol, gedunin, and derivatives thereof are particularly useful in the treatment of prostate cancer, breast cancer, ovarian cancer, lung cancer, and leukemia. | 10-27-2011 |
20130090254 | GENE-EXPRESSION PROFILING WITH REDUCED NUMBERS OF TRANSCRIPT MEASUREMENTS - The present invention provides compositions and methods for making and using a transcriptome-wide gene-expression profiling platform that measures the expression levels of only a select subset of the total number of transcripts. Because gene expression is believed to be highly correlated, direct measurement of a small number (for example, 1,000) of appropriately-selected transcripts allows the expression levels of the remainder to be inferred. The present invention, therefore, has the potential to reduce the cost and increase the throughput of full-transcriptome gene-expression profiling relative to the well-known conventional approaches that require all transcripts to be measured. | 04-11-2013 |
20130225432 | SOLUTION-BASED METHODS FOR RNA EXPRESSION PROFILING - The present invention is directed to novel high-throughput, low-cost, and flexible solution-based methods for RNA expression profiling, including expression of microRNAs and mRNAs. | 08-29-2013 |
Patent application number | Description | Published |
20100204231 | AMINO-THIAZOLYL-PYRIMIDINE DERIVATIVES AND THEIR USE FOR THE TREATMENT OF CANCER - The present invention relates to compounds of Formula (I): and to their pharmaceutical compositions, and to their methods of use. These compounds provide a treatment for myeloproliferative disorders and cancer. | 08-12-2010 |
20100204246 | 5-AMINOPYRAZOL-3-YL-3H-IMIDAZO (4,5-B) PYRIDINE DERIVATIVES AND THEIR USE FOR THE TREATMENT OF CANCER - The present invention relates to compounds of Formula (I) and to their pharmaceutical compositions, and to their methods of use. These novel compounds provide a treatment for myeloproliferative disorders and cancer. | 08-12-2010 |
20100324040 | 9-(PYRAZOL-3-YL)-9H-PURINE-2-AMINE AND 3-(PYRAZOL-3-YL) -3H-IMIDAZO[4,5-B] PYRIDIN-5- AMINE DERIVATIVES AND THEIR USE FOR THE TREATMENT OF CANCER - The present invention relates to compounds of Formula (I): and to their pharmaceutical compositions, and to their methods of use. These compounds provide a treatment for myeloproliferative disorders and cancer. | 12-23-2010 |
20110218182 | CHEMICAL COMPOUNDS 251 - The invention relates to chemical compounds of formula (I), and salts thereof. In some embodiments, the invention relates to inhibitors or modulators of PIM-1 and/or PIM-2, and/or PIM-3 protein kinase activity or enzyme function. In still further embodiments, the invention relates to pharmaceutical compositions comprising compounds disclosed herein, and their use in the prevention and treatment of PIM kinase related conditions and diseases, preferably cancer. | 09-08-2011 |
20120122892 | CHEMICAL COMPOUNDS - This invention relates to novel compounds having the formula (I): | 05-17-2012 |
20130090358 | PYRAZOLYLAMINOPYRIDINE DERIVATIVES USEFUL AS KINASE INHIBITORS - This invention relates to novel compounds having the formula (I): | 04-11-2013 |
20140155394 | Chemical Compounds - 759 - The present invention relates to compounds of Formula (I): | 06-05-2014 |