Patent application number | Description | Published |
20080294676 | Compression of tables based on occurrence of values - Methods and apparatus, including computer program products, for compression of tables based on occurrence of values. In general, a number representing an amount of occurrences of a frequently occurring value in a group of adjacent rows of a column is generated, a vector representing whether the frequently occurring value exists in a row of the column is generated, and the number and the vector are stored to enable searches of the data represented by the number and the vector. The vector may omit a portion representing the group of adjacent rows. The values may be dictionary-based compression values representing business data such as business objects. The compression may be performed in-memory, in parallel, to improve memory utilization, network bandwidth consumption, and processing performance. | 11-27-2008 |
20080294863 | Block compression of tables with repeated values - Methods and apparatus, including computer program products, for block compression of tables with repeated values. In general, value identifiers representing a compressed column of data may be sorted to render repeated values contiguous, and block dictionaries may be generated. A block dictionary may be generated for each block of value identifiers. Each block dictionary may include a list of block identifiers, where each block identifier is associated with a value identifier and there is a block identifier for each unique value in a block. Blocks may have standard sizes and block dictionaries may be reused for multiple blocks. | 11-27-2008 |
20100299316 | BLOCK COMPRESSION OF TABLES WITH REPEATED VALUES - Methods and apparatus, including computer program products, for block compression of tables with repeated values. In general, value identifiers representing a compressed column of data may be sorted to render repeated values contiguous, and block dictionaries may be generated. A block dictionary may be generated for each block of value identifiers. Each block dictionary may include a list of block identifiers, where each block identifier is associated with a value identifier and there is a block identifier for each unique value in a block. Blocks may have standard sizes and block dictionaries may be reused for multiple blocks. | 11-25-2010 |
20100328115 | DICTIONARY-BASED ORDER-PRESERVING STRING COMPRESSION FOR MAIN MEMORY COLUMN STORES - Methods and systems are described that involve usage of dictionaries for compressing a large set of variable-length string values with fixed-length integer keys in column stores. The dictionary supports updates (e.g., inserts of new string values) without changing codes for existing values. Furthermore, a shared-leaves approach is described for indexing such a dictionary that compresses the dictionary itself while offering access paths for encoding and decoding. | 12-30-2010 |
20110282914 | INTEGRATED APPLICATION SERVER AND DATA SERVER PROCESSES WITH MATCHING DATA FORMATS - In one embodiment, the present invention includes a computer-implemented method comprising storing data in an application using an application custom data type and application custom data structure. The data is stored in a database using the application custom data type and the application custom data structure. In one embodiment, a request is sent to access the data from the application to the database. The data is retrieved from the database in response to the request in the application custom data type and the application custom data structure. In one embodiment, the data is sent from the database to a shared memory in the application custom data type and the application custom data structure and the data is retrieved by the application from the shared memory in the application custom data type and the application custom data structure. | 11-17-2011 |
20110313980 | COMPRESSION OF TABLES BASED ON OCCURRENCE OF VALUES - Methods and apparatus, including computer program products, for compression of tables based on occurrence of values. In general, a number representing an amount of occurrences of a frequently occurring value in a group of adjacent rows of a column is generated, a vector representing whether the frequently occurring value exists in a row of the column is generated, and the number and the vector are stored to enable searches of the data represented by the number and the vector. The vector may omit a portion representing the group of adjacent rows. The values may be dictionary-based compression values representing business data such as business objects. The compression may be performed in-memory, in parallel, to improve memory utilization, network bandwidth consumption, and processing performance. | 12-22-2011 |
20120005190 | PERFORMING COMPLEX OPERATIONS IN A DATABASE USING A SEMANTIC LAYER - The present invention includes a database with a semantic layer for performing standard SQL and complex operations custom to one or more application. In one embodiment the present invention includes receiving a data request from an application in a database, the data request specifying standard SQL operations and custom application operations to be performed for said application. The data request is processed in a semantic layer of the database. The semantic layer processes the standard SQL operations and the custom application operations and generates a logical execution plan comprising the standard SQL operations and the custom application operations. The logical execution plan is converted into a physical execution plan, which is executed by the database to generate a data result. The data result may be sent back to the application. | 01-05-2012 |
20120011133 | Interdistinct Operator - A computer-implemented system and method for performing distinct operations on multiple tables of shared memory of parallel computing environments are disclosed. A distinct operation is executed on each table of a plurality of tables, each distinct operation eliminating duplicate data from each table, the executing creating a hierarchy of table pairs and distinct results, the distinct results comprising a reduced row set for each table. Duplicates on each reduced row set are detected to complete the distinct operation on the plurality of tables. | 01-12-2012 |
20120124019 | COMPRESSION OF TABLES BASED ON OCCURRENCE OF VALUES - Methods and apparatus, including computer program products, for compression of tables based on occurrence of values. In general, a number representing an amount of occurrences of a frequently occurring value in a group of adjacent rows of a column is generated, a vector representing whether the frequently occurring value exists in a row of the column is generated, and the number and the vector are stored to enable searches of the data represented by the number and the vector. The vector may omit a portion representing the group of adjacent rows. The values may be dictionary-based compression values representing business data such as business objects. The compression may be performed in-memory, in parallel, to improve memory utilization, network bandwidth consumption, and processing performance. | 05-17-2012 |
20120166422 | Generic Node Including Stored Script - Methods and apparatus, including computer program products, are provided for providing for processing calculation plans. In one aspect, there is provided a computer-implemented method. The method may include generating a calculation plan including a plurality of nodes; determining whether at least one of the nodes includes a function node; and compiling the function node into executable code to enable execution of the plurality of nodes including the function node at the database. Related apparatus, systems, methods, and articles are also described. | 06-28-2012 |
20130073530 | Block Compression of Tables With Repeated Values - Methods and apparatus, including computer program products, for block compression of tables with repeated values. In general, value identifiers representing a compressed column of data may be sorted to render repeated values contiguous, and block dictionaries may be generated. A block dictionary may be generated for each block of value identifiers. Each block dictionary may include a list of block identifiers, where each block identifier is associated with a value identifier and there is a block identifier for each unique value in a block. Blocks may have standard sizes and block dictionaries may be reused for multiple blocks. | 03-21-2013 |
20130124475 | System and Method of Performing Snapshot Isolation in Distributed Databases - A system and method of performing snapshot isolation in distributed databases. Each node stores local snapshot information that enforces snapshot isolation for that node. The method includes partially processing a distributed transaction by a first node, receiving a global commit identifier from a coordinator, and continuing to process the distributed transaction, by the first node and a second node, in accordance with the global commit identifier. | 05-16-2013 |
20130132370 | Hybrid Query Execution Plan - A procedural pattern in a received query execution plan can be matched to a stored pattern for which an equivalent declarative operator has been pre-defined. The query execution plan can describe a query for accessing data. A hybrid execution plan can be generated by replacing the procedural pattern with the equivalent declarative operator. A hybrid execution plan processing cost can be assigned to execution of the hybrid execution plan and a query execution plan processing cost can be assigned to execution of the query execution plan. The assigning can include evaluating a cost model for the hybrid execution plan and the query execution plan. The query can be executed using the hybrid execution plan if the hybrid execution plan processing cost is less than the query execution plan processing cost or the query execution plan if the hybrid execution plan processing cost is greater than the query execution plan processing cost. Related systems, methods, and articles of manufacture are disclosed. | 05-23-2013 |
20130159285 | MANY-CORE ALGORITHMS FOR IN-MEMORY COLUMN STORE DATABASES - A pattern can be identified in at least part of a query whose definition is received in a query request. The identified pattern can be matched with a set of pre-defined patterns, each of which has associated therewith at least one pre-compiled query execution sub-component of a plurality of pre-compiled query execution sub-components retained in a library. A plan for executing the query can be generated, for example by incorporating the pre-compiled query execution sub-component associated with the matched pattern into the plan based on a pseudo code representation of the plan derived from the definition. | 06-20-2013 |
20130166566 | ACCELERATED QUERY OPERATORS FOR HIGH-SPEED, IN-MEMORY ONLINE ANALYTICAL PROCESSING QUERIES AND OPERATIONS - An additional data structure can be initialized for a column of compressed data to include a prefix storing, for each block of values in the column, a total number of bits set in previous blocks in the bit vector. A block number can be determined for a target block of the plurality of blocks, for example by checking whether or not a specified row number is located in the prefix. If the specified row number is located in the prefix, the prefix value of the prefix is returned, the most frequently occurring value is returned if a corresponding bit in the bit vector in the specified row number is not located in the prefix, or a position of the specified row in an index vector for the column is returned. | 06-27-2013 |
20130282680 | Integrated Application Server and Data Server Processes with Matching Data Formats - In one embodiment, the present invention includes a computer-implemented method comprising storing data in an application using an application custom data type and application custom data structure. The data is stored in a database using the application custom data type and the application custom data structure. In one embodiment, a request is sent to access the data from the application to the database. The data is retrieved from the database in response to the request in the application custom data type and the application custom data structure. In one embodiment, the data is sent from the database to a shared memory in the application custom data type and the application custom data structure and the data is retrieved by the application from the shared memory in the application custom data type and the application custom data structure. | 10-24-2013 |
20130290282 | Logless Atomic Data Movement - A system and method of logless atomic data movement. An internal transaction is started within a multi-level storage architecture, the internal transaction to merge data from the first level storage structure to the second level storage structure. Committed data is read from a first level storage structure of the multi-level storage architecture as specified by the internal transaction. The committed data from the first level storage structure is inserted into a second level storage structure in a bulk insertion process, and the committed data is marked as being deleted from the first level storage. The internal transaction is then committed to the multi-level storage architecture when the committed data has been inserted into the second level storage structure. | 10-31-2013 |
20130290345 | String and Sub-String Searching Using Inverted Indexes - Inverted indexes for terms and for term separators are separately provided to minimize data redundancy. Search queries are parsed to identify terms and term separators, if any, and the corresponding inverted indexes are searched for responsive documents. Related apparatus, systems, techniques and articles are also described. | 10-31-2013 |
20140122439 | DELETING RECORDS IN A MULTI-LEVEL STORAGE ARCHITECTURE - Deleting a data record from the second level storage or main store is disclosed. A look-up is performed for the data record in the first level storage, where the data record is defined by a row identifier. If the row identifier is found in the first level storage, a look-up is performed for an updated row identifier representing an update of the data record in the second level storage and the main store, the update of the data record being defined by an updated row identifier. If the updated row identifier is found in the second level storage, an undo log is generated from the first level storage to invalidate a row identifier of the row identifier. A flag is generated representing an invalid updated row identifier, and a redo log is generated to restore the data record in the first level storage. | 05-01-2014 |
20140122452 | UNIFIED TABLE QUERY PROCESSING - A system and method of query processing in a multi-level storage system having a unified table architecture. A query is received by a common query execution engine connected with the unified table architecture, the query specifying a data record. The common query execution engine performs a look-up for the data record based on the query at the first level storage structure. If the data record is not present at the first level storage structure, the common query execution engine performs separate look-ups in each of the second level storage structure and the main store. | 05-01-2014 |
20140136473 | PARTIAL MERGE - A multi-level storage architecture and method of performing a partial merge are disclosed. A main store is partitioned into a passive main part and an active main part, the active main part being empty at a start of the partial merge, the passive main part storing encoded data records of the main store that are not subject to the partial merge. A values index corresponding to a sorted dictionary of the passive main part is set to a cardinality of n. The data records of a second level storage structure is merged into the active main part, the active main part having a dictionary that starts with a value of n+1, such that the merging into the active main part continues an encoding scheme according to the values index of the passive main part. | 05-15-2014 |
20140136788 | Deleting Records In A Multi-Level Storage Architecture Without Record Locks - The multi-level storage system and method of deleting first level storage structure pages or records without record locks. The method includes determining whether a record to be deleted from the first level storage structure has any uncommitted write operation, and if the record has an uncommitted write operation, the record is kept in the first level storage structure. Record-moved version information is added to the record to designate the record being moved from the first level storage structure to the second level storage structure. Data change operations are executed for the record based on the record-moved version information without waiting until the record's movement from the first level storage structure to the second level storage structure finishes. | 05-15-2014 |
20140222418 | FIXED STRING DICTIONARY - The subject matter described herein relates to implementation of a dictionary in a column-based, in-memory database where values are not stored directly, rather, for each column, a dictionary is created with all distinct values. For each row, a reference to the corresponding value in the dictionary is stored. In one aspect, data is stored in a memory structure organized in a column store format defined by a plurality of columns and a plurality of rows. A dictionary for each column in the memory structure is generated. The dictionary has distinct values for each column. A reference to the dictionary is generated for each column in the memory structure. The dictionary and the reference to the dictionary are stored in the memory structure. | 08-07-2014 |
20140250090 | COMPRESSION OF TABLES BASED ON OCCURRENCE OF VALUES - Methods and apparatus, including computer program products, for compression of tables based on occurrence of values. In general, a number representing an amount of occurrences of a frequently occurring value in a group of adjacent rows of a column is generated, a vector representing whether the frequently occurring value exists in a row of the column is generated, and the number and the vector are stored to enable searches of the data represented by the number and the vector. The vector may omit a portion representing the group of adjacent rows. The values may be dictionary-based compression values representing business data such as business objects. The compression may be performed in-memory, in parallel, to improve memory utilization, network bandwidth consumption, and processing performance. | 09-04-2014 |
20150095309 | Many-Core Algorithms for In-Memory Column Store Databases - A pattern can be identified in at least part of a query whose definition is received in a query request. The identified pattern can be matched with a set of pre-defined patterns, each of which has associated therewith at least one pre-compiled query execution sub-component of a plurality of pre-compiled query execution sub-components retained in a library. A plan for executing the query can be generated, for example by incorporating the pre-compiled query execution sub-component associated with the matched pattern into the plan based on a pseudo code representation of the plan derived from the definition. | 04-02-2015 |
20150120699 | Performing Complex Operations in a Database Using a Semantic Layer - The present invention includes a database with a semantic layer for performing standard SQL and complex operations custom to one or more application. In one embodiment the present invention includes receiving a data request from an application in a database, the data request specifying standard SQL operations and custom application operations to be performed for said application. The data request is processed in a semantic layer of the database. The semantic layer processes the standard SQL operations and the custom application operations and generates a logical execution plan comprising the standard SQL operations and the custom application operations. The logical execution plan is converted into a physical execution plan, which is executed by the database to generate a data result. The data result may be sent back to the application. | 04-30-2015 |
20150154208 | Integrated Application Server and Data Server Processes with Matching Data Formats - In one embodiment, the present invention includes a computer-implemented method comprising storing data in an application using an application custom data type and application custom data structure. The data is stored in a database using the application custom data type and the application custom data structure. In one embodiment, a request is sent to access the data from the application to the database. The data is retrieved from the database in response to the request in the application custom data type and the application custom data structure. In one embodiment, the data is sent from the database to a shared memory in the application custom data type and the application custom data structure and the data is retrieved by the application from the shared memory in the application custom data type and the application custom data structure. | 06-04-2015 |
20150178305 | ADAPTIVE DICTIONARY COMPRESSION/DECOMPRESSION FOR COLUMN-STORE DATABASES - Innovations for adaptive compression and decompression for dictionaries of a column-store database can reduce the amount of memory used for columns of the database, allowing a system to keep column data in memory for more columns, while delays for access operations remain acceptable. For example, dictionary compression variants use different compression techniques and implementation options. Some dictionary compression variants provide more aggressive compression (reduced memory consumption) but result in slower run-time performance. Other dictionary compression variants provide less aggressive compression (higher memory consumption) but support faster run-time performance. As another example, a compression manager can automatically select a dictionary compression variant for a given column in a column-store database. For different dictionary compression variants, the compression manager predicts run-time performance and compressed dictionary size, given the values of the column, and selects one of the dictionary compression variants. | 06-25-2015 |
20150242400 | Database Table Re-Partitioning Using Trigger-Based Capture and Replay - Partitioning of a source table of a database to a target table is initiated. Thereafter, a replay table is generated that is populated with triggers for database operations performed on the source table for subsequent replay for the target partitions. Data is later moved (e.g., asynchronously moved, etc.) from the source table to the target table. The database operations are replayed on the target table T subsequent to the moving of the data using the replay table. In addition, the source table is dropped when all of the data has been moved to the target table and there are no operations requiring replay. Related apparatus, systems, techniques and articles are also described. | 08-27-2015 |
20160004758 | Integrated Application Server and Data Server Processes with Matching Data Formats - In one embodiment, the present invention includes a computer-implemented method comprising storing data in an application using an application custom data type and application custom data structure. The data is stored in a database using the application custom data type and the application custom data structure. In one embodiment, a request is sent to access the data from the application to the database. The data is retrieved from the database in response to the request in the application custom data type and the application custom data structure. In one embodiment, the data is sent from the database to a shared memory in the application custom data type and the application custom data structure and the data is retrieved by the application from the shared memory in the application custom data type and the application custom data structure. | 01-07-2016 |
20160042016 | Deleting Records In A Multi-Level Storage Architecture - Deleting a data record from the second level storage or main store is disclosed. A look-up is performed for the data record in the first level storage, where the data record is defined by a row identifier. If the row identifier is found in the first level storage, a look-up is performed for an updated row identifier representing an update of the data record in the second level storage and the main store, the update of the data record being defined by an updated row identifier. If the updated row identifier is found in the second level storage, an undo log is generated from the first level storage to invalidate a row identifier of the row identifier. A flag is generated representing an invalid updated row identifier, and a redo log is generated to restore the data record in the first level storage. | 02-11-2016 |
20160042028 | LOGLESS ATOMIC DATA MOVEMENT - A system and method of logless atomic data movement. An internal transaction is started within a multi-level storage architecture, the internal transaction to merge data from the first level storage structure to the second level storage structure. Committed data is read from a first level storage structure of the multi-level storage architecture as specified by the internal transaction. The committed data from the first level storage structure is inserted into a second level storage structure in a bulk insertion process, and the committed data is marked as being deleted from the first level storage. The internal transaction is then committed to the multi-level storage architecture when the committed data has been inserted into the second level storage structure. | 02-11-2016 |
20160048559 | DATA MODIFICATION IN HYPOTHETICAL PLANNING - A system, medium, and method including modifying a graphical view representation of a first table of a set of data, the first table having at least a first column subject to changes in value; modifying a graphical view representation of a second table of a second set of data; determining a query operation of the view representations of the first table and second table; aggregating values of the view representation of the result of the query operation having a same key; determining, based on the aggregated values, values for the first column of the view representation of the first table; and providing an output of the values for the first column of the view representation of the first table, the output values including changed values. | 02-18-2016 |
Patent application number | Description | Published |
20080258510 | Openable Vehicle Roof - The invention relates to an openable vehicle roof which comprises at least one cover element ( | 10-23-2008 |
20090079234 | Adjustment Device for a Sliding Roof Cover on a Vehicle - A adjustment device for a sliding roof cover on a vehicle, comprising a guide rail, which runs in a longitudinal direction, for guiding sliders which are arranged in series in the longitudinal direction and control the movement of the sliding roof cover, wherein the first slider can be moved along the guide rail by means of a drive device and, over a part of its movement range, drives the second slider, and over another part of its movement range, leaves the second slider behind in a predefined position along the guide rail, wherein a locking element, which can be adjusted in height in a manner controlled by the first slider, is arranged on the second slider, which locking element, when the second slider is left behind, is placed by means of a height adjustment into a form-fitting connection with a guide rail section in order to lock the second slider to the guide rail. Here, in order to avoid unfavourable forces during the locking and release of the second slider, it is proposed according to the invention that a rotary bar, which can be rotated about a vertical axis in a manner controlled by the first slider, is also arranged on the second slider, which rotary bar, when the second slider is left behind, is rotated into a rotational position which secures the locking action after the height adjustment of the locking element. | 03-26-2009 |
20100084893 | Vehicle Roof with a Roof Part that can be Displaced Above the Roof - The invention relates to a vehicle roof with a movable roof part, which by means of a tilt lever, which is connected in an articulated manner close to the rear edge of the roof part, can first be tilted into a ventilating position and can then be slid above the vehicle roof or above an at least partially fixed roof part for the at least partial release of an opening in the vehicle roof, the movable roof part being continuously supported in the area of its rear edge when it is slid from the ventilating position backwards and the movable roof part having a continuous side skirt in the area of its side edges. In order to ensure reliable support and at the same time a pleasing appearance, the rear edge of the movable roof part is continuously supported during the tilting movement and the sliding movement by means of the tilt lever and the side skirt, which is independent of the support system for the movable roof part, lies continuously adjacent a seal arranged at the edge of the roof opening or close to the upper end of the guide rail during the tilting movement and during the sliding movement. | 04-08-2010 |
20100164253 | Vehicle Roof Comprising a Cover that can be Displaced Above a Fixed Roof Section - The invention relates to a vehicle roof comprising a liftable covering element that can be displaced above a fixed roof section. A control mechanism for the covering element is respectively provided on both sides of the covering element. According to the invention, the control mechanism comprises a drive carriage, a rear release lever which is connected to the covering element in the region of the rear edge thereof in an articulated manner, a front release lever which is connected to the covering element in the region of the front edge thereof in an articulated manner, and a coupling lever which is rotatably connected to the front release lever, co-operates with the drive carriage, and can be displaced in a release position in relation to the drive carriage in the longitudinal direction of the vehicle. The displacement of the drive carriage in the direction of the rear of the vehicle causes firstly an outward pivoting of the rear release lever from a closing position of the covering element, and an outward pivoting of the front release lever when an abutment is reached between the drive carriage and the coupling lever. | 07-01-2010 |
20110260504 | Sun Roof having Carriage Element - A vehicle roof comprising at least one cover element, which selectively closes or at least partially exposes a roof opening and which, with respect to the vehicle longitudinal center plane, comprises a carrier element on either side, said carrier element being provided with a gate and interacting with an adjusting device, which is guided in a guide rail arranged in the vehicle longitudinal direction and comprises a carriage element, which interacts with the gate of the respective carrier element at least in order to pivot the cover element and comprises a guide section on which the carrier element rests. The guide section is formed by a wall of a plastic component, which can be elastically deformed and give way in a hollow space formed by the plastic component. | 10-27-2011 |
20120025568 | Cover Element Carrier Having Control Slide - A vehicle roof having at least one cover element, which selectively closes or at least partially exposes a roof opening and which can be adjusted between a closed position and a lowered displacement position and, with respect to a vehicle longitudinal center plane, comprises a carrier element on either side, the carrier element comprising a guide path, which interacts with at least one guide element of a drive carriage for pivoting the cover element, the carriage being guided in a guide rail fixed to the roof. At least one rear-side control slide is disposed on the carrier element and guides the cover element in a guide channel of the respective guide rail during displacement of said element and secures the cover element against pivoting. When pivoting the cover element into the lowered displacement position, the rear-side control slide recedes into the respective guide channel of the respective guide rail while sliding over a ramp. | 02-02-2012 |
20120068501 | Vehicle Roof Having Drive Carriage for Cover Element - A vehicle roof having at least one cover element, which selectively closes or at least partially exposes a roof opening and which, with respect to a vehicle longitudinal center plane, comprises a carrier element on either side, the carrier element comprising a guide web that interacts with an adjusting device that is guided in a guide rail and comprises a drive carriage, which interacts with the guide web at least to pivot the cover element and comprises a guide element on which the guide web rests. When moving the cover element in the vehicle longitudinal direction, each guide element of the drive carriages serves as a dog element, which engages in a corresponding dog recess configured at the respectively associated carrier element of the cover element. | 03-22-2012 |
Patent application number | Description | Published |
20100067615 | Method for Optimizing Signals with Multiple Subcarriers - The invention relates to a method for coding data in a transmitted signal, wherein the transmitted signal comprises multiple subcarriers with orthogonal frequencies, the method comprising the step of modulating the signals corresponding to a given subset of the subcarriers of the transmitted signal in order to encode information and the step of modulating the signal corresponding to least one reserved subcarrier depending on at least one optimization criterion relating to a quality of the overall transmitted signal. In order to enhance the quality of the transmitted signal, the optimization criterion depends on at least one first quantity relating to a peak-to-average-power ratio of the transmitted signal and on at least one second quantity relating to an out-of-band power of the transmitted signal. | 03-18-2010 |
20100151813 | , NETWORK AND DEVICE FOR INFORMATION PROVISION BY USING PAGING AND CELL BROADCAST SERVICES - Informing a number of users about an emergency or other situation of public interest is accomplished using a broadcast service. A specific identifier is used in a paging message for activating broadcast service in terminals. A terminal checks a received paging message with regard to the presence of the specific identifier and when detecting the specific identifier, switches to a broadcast mode for receiving broadcast content. The received broadcast emergency content is notified and/or displayed to the users of the terminals. | 06-17-2010 |
20110076964 | Re-Activation of a Base Station in Standby Mode - The present invention relates to methods, apparatuses, a system and a computer program product for reducing a power consumption in low load scenarios. An apparatus can include transmitting means, receiving means and determining means for determining whether a signal quality of a broadcast channel of a wireless network cell is insufficient, wherein the transmitting means may transmit on a wireless access channel an activation information to a further apparatus if the determination is affirmative. The activation information can indicate that disabled transmitting means of the further apparatus should be re-enabled. The further apparatus may include transmitting means, receiving means disabling means for disabling the transmitting means and enabling means for re-enabling the transmitting means, wherein the receiving means can be configured to receive the activation in-formation, and wherein the enabling means may be configured to re-enable the transmitting means if the activation information is received. | 03-31-2011 |
20110195707 | Apparatus, Method and Program Providing a Confidence Estimation of Coverage Hole Detection - Method, apparatus and software configured to detecting a radio coverage hole and providing a confidence information of a detected radio coverage hole. A coverage hole detection signal and confidence information may be received and evaluated, deciding on a potential coverage hole reducing or closing process depending on the evaluation. | 08-11-2011 |
20110223854 | Data Load Redistribution Within a Relay Enhanced Telecommunication Network - It is described a method for changing the data load distribution within a telecommunication network comprising including a first base station, a second base station and a relay node being connected to the first base station and/or to the second base station. The described method includes (a) establishing for each of a plurality of user equipments a first indirect connection to the first base station via the relay node, (b) establishing in a collective manner for each of the plurality of user equipments a second indirect connection to the second base station via the relay node, and (c) terminating in a collective manner for each of the plurality of user equipments the first indirect connection. It is further described a network element, which is adapted to carry out the above described data load redistribution method, and a computer program, which is adapted for controlling the above described data load redistribution method. | 09-15-2011 |
20110292799 | Handling of Overloads and Handovers in a Communications Network - The present invention refers to handling of an overload in a communications network and to handling of handovers occurring after the handling of handovers in the communications net work, wherein said communications network is based upon a tree topology providing several levels of nodes in said communications network. According to the present invention, in formation about an overload is provided through several levels of nodes in communications network, starting from the node, with regard to which said overload has occurred, and ending with nodes being located in levels arranged upside the level, in which the overload occurred, and being connected directly or indirectly with the node, with regard to which said overload has occurred. When handling a handover from a cell in a node, which is affected by the overload, the handover will be allowed only if the cell comprises at least one node, which is also affected by the overload. | 12-01-2011 |
20120149363 | Method and Apparatus for Power Reduction Control in Home Network Environment - There are provided measures for power reduction control in a home network environment, which may be applicable in an interworking of a home network area and a macro network area. Such measures for power reduction control may for example include, upon receipt of an initial power reduction command from a network element of a macro network area, reducing a transmit power in a home network area by a predetermined power reduction amount and starting a timer with a predetermined time period, and upon receipt of a further power reduction command from a network element of a macro network area as long as the timer is not expired, discarding the further power reduction command. | 06-14-2012 |
20120309384 | Method for Controlling Interference in a Radio Communications System and Apparatus Thereof - Method and Apparatus thereof, for controlling intercell interference in a radio communications system having a plurality of user equipment and a plurality of access nodes including the steps of: a user equipment of said plurality connected to a serving access node, upon determining that an access node of said plurality is causing interference, transmitting a request to said serving access node; said serving access node forwarding said request to an apparatus controlling said interfering access node over an X2 interface, and said apparatus, instructing said interfering access node to execute said request. | 12-06-2012 |
20130337811 | Relay Node Configuration in Preparation for Handover - A method of initiating configuration of at least one station includes receiving capability information of at least one second base station when the at least one station is within a cell area of a first base station. The method also includes determining some configuration information of the at least one station based on the received capability information. Configuring the at least one station according to the configuration information before the at least one station is handed over from the first base station to the at least one second base station is then initiated. | 12-19-2013 |
20140018071 | Scheduling in Coordinated Multi-Point Transmission Scheme - Methods, a user equipment, a base station and a computer program product for managing assignments between user equipments and cooperation areas are provided. The present invention discloses receiving, at a base station belonging to a cooperation area, a connection request message from a user equipment to be connected to the cooperation area. The connection request message includes a parameter indicating preference information. It is determined, on the basis of the parameter, whether the user equipment is allowed to connect to the cooperation area. A connection acknowledgement/non-acknowledgement message is forwarded from the base station to the user equipment. The present invention discloses acquiring information about reachable cooperation areas, determining preference information with respect to the reachable cooperation areas, sending a connection request message including preference information to a reachable cooperation area, and selecting the cooperation area to which the connection request message was sent if a connection acknowledgement message is received. | 01-16-2014 |
20140348011 | VOIP Cooperative Multipoint Solution - It is provided a user equipment, including mode switching means adapted to switch, autonomously or based on a command from a base station of a communication system to which the user equipment belongs, the user equipment into a low data rate mode; measuring means adapted to measure a downlink reference signal received on a downlink from the base station; feedback preparing means adapted to prepare a feedback based on the measurement by the measuring means; encoding means adapted to encode the feedback, thus obtaining encoded data; modulating means adapted to modulate the encoded data; and providing means adapted to provide the modulated encoded data for being sent on the uplink at a predetermined time after the downlink reference signal was received, if the user equipment is in the low data rate mode. | 11-27-2014 |
20150009933 | CONFIGURING A COMMUNICATION CHANNEL BETWEEN A BASE STATION AND A USER EQUIPMENT - A method is provided wherein a base station and at least one further base station are assigned to a cooperation area, wherein a user equipment is served by the base station. The method comprises determining, by the base station), whether all user data of the user equipment being required for a precoding coordinated multipoint transmission is received by each of the base station and the at least one further base station, selecting a transmission mode, wherein the transmission mode is based, if all user data of the user equipment being required for a precoding coordinated multipoint transmission is received by each of the base station and the at least one further base station, on precoding coordinated multipoint transmission, or else, on an interference reducing transmission, and configuring, by the base station, the communication channel between the base station and the user equipment based on the selected transmission mode. | 01-08-2015 |
20150024776 | OPTIMIZING COOPERATION AREAS AND COVER SHIFTS IN CELLULAR COMMUNICATIONS NETWORK SYSTEMS - In a cellular communications network system comprising a plurality of cells including a first cell and second cells different from and present in the neighborhood of the first cell, measurement reports are repeatedly received from user equipments, each including a first signal strength value corresponding to a signal strength measured from the first cell over a short time period and n second signal strength values corresponding to signal strengths measured over the short time period from n second cells, which correspond to the n strongest signal strengths measured from the second cells, n being an integer greater than one. A value of a counter is incremented which corresponds to a potential cooperation area formed by the first cell corresponding to the first signal strength value and the n second cells corresponding to the n second signal strength values. | 01-22-2015 |
20150038105 | METHOD, NETWORK AND DEVICE FOR INFORMATION PROVISION BY USING PAGING AND CELL BROADCAST SERVICES - Informing a number of users about an emergency or other situation of public interest is accomplished using a broadcast service. A specific identifier is used in a paging message for activating broadcast service in terminals. A terminal checks a received paging message with regard to the presence of the specific identifier and when detecting the specific identifier, switches to a broadcast mode for receiving broadcast content. The received broadcast emergency content is notified and/or displayed to the users of the terminals. | 02-05-2015 |
20150038106 | METHOD, NETWORK AND DEVICE FOR INFORMATION PROVISION BY USING PAGING AND CELL BROADCAST SERVICES - The invention relates to a method, terminal and network or entity wherein a broadcast service is used for informing a number of users on an emergency or other situation of public interest. A specific identifier is used in a paging message for activating broadcast service in the terminals. A terminal checks a received paging message with regard to the presence of the specific identifier and when detecting the specific identifier, switches to a broadcast mode for receiving broadcast content. The received broadcast emergency content is notified and/or displayed to the users of the terminals. | 02-05-2015 |
20150049664 | Method for Controlling a Multi-Hop Transmission - Method for controlling a multi-hop transmission it is described a method for controlling a multi-hop transmission of a data packet between a base station and a user equipment via at least one relay node. A maximum allowable time period for transmitting the data packet between the base station and the user equipment via the at least one relay node is specified. The method includes calculating, based on a time information associated with a time period, which has been needed for a transmission of the data packet to the at least one relay node, and the maximum allowable time period, a remaining time period being available for the at least one relay node for transmitting the data packet, and controlling the transmission of the data packet from the at least one relay node to the base station or the user equipment based on the calculated remaining time period. | 02-19-2015 |
20150071248 | TECHNIQUES FOR RELOCATING A BACKHAUL CHANNEL BETWEEN A SMALL CELL BASE STATION AND A MACRO CELL BASE STATION - Examples are disclosed for handover/relocation of a backhaul channel between a small cell base station and a macro cell base station. The handover/relocation may be responsive to possibly changing conditions associated with a wireless link over which the backhaul channel may be established. Other examples are described and claimed. | 03-12-2015 |
20150139094 | METHOD OF REPORTING CHANNEL STATE INFORMATION - A method of reporting channel state information from a network element to a further network element of a communication network is provided, wherein the method includes decomposing the channel state information into different portions wherein the different portions correspond to channel state information varying on different time scales, and reporting at least one portion of the decomposed channel state information to a further network element. | 05-21-2015 |
20150181502 | MOVING AD HOC NETWORK SMALL CELL RELAY HANDOVER - A mobile small station including a transceiver, a processor, and a memory having instructions for execution by the processor to exchange measurement information with a macro station, provide a wide area network connection and act as a relay for a small station moving network with the mobile small station, and perform handover of relay responsibilities to another mobile small station in the small station moving network. | 06-25-2015 |
20150189518 | ADJACENT CHANNEL LEAKAGE REDUCTION IN SCALABLE WIRELESS COMMUNICATION NETWORK - Embodiments of the present disclosure describe adjacent channel leakage reduction in wireless networks. An apparatus may include circuitry to receive, by a user equipment (UE) of a wireless communication network over downlink signaling, information to indicate a frequency offset of one or more uplink carrier bands of the UE and circuitry to shift a frequency of the one or more uplink carrier bands based on the frequency offset. Other embodiments may be described and/or claimed. | 07-02-2015 |
20150223037 | METHOD, NETWORK AND DEVICE FOR INFORMATION PROVISION BY USING PAGING AND CELL BROADCAST SERVICES - Informing a number of users about an emergency or other situation of public interest is accomplished using a broadcast service. A specific identifier is used in a paging message for activating broadcast service in terminals. A terminal checks a received paging message with regard to the presence of the specific identifier and when detecting the specific identifier, switches to a broadcast mode for receiving broadcast content. The received broadcast emergency content is notified and/or displayed to the users of the terminals. | 08-06-2015 |
20150296521 | JOINT ASSIGNMENT AND SCHEDULING FOR OVERLAPPING CoMP CLUSTERS - The present invention provides methods, apparatuses and a computer program product related to joint assignment and scheduling for overlapping coordinated multi-point transmission (CoMP) clusters. The present invention includes acquiring, at a network entity, for each of a plurality of user equipments connected to a resource of a cooperation area, a connectivity ratio of each user equipment to the resource, selecting, at the network entity, among the plurality of user equipments connected to the resource of a cooperation area, a first user equipment having a lowest current connectivity ratio, and determining whether the current connectivity ratio of the selected user equipment is equal to or smaller than a stored connectivity ratio of the selected user equipment to another resource available for the user equipment. | 10-15-2015 |
20150350924 | TECHNIQUES TO SUPPORT DIRECTIONAL TRANSMISSION AND RECEPTION BY WIRELESS NETWORK BOOSTERS - Techniques to support directional transmission and reception by wireless network boosters are described. In one embodiment, for example, an apparatus may comprise logic, at least a portion of which is in hardware, the logic to receive a directionally-transmitted booster reference signal, receive a system information message comprising timing offset information, and determine a time at which to send a link establishment message based on the timing offset information and a time of receipt of the directionally-transmitted booster reference signal. Other embodiments are described and claimed. | 12-03-2015 |
20150351135 | Techniques for Exchanging Beamforming Information for a Dual Connection to User Equipment - Examples are disclosed for exchanging beamforming information for a first wireless link utilized as a first connection of a dual connection for user equipment (UE) to access a network. The beamforming information exchanged between the UE and a small cell base station (BS) to configure the first wireless link as a beam-formed wireless link. Other examples are described and claimed. | 12-03-2015 |
20150382258 | SYSTEMS, METHODS AND DEVICES FOR SMALL CELL ACTIVATION AND DETECTION - Methods, systems, and devices for enabling wireless communication devices in a cellular wireless network to utilize small cells having coverage within a macro cell are disclosed herein. User equipment (UE) can detect the need for using a booster providing a small cell, detect availability of small cells and submit a request to infrastructure of the cellular wireless network to aid in connection with the booster that provides the small cell. The request can be enhanced with small cell location queries, small cell activation requests and/or assistance data to enable meaningful small cell selection. | 12-31-2015 |