News Column

Patent Application Titled "Selective Locking of Business Object Data Structures" Published Online

July 15, 2014



By a News Reporter-Staff News Editor at Information Technology Newsweekly -- According to news reporting originating from Washington, D.C., by VerticalNews journalists, a patent application by the inventors Hackmann, Herbert (Wiesloch, DE); Singh, Hardeep (Wiesloch, DE); Ibrahim, Fawaz Mohamed (Heidelberg, DE); Seitel, Christian (Sandhausen, DE), filed on December 21, 2012, was made available online on July 3, 2014.

No assignee for this patent application has been made.

Reporters obtained the following quote from the background information supplied by the inventors: "Complex business applications can be tailored into business objects to encapsulate semantically related functionality and structure. A business object can include a hierarchy of business object nodes, which represent data as attributes. In addition, a business can be an independently viable entity with identifiable instances as well as bundle functions and data, both of which may be accessible from outside of the business object. Business objects can be described by a data model, an internal process model, and one or more typed service interfaces, and can be a core structuring element of applications that are centrally defined by a developer as part of an overall governance process.

"Business object services can be consumed by external consuming entities or by other business objects during a transaction. In this regard, a transaction is a set of operations which are indivisible and must be executed together and completely. Conflicts can occur when multiple users are concurrently modifying values associated with business objects, thus affecting the corresponding transactions."

In addition to obtaining background information on this patent application, VerticalNews editors also obtained the inventors' summary information for this patent application: "In aspect, a respective transaction associated with at least one business object is initiated on behalf of each of a plurality of users during an interaction phase. Each business object includes a plurality of hierarchically related nodes storing values and each transaction is initiated via a service interface of the at least one business object and includes a set of operations that are required to be executed together (with at least one of the operations requiring modification of the at least one business object). Subsequently, an optimistic lock to the business object is assigned to each user during pendency of the corresponding transaction upon modification of at least one node of the at least one business object. An exclusive lock is then assigned to the at least one business object to a first user that first completes the interaction phase. Thereafter and in response to the exclusive lock being assigned, users other than the first user are prevented from obtaining an exclusive lock to the at least one business object in response to the exclusive lock being assigned.

"Data can be provided to each user having an assigned optimistic lock other than the first user that indicates that an exclusive lock has been assigned. Providing data can include, for example, displaying a message to each user having an assigned optimistic lock other than the first user.

"The interaction phase can be completed when results of business object services executed during the interaction phase via the service interface are saved. All optimistic and exclusive locks, if any, can be released when the results of the business object services are saved. The interaction phase can additionally or alternatively be completed when results of business object services executed during the interaction phase via the service interface are cleaned up. In some cases, there can be more than one exclusive lock and in such cases the exclusive locks can be transformed to optimistic locks once the first user is assigned the exclusive lock.

"At least one of the optimistic locks can be for a subset of the nodes of the business object with the other nodes of the at least one business object not being locked. Each business object can have an associated at least one lock shadow such that each lock shadow defines a group of at least two nodes that must be concurrently locked. In some variations, the transaction is associated with two or more business objects.

"Computer program products are also described that comprise non-transitory computer readable media storing instructions, which when executed one or more data processor of one or more computing systems, causes at least one data processor to perform operations herein. Similarly, computer systems are also described that may include one or more data processors and a memory coupled to the one or more data processors. The memory may temporarily or permanently store instructions that cause at least one processor to perform one or more of the operations described herein. In addition, methods can be implemented by one or more data processors either within a single computing system or distributed among two or more computing systems.

"The subject matter described herein provides many advantages. For example, the current subject matter provides a mechanism to resolve conflicting modifications to a business object as part of multiple concurrent transactions.

"The details of one or more variations of the subject matter described herein are set forth in the accompanying drawings and the description below. Other features and advantages of the subject matter described herein will be apparent from the description and drawings, and from the claims.

DESCRIPTION OF DRAWINGS

"FIG. 1 is a process flow diagram illustrating an architecture for implementing selective locking of business object data structures, according to one or more variations;

"FIG. 2 is a diagram illustrating a transaction, according to one or more variations;

"FIG. 3 is diagram illustrating an interaction phase of the transaction of FIG. 2, according to one or more variations;

"FIG. 4 is a diagram illustrating a plurality of users interacting with one or more values encapsulated by a business object data structure, according to one or more variations;

"FIG. 5 is a diagram illustrating users having locks on at least a portion of the business object data structure of FIG. 4, according to one or more variations;

"FIG. 6 is a diagram illustrating a lock shadow for a portion of a business object data structure, according to one or more variations;

"FIG. 7 is code illustrating three separate transactions to create a new sales order instance, according to one or more variations; and

"FIG. 8 is a process flow diagram illustrating selectively locking of business object data structures, according to one or more variations.

"Like reference symbols in the various drawings indicate like elements."

For more information, see this patent application: Hackmann, Herbert; Singh, Hardeep; Ibrahim, Fawaz Mohamed; Seitel, Christian. Selective Locking of Business Object Data Structures. Filed December 21, 2012 and posted July 3, 2014. Patent URL: http://appft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&u=%2Fnetahtml%2FPTO%2Fsearch-adv.html&r=1296&p=26&f=G&l=50&d=PG01&S1=20140626.PD.&OS=PD/20140626&RS=PD/20140626

Keywords for this news article include: Patents, Information Technology, Information and Data Architecture.

Our reports deliver fact-based news of research and discoveries from around the world. Copyright 2014, NewsRx LLC


For more stories covering the world of technology, please see HispanicBusiness' Tech Channel



Source: Information Technology Newsweekly


Story Tools






HispanicBusiness.com Facebook Linkedin Twitter RSS Feed Email Alerts & Newsletters