Mixing Selections and Foreign Key Joins in Queries against Possibilistic Databases

Author(s):  
Patrick Bosc ◽  
Olivier Pivert
Keyword(s):  
Author(s):  
Adesina S. Sodiya ◽  
Adegbuyi B.

Data and document privacy concerns are increasingly important in the online world. In Cloud Computing, the story is the same, as the secure processing of personal data represents a huge challenge. The main focus is to preserve and protect personally identifiable information (PII) of individuals, customers, businesses, governments and organisations. The current use of anonymization techniques is not quite efficient because of its failure to use the structure of the datasets under consideration and inability to use a metric that balances the usefulness of information with privacy preservation. In this work, an adaptive lossy decomposition algorithm was developed for preserving privacy in cloud computing. The algorithm uses the foreign key associations to determine the generalizations possible for any attribute in the database. It generates penalties for each obscured attribute when sharing and proposes an optimal decomposition of the relation. Postgraduate database of Federal University of Agriculture, Abeokuta, Nigeria and Adult database provided at the UCIrvine Machine Learning Repository were used for the evaluation. The result shows a system that could be used to improve privacy in cloud computing.


Author(s):  
Martin H. Weik
Keyword(s):  

2019 ◽  
Vol 54 (3) ◽  
pp. 439-461 ◽  
Author(s):  
Lan Jiang ◽  
Felix Naumann
Keyword(s):  

Author(s):  
Михаил Владимирович Коломыцев ◽  
Светлана Александровна Носок ◽  
Анастасия Евгениевна Мазуренко
Keyword(s):  

2016 ◽  
Vol 10 (4) ◽  
pp. 33-43 ◽  
Author(s):  
Adesina S. Sodiya ◽  
Adegbuyi B.

Data and document privacy concerns are increasingly important in the online world. In Cloud Computing, the story is the same, as the secure processing of personal data represents a huge challenge The main focus is to to preserve and protect personally identifiable information (PII) of individuals, customers, businesses, governments and organisations. The current use of anonymization techniques is not quite efficient because of its failure to use the structure of the datasets under consideration and inability to use a metric that balances the usefulness of information with privacy preservation. In this work, an adaptive lossy decomposition algorithm was developed for preserving privacy in cloud computing. The algorithm uses the foreign key associations to determine the generalizations possible for any attribute in the database. It generates penalties for each obscured attribute when sharing and proposes an optimal decomposition of the relation. Postgraduate database of Federal University of Agriculture, Abeokuta, Nigeria and Adult database provided at the UCIrvine Machine Learning Repository were used for the evaluation. The result shows a system that could be used to improve privacy in cloud computing.


Author(s):  
Adesina S. Sodiya ◽  
Adegbuyi B.

Data and document privacy concerns are increasingly important in the online world. In Cloud Computing, the story is the same, as the secure processing of personal data represents a huge challenge. The main focus is to preserve and protect personally identifiable information (PII) of individuals, customers, businesses, governments and organisations. The current use of anonymization techniques is not quite efficient because of its failure to use the structure of the datasets under consideration and inability to use a metric that balances the usefulness of information with privacy preservation. In this work, an adaptive lossy decomposition algorithm was developed for preserving privacy in cloud computing. The algorithm uses the foreign key associations to determine the generalizations possible for any attribute in the database. It generates penalties for each obscured attribute when sharing and proposes an optimal decomposition of the relation. Postgraduate database of Federal University of Agriculture, Abeokuta, Nigeria and Adult database provided at the UCIrvine Machine Learning Repository were used for the evaluation. The result shows a system that could be used to improve privacy in cloud computing.


Author(s):  
Xiaojie Yuan ◽  
Xiangrui Cai ◽  
Man Yu ◽  
Chao Wang ◽  
Ying Zhang ◽  
...  

2018 ◽  
Vol 37 (4) ◽  
pp. 469-506 ◽  
Author(s):  
Yansong Zhang ◽  
Yu Zhang ◽  
Xuan Zhou ◽  
Jiaheng Lu
Keyword(s):  

10.28945/2245 ◽  
2015 ◽  
Author(s):  
Robert Thomas Mason

NoSQL databases are an important component of Big Data for storing and retrieving large volumes of data. Traditional Relational Database Management Systems (RDBMS) use the ACID theorem for data consistency, whereas NoSQL Databases use a non-transactional approach called BASE. RDBMS scale vertically and NoSQL Databases can scale both horizontally (sharding) and vertically. Four types of NoSQL databases are Document-oriented, Key-Value Pairs, Column-oriented and Graph. Data modeling for Document-oriented databases is similar to data modeling for traditional RDBMS during the conceptual and logical modeling phases. However, for a physical data model, entities can be combined (denormalized) by using embedding. What was once called a foreign key in a traditional RDBMS is now called a reference in a Document-oriented NoSQL database.


Sign in / Sign up

Export Citation Format

Share Document