Object queues with concurrent updating
US6360219B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 16, 1998 |
| Grant date | Mar 19, 2002 |
| Priority date | — |
| Expiry date | Dec 16, 2018 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99938
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A queue data structure is stored on a computer-readable medium to represent a queue or list. The data structure includes a head pointer that points to the last or most recent list element to have been removed from the queue, and a tail pointer that points to the most recently added list element in the queue. The head pointer and tail pointer may be implemented as separate objects. The queue data structure is applicable to computer arts such as transactional database management. The queue data structure can prevent concurrency conflicts that could otherwise occur when an object modified in one transaction (e.g. by one user) is modified by another concurrent transaction (e.g. by another user).
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.