DocumentCode :
754533
Title :
Nonsensitive Data and Approximate Transactions
Author :
Sinha, Mukul K.
Author_Institution :
National Centre for Software Development and Computing Techniques, Tata Institute of Fundamental Research
Issue :
3
fYear :
1983
fDate :
5/1/1983 12:00:00 AM
Firstpage :
314
Lastpage :
322
Abstract :
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.
Keywords :
Access synchronization; approximation; concurrency control; deadlock; decentralized system; locking; object model; time-stamp ordering; Concurrency control; Programming; Quality management; System recovery; Transaction databases; Access synchronization; approximation; concurrency control; deadlock; decentralized system; locking; object model; time-stamp ordering;
fLanguage :
English
Journal_Title :
Software Engineering, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-5589
Type :
jour
DOI :
10.1109/TSE.1983.236867
Filename :
1703059
Link To Document :
بازگشت