ACM Access control using k-anonymity, query evaluate on outsourced database
Abstract
Top down Selection Mondrian (TDSM) algorithm is utilized for query workload-predicated anonymization algorithm is constructed utilizing acquisitive heuristics and kd-tree model. Query cuts are culled with minimum bounds in Top-Down Heuristic1 algorithm (TDH1). The query jumps are modified as the partitions are integrated to the output in Top-Down Heuristic 2 algorithm (TDH2). The price of decreased accuracy in the query results is utilized in Top-Down Heuristic 3 algorithm (TDH3). Repartitioning algorithm is utilized to reduce the total imprecision for the queries. The privacy preserved access control framework is enhanced to provide incremental mining features utilizing R+-tree. Data insert, expunge and update operations are associated with the partition management mechanism.
Keywords
Access control; k-anonymity; query evaluation; outsourced database; Access Control Mechanisms (ACM); Role-predicated access control; Privacy Auspice Mechanism
Full Text:
PDFCopyright (c) 2015 Ghousia Begum, M. Mohanrao
![Creative Commons License](http://licensebuttons.net/l/by-nc-sa/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
All published Articles are Open Access at https://journals.pen2print.org/index.php/ijr/
Paper submission: ijr@pen2print.org