Coarse Grained Web Service Availability, Consistency, and Durability

Olmsted, Aspen; Farkas, Csilla

doi:10.1109/icws.2013.91

Cited by 6 publications

(8 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Constraint specification and enforcement have been a part of relational database model research since Codd [6] originally wrote the specification. Recently work on auto generation of SQL code to enforce these constraints from the UML model has been done by Heidenreich, et al [7] and Demuth, et al [8]. In both these works, the focus is on the generation of the SQL code for relational databases for the invariants.…”

Section: Related Workmentioning

confidence: 99%

“…During the last decade, several methods have been proposed to ensure mutual consistency in the presence of lazy update propagation (see [6] for an overview.) More recently, Snapshot Isolation (SI) [7,8] has been proposed to provide concurrency control in replicated databases. The aim of this approach is to provide global onecopy serializability using SI at each replica.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Service Constraint Guarantees

Olmsted¹,

Stalvey²

2014

IJICR

Self Cite

View full text Add to dashboard Cite

In this paper we investigate the problem of providing consistency, availability and durability for Web Service transactions. We consider enforcement of integrity constraints in a way that increases the availability while guaranteeing the correctness specified in the constraint. We study hierarchical constraints that offer an opportunity for optimization because of an expensive aggregation calculation required in the enforcement of the constraint. We propose an approach that guarantees enforcement of constraints and also allow the distribution of write operations among many clusters to increase the availability. In our previous work, we proposed a replica update propagation method, called the Buddy System, which guaranteed durability and increased availability of web services. In this paper, we extend the Buddy System to enforce hierarchical data integrity constraints.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Service Constraint Guarantees

Olmsted¹,

Stalvey²

2014

IJICR

Self Cite

View full text Add to dashboard Cite

show abstract

“…We needed to use additional data to suppress the elements returned to the client. In previous research, the Buddy System communicated with the client via SOAP requests [8]. The dispatcher would then translate the SOAP requests into a set of CRUD (create, read, update and delete) operations on basic objects.…”

Section: Schemaless Web-servicesmentioning

confidence: 99%

“…Figure 4 shows the modified workflow using the pre and post filters to modify the CRUD data requested by the transaction. On startup, the dispatcher creates a precedence graph based on the semantics of the XMI data (XML representation of the model) that comes from a UML model of the web service [8]. This model allowed the dispatcher to know the low-level CRUD operations of each web service.…”

Section: Soap Filtersmentioning

confidence: 99%

A Customizable and Secure Software Architecture

Olmsted¹,

Stalvey²

2014

IJISR

Self Cite

View full text Add to dashboard Cite

In this paper, we investigate the problem of providing customization opportunities at implementation time while maintaining consistency, high availability and durability for distributed web-service transactions. We consider ways of adding runtime configurable interception points for after release customization while guaranteeing the correctness of the entire operation. We study integration hooks, that offer an opportunity for optimization by allowing the hook to pass data, writes, updates or consumption to the data tier or request additional data from the data tier. In our previous work, we proposed a replica update propagation method called the Buddy System, which guaranteed consistency, durability and increased availability of web services. In this paper, we extend the Buddy System to allow a pipe and filter architecture on incoming requests and the corresponding responses.

show abstract

“…Using the method from our previous work mapping course grained services to fine grained services [18] we are able to auto generate compensators. The use of the compensator allows a single round trip message from the client to the server when the constraints pass on both client and server.…”

Section: Temporal Constraintsmentioning

confidence: 99%

Web Service constraint optimization

Olmsted

Farkas

2013

8th International Conference for Internet Technology and Secured Transactions (ICITST-2013)

Self Cite

View full text Add to dashboard Cite

In this paper we investigate the problem of providing consistency, availability and durability for Web Service transactions. We consider enforcement of inte g rity constraints in a way that increases availability while g uaranteein g the correctness specified in the constraint.We study hierarchical constraints that offer an opportunity for optimization because of an expensive a gg re g ation calculation required in the enforcement of the constraint. We propose an approach that guarantees that the constraint cannot be violated and also allow the distribution of write operations among many clusters to increase availability.In our previous work, we proposed a replica update propagation method, called the Buddy System, which g uaranteed durability and increased availability of web services.In this paper we extend the Buddy System to enforce hierarchical data inte g rity constraints.

show abstract

Coarse Grained Web Service Availability, Consistency, and Durability

Cited by 6 publications

References 1 publication

Service Constraint Guarantees

Service Constraint Guarantees

A Customizable and Secure Software Architecture

Web Service constraint optimization

Contact Info

Product

Resources

About