| Class / Patent application number | Description | Number of patent applications / Date published |
|---|
| 707799000 | Queues | 10 |
| 20100250612 | SYSTEM AND METHOD FOR QUEUE MANAGEMENT - A system and method for managing a queue may receive a selection of an image, symbol, or avatar from a user. The user may be associated with the selected image, which may provide an anonymous connection to the user. The selected image may be used to display a status of the queue and to summon the user to receive a service. Other embodiments are described and claimed. | 09-30-2010 |
| 20100262627 | METHOD AND SYSTEM FOR STORING A HIERARCHY IN A RDBMS - A method allows one to store in a parallel way branches and nodes of a hierarchy into a database by creating queues. Each queue has a status and a unlock item indicating if a superior node has already been stored. A process looks up these indicators and performs according to commands received from a first process control of the queues. | 10-14-2010 |
| 20110035413 | DIAMETER BUS COMMUNICATIONS BETWEEN PROCESSING NODES OF A NETWORK ELEMENT - A Diameter bus between Diameter processing nodes of the same network element is disclosed herein. The Diameter bus includes a data structure that is used to transfer Diameter messages between the processing nodes. In doing so, the data structure avoids the overhead associated with SCTP, TCP, Ethernet, and/or IP encoding that is required by the Diameter base protocol. To ensure that the Diameter processing nodes operate as intended, the Diameter bus also includes a simplified Diameter transport structure such that Capabilities Exchange messaging between Diameter processing nodes is maintained as required by the Diameter base protocol. However, the simplified Diameter transport structure forgoes other functionality associated with the Diameter base protocol, such as the Device Watchdog messaging. By eliminating certain features of the Diameter base protocol as well as the SCTP/TCP/IP encoding and decoding associated with Diameter communications, processing performance of the network element can be substantially improved. | 02-10-2011 |
| 20110137952 | METHOD AND APPARATUS FOR IMPROVING THE PERFORMANCE OF OBJECT-ORIENTED QUEUES - A method for managing object-oriented queues by reusing queue entry objects instead of creating and destroying each queue entry object inserted into and removed from the queue. Inserting a queue entry object into the queue involves changing the status of the queue entry object from available to in-use, adding the queue entry object to a queue list, returning a reusable queue entry object to the queue user, receiving an insertion notification that the queue entry object data is valid, and marking the insertion of the queue entry object into the queue as complete. Removing a queue entry object from the queue involves un-marking the queue entry object in the queue as complete, removing the queue entry object from the queue list, returning the valid queue entry object to the queue user, receiving a removal notification that valid data has been extracted from the queue entry object, and changing the status of the reusable queue entry object removed from the queue list from in-use to available. | 06-09-2011 |
| 20110137953 | System and method for transactional and fault-tolerant distribution of digital assets over multi-tiered computer networks - Provided herein is a system and computer program product for distributing at least one infrastructure description record (IDR) over at least one tier of a network. The system includes at least one network interface that receives the infrastructure description records (IDRs) and the IDRs being enqueued on at least one incoming, transactional, persistent queue (ITPQ), at least one transactional, persistent store, and at least one transactional process that dequeues the IDR from the ITPQ and accesses the IDR to create an accessed IDR, the accessed IDR being stored in the transactional, persistent store in the system. | 06-09-2011 |
| 20110252069 | STATUS TOOL TO EXPOSE METADATA READ AND WRITE QUEUES - A method to expose status information is provided. The status information is associated with metadata extracted from multimedia files and stored in a metadata database. The metadata information that is extracted from the multimedia files is stored in a read queue to allow a background thread to process the metadata and populate the metadata database. Additionally, the metadata database may be updated to include user-define metadata, which is written back to the multimedia files. The user-defined metadata is included in a write queue and is written to the multimedia files associated with the user-defined metadata. The status of the read and write queues are exposed to a user through a graphical user interface. The status may include the list of multimedia files included in the read and write queues, the priorities of each multimedia file, and the number of remaining multimedia files. | 10-13-2011 |
| 20120310991 | SYSTEMS AND METHODS FOR RESLICING DATA IN A RELATIONAL DATABASE - Systems and methods for reslicing data in a representation of a relational database are disclosed. In one embodiment, the database includes a representation including a first slice. The database system creates a plurality of new slice and to create a plurality of write queues. The database system copies units of data in the first slice to the new slices according to a distribution function. The distribution function determines, for each unit of data in the first slice, one of the new slices into which to copy the unit of data. The database system asynchronously writes one or more actions of a set of one or more asynchronous database transactions to the first slice when copying the data in the first slice to the new slices. The database asynchronously enqueues the one or more actions of the set of asynchronous database transactions in the write queues according to the distribution function. | 12-06-2012 |
| 20130031138 | METHOD AND APPARATUS FOR IMPROVING THE PERFORMANCE OF OBJECT-ORIENTED QUEUES - A method for managing object-oriented queues by reusing queue entry objects instead of creating and destroying each queue entry object inserted into and removed from the queue. Inserting a queue entry object into the queue involves changing the status of the queue entry object from available to in-use, adding the queue entry object to a queue list, returning a reusable queue entry object to the queue user, receiving an insertion notification that the queue entry object data is valid, and marking the insertion of the queue entry object into the queue as complete. Removing a queue entry object from the queue involves un-marking the queue entry object in the queue as complete, removing the queue entry object from the queue list, returning the valid queue entry object to the queue user, receiving a removal notification that valid data has been extracted from the queue entry object, and changing the status of the reusable queue entry object removed from the queue list from in-use to available. | 01-31-2013 |
| 20140040318 | SYSTEMS AND METHODS FOR RESLICING DATA IN A RELATIONAL DATABASE - Systems and methods for reslicing data in a representation of a relational database are disclosed. In one embodiment, the database includes a representation including a first slice. The database system creates a plurality of new slice and to create a plurality of write queues. The database system copies units of data in the first slice to the new slices according to a distribution function. The distribution function determines, for each unit of data in the first slice, one of the new slices into which to copy the unit of data. The database system asynchronously writes one or more actions of a set of one or more asynchronous database transactions to the first slice when copying the data in the first slice to the new slices. The database asynchronously enqueues the one or more actions of the set of asynchronous database transactions in the write queues according to the distribution function. | 02-06-2014 |
| 20140310316 | Playlist Update in a Media Playback System - Embodiments are provided for updating a playlist that has been added to a playback queue in response to changes to the playback queue. The playback queue may be associated with a zone of a network media system such that items in the playback queue are to be rendered by the zone. The playlist may include one or more items playable by the zone, and may be stored separately from where the playback queue is maintained. Embodiments are also provided for updating a playback queue in response to modifications to a playlist included in the playback queue. In some cases, a user modifying the playlist or playback queue may be prompted upon making the modifications whether to also apply the modification to the playback queue or playlist, respectively. | 10-16-2014 |
