Patent application number | Description | Published |
20090293627 | Pressure-Measuring Cell - A pressure sensor comprises a sensor platform; a measuring membrane, or diaphragm, which is held by the sensor platform, and can have a pressure applied to it and is deformable as a function of pressure; and at least two resistance elements having an A1 | 12-03-2009 |
20100140725 | PRESSURE SENSOR - A piezoresistive pressure sensor is especially suitable for measuring smaller pressures and has a small linearity error. The pressure sensor is manufactured from a BESOI wafer having first and second silicon layers and an oxide layer arranged therebetween. The pressure sensor includes, formed from the first silicon layer of the BESOI wafer, an active layer, in which piezoresistive elements are doped, and, formed from the second silicon layer of the BESOI wafer, a membrane carrier, which externally surrounds a cavity in the second silicon layer, via which a membrane forming region of the active layer and an oxide layer associated therewith are exposed, wherein, in an outer edge of the region of the oxide layer exposed by the cavity, a groove is provided surrounding the region. | 06-10-2010 |
20100281992 | PRESSURE DIFFERENCE MEASURING CELL - A pressure difference measuring cell for registering pressure difference between a first pressure and a second pressure, comprises: an elastic measuring arrangement having at least one measuring membrane, or diaphragm, that comprises silicon; a platform, which is pressure-tightly connected with the elastic measuring arrangement; a first hydraulic path for transferring a first pressure onto a first surface section of the elastic measuring arrangement; and a second hydraulic path for transferring a second pressure onto a second surface section of the elastic measuring arrangement. The first pressure opposes the second pressure, and the elastic deflection of the measuring arrangement is a measure for the difference between the first and the second pressure, wherein the pressure difference measuring cell has additionally at least one hydraulic throttle, characterized in that the at least one hydraulic throttle comprises porous silicon. | 11-11-2010 |
20100308426 | PRESSURE MEASURING DEVICE - A pressure measuring device having a pedestal, an intermediate piece of semiconductor arranged on the pedestal and, connected with the pedestal and arranged on the intermediate piece and connected with the intermediate piece, a semiconductor pressure sensor having a support and a measuring membrane, or diaphragm. The pressure measuring device offers reliable protection of the sensitive measuring membrane, or diaphragm, against mechanical distortions. Provided extending in the interior of the i[ntermediate piece is an annular cavity, which surrounds a first cylindrical section and, pedestal end thereof, a second cylindrical section of the intermediate piece. The second cylindrical section has a greater outer diameter than the first cylindrical section. The cavity is open on an end of the intermediate piece toward the pedestal. The second cylindrical section has an end face facing the pedestal and lying on an end face of the pedestal, for forming a connecting area, via which the intermediate piece is mechanically connected with the pedestal. | 12-09-2010 |
20120279310 | PRESSURE SENSOR, ESPECIALLY PRESSURE DIFFERENCE SENSOR - The pressure sensor of the invention includes at least one platform, at least one measuring membrane | 11-08-2012 |
Patent application number | Description | Published |
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 |
20100077313 | SYSTEM AND METHOD FOR PROVIDING INFORMATION IN A VIRTUAL WORLD - Providing tracking information about events in a virtual world using a computer is presented including: causing the computer to provide a re-usable code portion, the re-usable code portion configured with a unique identifier and an address of an external data storage; causing the computer to configure at least a set of events to be tracked for sending information about tracked events to the external data storage; causing the computer to associate the re-usable code portion with a virtual object to be tracked in the virtual world. In some embodiments, methods are presented wherein the causing the computer to associate the re-usable code portion with the virtual object comprises causing the computer to integrate the re-usable code portion on a source code level into the virtual object.” | 03-25-2010 |
20100174694 | TRANSACTION-CONTROLLED GRAPH PROCESSING AND MANAGEMENT - A method, system, and computer program product for transaction-controlled graph processing and management are provided. The method includes notifying an external component of a database management system (DBMS) controlled transaction including multiple operations, and acquiring a DBMS transaction identifier associated with the transaction at the external component. The method further includes storing the DBMS transaction identifier as an external component transaction identifier, and receiving notification at the external component of events associated with the operations. The method additionally includes monitoring the events for an end-of-transaction operation, and passing notification of the end-of-transaction operation to an external routine. | 07-08-2010 |
20100198845 | SELECTIVE CONSTRUCTION OF DATA SEARCH RESULT PER SEARCH REQUEST SPECIFYING PATH INFORMATION - A system and associated method for selectively constructing a search result for a data requested by a search request specifying path information of a data node comprising the data. A template tree represents a hierarchy of the search result with expandable nodes which initially do not have actual data. A node of the template tree is dynamically expanded by a callback function to have a respective data for the node when the node is traversed for the first time during traversing the template tree according to the path information. The search result is created by expanding all nodes of the template tree that are specified in the path information. The data node in the search result is communicated to an entity that had originated the search request. | 08-05-2010 |
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 |
20120016851 | System and Method for Partially Deferred Index Maintenance - Methods and Apparatus, including computer program products, for maintaining indexes in a database management system. The database management system includes a table having table entries and an index data structure having index data structure entries, the index data structure relating to the table. The index data structure is updated synchronously with an insertion of table entries. The index data structure is maintained unchanged when the table entries are deleted. It is verified by an index-scan on the index data structure that a valid criterion is fulfilled for index data structure entries, and those index data structure entries that pass the valid criterion from the index-scan are returned. | 01-19-2012 |
20120089577 | NONDISRUPTIVE OVERFLOW AVOIDANCE OF TUPLE VALIDITY TIMESTAMPS IN TEMPORAL DATABASE SYSTEMS - A first epoch column pair includes a first global identification (ID) having first maximum value. A second epoch column pair includes a second global identification having second maximum value. The first epoch column pair receives first snapshots, and the first global ID increases with each of the first snapshots. When first global ID reaches first maximum value minus 1, switch to the second epoch column pair. The second epoch column pair receives second snapshots, and second global ID increases with each of the second snapshots. First global ID and first epoch column pair are reset, based on conditions. When second global ID reaches first maximum value minus 1, switch back to first epoch column pair. The first epoch column pair again receives first snapshots, and the first global ID increases with each of the second snapshots. Second global ID and second epoch column pair are reset, based on conditions. | 04-12-2012 |
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 |
20120246132 | MANAGING OVERFLOW ACCESS RECORDS IN A DATABASE - Overflow access records (OARs) are managed in a database system. An OAR is created in response to receiving an update command for a data record and to the updated data record generated by the update command not fitting onto the page in the table where the data record was stored. The OAR that is created includes an index counter that indicates a number of indexes associated with the table. When an OAR is accessed in response to a query command, an identifier of the accessed OAR is replaced in the index by an identifier of a data record pointed to by the OAR, and the index counter in the accessed OAR is changed by a predefined amount. When the index counter reaches a predefined value, the accessed OAR is removed from the table. | 09-27-2012 |
20140085115 | DATA COMPRESSION USING DICTIONARY ENCODING - Embodiments relate to data compression using dictionary encoding. An aspect includes subdividing a table of uncompressed data into a first block and a second block of complete rows. Another aspect includes determining information about a frequency of occurrence of different values for each column of the first block. Another aspect includes selecting a row of the first block to be removed out of the first block using frequency of occurrence-information. Another aspect includes removing the a row out of the first block to form an updated first block and determining information about a frequency of occurrence of different values for each column of the updated first block. Another aspect includes deriving a dictionary containing code-words for encoding the values of the updated first block. Another aspect includes encoding the values of the updated first block based on the code-words. Another aspect includes adding the removed row to the second block. | 03-27-2014 |
20140317141 | SELECTIVE EXPANSION OF A TREE HEIRARCHY - A method and system for expanding a template tree. A received search request includes (i) a search query and (ii) path information specifying at least one path of data nodes of the template tree. The template tree is a hierarchically organized data structure of data nodes. Each specified path in the path information includes a sequence of data nodes of the template tree. The data nodes in each sequence in each specified path are traversed. Each traversed data node that does not have a child node in the template tree is expanded to form in the template tree one or more child nodes corresponding to each expanded data node. Any other data node of the template tree is not expanded. Each formed one or more child nodes is instantiated with data values by retrieving the data values, in accordance with the search query, from at least one data source. | 10-23-2014 |
20150142749 | METHOD AND SYSTEM FOR A SAFE ARCHIVING OF DATA - A method for archiving a predefined portion of a table residing in a database system includes: creating a first backup copy of the portion of the table; assigning to the portion of the table an access state flag; setting the access state flag; using the access state flag for preventing modification of existing backup copies of the portion of the table and for preventing further backup operations on the portion of the table; archiving the portion of the table to a separate system; deleting the content of the portion of the table from the database system and retaining the access state flag in the database system. | 05-21-2015 |
20150278329 | REPLICATION OF A RELATIONAL DATABASE - Embodiments are provided for replicating a relational source database associated with a transaction log of the relational source database. In operation, embodiments may perform receiving a request for replicating data of the relational source database to a relational target database and identifying a first start position within the transaction log. Upon having identified the first start position, embodiments may further perform waiting at least a time period for ensuring that each transaction currently executing on the relational source database at a moment of receiving said request has terminated at an end of said time period. After having waited said time period, embodiments may perform an asynchronously creating of a copy of data of the relational source database to produce a created copy. In turn, embodiments may perform writing the created copy to the relational target database and identifying a repair start position within the transaction log. | 10-01-2015 |
Patent application number | Description | Published |
20100001433 | Method for obtaining high-tenacity aramid yarn - The invention relates to a method for obtaining high-tenacity aramid yarn, wherein the yarn is made of a copolymer obtained from a mixture of monomers comprising DAPBI, an aromatic para-diamine, and an aromatic para-diacid, wherein the yarn is heated in at least two process steps, characterized in that in a first step the yarn is heated at a temperature of 200 to 360° C. at a tension of at least 0.2 cN/dtex, followed by a second step wherein the yarn is heated at a temperature of 370 to 500° C. at a tension of less than 1 cN/dtex. The invention further pertains to a multifilament aramid yarn spun from a sulfuric acid spin dope and having a tenacity of at least 2500 mN/tex. | 01-07-2010 |
20130289234 | METHOD FOR OBTAINING HIGH-TENACITY ARAMID YARN - The invention relates to a method for obtaining high-tenacity aramid yarn, wherein the yarn is made of a copolymer obtained from a mixture of monomers comprising DAPBI, an aromatic para-diamine, and an aromatic para-diacid, wherein the yarn is heated in at least two process steps, characterized in that in a first step the yarn is heated at a temperature of 200 to 360° C. at a tension of at least 0.2 cN/dtex, followed by a second step wherein the yarn is heated at a temperature of 370 to 500° C. at a tension of less than 1 cN/dtex. The invention further pertains to a multifilament aramid yarn spun from a sulfuric acid spin dope and having a tenacity of at least 2500 mN/tex. | 10-31-2013 |