System for accessing shared data using a serialization graph con

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395600, 395650, 395425, 3649483, 3642281, 3642468, 364DIG1, G06F 900, G06F 1200

Patent

active

052806197

ABSTRACT:
Apparatus for scheduling at least two concurrent transactions accessing a shared data is provided. When a lock request is granted, the apparatus provides for constructing a history file for the shared data to show each data accessing transaction, and also provides for constructing a serialization graph with each node denoting an active transaction, and each directed edge denoting a dependency between two transactions. The serialization graph is searched for a cycle formed by transactions, and if any is found, the transactions are aborted and restarted.

REFERENCES:
patent: 3683418 (1972-08-01), Martin
patent: 3827029 (1974-07-01), Schlotterer et al.
patent: 4189771 (1980-02-01), Roerer
patent: 4224664 (1980-09-01), Trinchieri
patent: 4809168 (1989-02-01), Hennessy et al.
patent: 5095421 (1992-03-01), Freund
patent: 5161227 (1992-11-01), Dias et al.
patent: 5202987 (1993-04-01), Buyer et al.
patent: 5208914 (1993-05-01), Wilson et al.
H. Korth and A. Silberschatz Database System Concepts Z/e McGraw-Hill pp. 365`407, 1991, 1986.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

System for accessing shared data using a serialization graph con does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System for accessing shared data using a serialization graph con, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System for accessing shared data using a serialization graph con will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1142860

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.