Patent application number | Description | Published |
20120286569 | CIRCUIT SYSTEM FOR A VEHICLE ELECTRICAL SYSTEM - A circuit system for a vehicle electrical system, including a base vehicle electrical system having an energy store, a vehicle power supply system having an additional energy store, and a DC/DC converter. The energy store and the additional energy store are connected in series, and the DC/DC converter is provided for coupling between the base vehicle electrical system and the vehicle power supply system. A method for operating a vehicle electrical system is also described. | 11-15-2012 |
20130154582 | MULTIPHASE CONVERTER COMPRISING MAGNETICALLY COUPLED PHASES - Disclosed is a multiphase converter comprising multiple electric phases ( | 06-20-2013 |
20130162225 | MULTIPHASE CONVERTER COMPRISING MAGNETICALLY COUPLED PHASES - Disclosed is a multiphase converter comprising multiple phases ( | 06-27-2013 |
20140117925 | APPARATUS AND METHOD FOR CONNECTING MULTIPLE-VOLTAGE ONBAORD POWER SUPPLY SYSTEMS - An apparatus and a method are proposed for connecting multiple-voltage onboard power supply systems, wherein the apparatus comprises at least one DC/DC voltage converter ( | 05-01-2014 |
20150016150 | MULTI-PHASE CONVERTER - Disclosed is a multi-phase converter comprising a plurality of electric phases, each of which can be triggered by a switching means. At least one coupling means ( | 01-15-2015 |
20150028844 | COUPLING DEVICE FOR A MULTI-PHASE CONVERTER - The invention relates to a coupling device ( | 01-29-2015 |
20150288169 | PROTECTIVE CIRCUIT ASSEMBLAGE FOR A MULTI-VOLTAGE ELECTRICAL SYSTEM - A protective circuit assemblage for a multi-voltage electrical system includes: a DC voltage converter provided in the region of the transition between a high-voltage loop and a low-voltage loop; and at least one switch respectively provided in each of the high-voltage loop and the low-voltage loop. | 10-08-2015 |
Patent application number | Description | Published |
20080235183 | Workload Aware Checking of Database Reorganization - The present solution addresses the need to carry out reorganization of a database storage. A statistics-based reorganization check procedure is performed on at least first database tables and indexes, resulting in a preliminary reorganization recommendation. Information on workload on tables and indexes of said database storage is received. Based on the information on workload and the preliminary reorganization recommendation, it is decided whether to carry out reorganization of the database storage in accordance with the preliminary reorganization recommendation. | 09-25-2008 |
20090182766 | AVOIDING DATABASE RELATED JOINS WITH SPECIALIZED INDEX STRUCTURES - Provided is a solution for storing data, the data comprising a set of tables, each table comprising a set of columns, each column comprising a set of values, each value being one or more data types. In the solution, a binary tree can be created for each of the data types. Each binary tree can comprise a set of nodes. A set of arrays can be associated with each node of the binary tree. The array associated with each node of each binary tree can correspond to one of the columns that comprises the value of the data type represented by the node of the binary tree. Each array can indicate at least one table row and column from the plurality of tables in which the value of the data type represented by the node of the binary tree occurs. | 07-16-2009 |
20090210445 | METHOD AND SYSTEM FOR OPTIMIZING DATA ACCESS IN A DATABASE USING MULTI-CLASS OBJECTS - Methods for optimizing data access in a row-oriented relational database containing data sets having attributes using a computer are presented the method including: causing a computer to analyze a database workload to determine an access frequency for each of the attributes; causing the computer to assign each of the attributes to a priority classes corresponding with the access frequency, where the priority classes include a higher priority class and a lower priority class, and where a higher priority class corresponds with a higher access frequency and a lower priority class corresponds with a lower access frequency; causing the computer to store the attributes in accordance with the classes, where the attributes assigned to the higher priority class are stored in a high priority storage medium, and where the attributes assigned to a lower priority class are stored in a low priority storage medium. | 08-20-2009 |
20100250517 | SYSTEM AND METHOD FOR PARALLEL COMPUTATION OF FREQUENCY HISTOGRAMS ON JOINED TABLES - According to one embodiment of the present invention, a method for the parallel computation of frequency histograms in joined tables is provided. The method includes reading data in a table row-by-row from a database system using a coordinator unit and distributing each read row to separate worker units. Each worker unit computes a partial frequency histogram for each column in the table in parallel. The partial histograms from the worker units are then merged and the coordinator unit sends the merged frequency histograms to the worker units. | 09-30-2010 |
20110208754 | Organization of Data Within a Database - A computer implemented method is provided for processing data representing a data entity having sub entities. The method includes analyzing queries to the data entity for deriving information about sets of the sub entities frequently queried together, and grouping the sub entities to a number of banks, each bank having a maximum width, based on the information about sets of sub entities frequently queried together, in order to reduce an average number of banks to be accessed for data retrieval. | 08-25-2011 |
20120117064 | ADAPTIVE CELL-SPECIFIC DICTIONARIES FOR FREQUENCY-PARTITIONED MULTI-DIMENSIONAL DATA - A cell-specific dictionary is applied adaptively to adequate cells, where the cell-specific dictionary subsequently optimizes the handling of frequency-partitioned multi-dimensional data. This includes improved data partitioning with super cells or adjusting resulting cells by sub-dividing very large cells and merging multiple small cells, both of which avoid the highly skewed data distribution in cells and improve the query processing. In addition, more efficient encoding is taught within a cell in case the distinct values that actually appear in that cell are much smaller than the size of the column dictionary. | 05-10-2012 |
20120143913 | Encoding Data Stored in a Column-Oriented Manner - Data stored in a column-oriented manner is encoded using a data mining algorithm for finding column patterns among a set of data tuples, where each data tuple contains a set of columns, and the data mining algorithm treats all columns and all column combinations and column ordering similarly or in the same manner when looking for column patterns. Column values are ordered occurring in the column patterns based on their frequencies into a prefix tree, where the prefix tree defines a pattern order. The data tuples are sorted according to the pattern order, resulting in sorted data tuples, and columns of the sorted data tuples are encoded using run-length encoding. | 06-07-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 |
20130033389 | DATA VALUE OCCURRENCE INFORMATION FOR DATA COMPRESSION - A method for generating occurrence data of data values for enabling encoding of a data set includes determining occurrences of data values in a first data batch and determining occurrence count information for a first number of most frequent data values in the first data batch, the occurrence count information identifying the most frequent data values and their occurrence counts. The method also includes generating for rest of the data values in the first data batch at least a first histogram having a second number of buckets and merging the occurrence count information of the first data batch with occurrence count information of a second data batch. The method further includes merging the first histogram of the first data batch to a merged histogram corresponding to the second data batch and processing a next data batch as a first data batch until the data set to be encoded is processed. | 02-07-2013 |
20140095441 | Archiving Data in Database Management Systems - According to one embodiment of the present invention, at least a portion of data from a first processing system is archived onto a second processing system based on partitions of the data. A query received at the first processing system is processed at the second processing system to retrieve archived data satisfying the received query in response to determining at the first processing system that the received query encompasses archived data. Embodiments of the present invention further include methods, systems, and computer program products for archiving and accessing data in substantially the same manner described above. | 04-03-2014 |
20140095443 | Archiving Data in Database Management Systems - At least a portion of data from a first processing system is archived onto a second processing system based on partitions of the data. A query received at the first processing system is processed at the second processing system to retrieve archived data satisfying the received query in response to determining at the first processing system that the received query encompasses archived data. Embodiments of the present invention further include methods, systems, and computer program products for archiving and accessing data in substantially the same manner described above. | 04-03-2014 |
20160004740 | ORGANIZATION OF DATA WITHIN A DATABASE - A computer implemented method is provided for processing data representing a data entity having sub entities. The method includes analyzing queries to the data entity for deriving information about sets of the sub entities frequently queried together, and grouping the sub entities to a number of banks, each bank having a maximum width, based on the information about sets of sub entities frequently queried together, in order to reduce an average number of banks to be accessed for data retrieval. | 01-07-2016 |