This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Nonsensitive Data and Approximate Transactions
May 1983 (vol. 9 no. 3)
pp. 314-322
M.K. Sinha, National Centre for Software Development and Computing Techniques, Tata Institute of Fundamental Research
A methodology has been proposed for solving database problems requiring only approximate solutions. Data items are classified as sensitive and nonsensitive. An approximate transaction modifies only the nonsensitive data items which need not satisfy strong consistency constraints, and provides results only up to a degree of approximation. Further, it is shown that such an approach improves the performance in situations where transaction conflicts are frequent. Additionally, the methodology provides users as well as data managers with mechanisms to control the precision of the computation, preserving the qualitative characteristics of the data items.
Index Terms:
time-stamp ordering, Access synchronization, approximation, concurrency control, deadlock, decentralized system, locking, object model
Citation:
M.K. Sinha, "Nonsensitive Data and Approximate Transactions," IEEE Transactions on Software Engineering, vol. 9, no. 3, pp. 314-322, May 1983, doi:10.1109/TSE.1983.236867
Usage of this product signifies your acceptance of the Terms of Use.