Patent · US Expired

Database management system, method and program for supporting the mutation of a composite object without read/write and write/write conflicts

US5857182A · kind A · utility

87Cited by
3References
31Claims
0Family size

Assignee

Inventors

Key dates

Filing dateJan 21, 1997
Grant dateJan 5, 1999
Priority date
Expiry dateJan 21, 2017

Classification

  • Technology area (CPC Y)Emerging Cross-Sectional Technologies
  • CPC primaryY10S707/99938
  • WIPO fieldComputer technology
  • WIPO sectorElectrical engineering

Abstract

The system, method, and program of this invention avoids potential write/write conflicts and read/write conflicts when a subcomponent of a composite object (e.g., an ADT) is mutated. The embodiments of this invention define a copy semantic for the mutation function. In one embodiment, a copy function is inserted prior to any mutation function. In a another embodiment, a global compile-time analysis is performed to determine if a write/write or read/write conflict exists; and to eliminate redundant copy constructors if a conflict does exist. In a preferred embodiment, only a local analysis is performed during the parsing phase, thereby avoiding a global compile-time analysis. A mutation safe flag is associated with each parse tree node. A read target leaf parse tree node is set to false while non-leaf parse tree nodes (functions) derive their value from an incoming node, except that constructors and copy constructor functions are always true. Whether or not a copy is made of the composite object (i.e., whether or not a copy constructor is inserted) prior to a mutation is determined according to the setting of the mutation safe flags and according to the following. If a mutation safe…

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.