Dr. Pooja Sapra - Academia.edu (original) (raw)
Papers by Dr. Pooja Sapra
— Database security mainly deal with the secrecy, integrity and availability of data stored in a ... more — Database security mainly deal with the secrecy, integrity and availability of data stored in a database. The common threats to the databases involve Privilege Abuse, Weak Authentication, Weak Audit Trails and Operating System Vulnerabilities. To make the security least compromised; all users are required to follow the rules set up by Database Administrator. These rules are said to be Mandatory Access Control (MAC) based security policies. The Multi-Level secure Databases are implemented by considering these policies. A multilevel secure database provides internal security to the database. The data stored in MLS databases is classified in several levels of sensitivity. A user is allowed to access the data that matches its classification level. The user classification is referred to clearance levels. Therefore, users with different clearance levels access different versions of data. Due to the various issues like Covert channel, Polyinstantiation and lack of security while transmitt...
With the exponential growth in data collection and number of users, the privacy preservation beco... more With the exponential growth in data collection and number of users, the privacy preservation becomes the major issue in design and implement of various database system. Today the basic privacy solution is considered to be Hippocratic database. Our major concern is to get the solution of problems in LD of Hippocratic database. Hence we will formulate the basic privacy laws. On the basis of there laws we will give a chain antology based model to get the solution of LD. Categories and Subject Descriptors
As the need of distributed processing increases, the complexity in handling of deadlocks also inc... more As the need of distributed processing increases, the complexity in handling of deadlocks also increases. In distributed databases, the conditions for the deadlocks are same as that in centralized but harder to detect, avoid and prevent. Therefore special procedures are required to resolve the deadlock. In this paper we propose a new distributed deadlock detection and recovery algorithm that not only detects deadlock but also resolve them efficiently by aborting less number of transactions. We also present comparative analysis of the proposed algorithm and observed that the proposed algorithm reduces the number of transactions that are to be aborted to resolve the deadlocks, thus improving the performance of the system.
2016 3rd International Conference on Computing for Sustainable Global Development (INDIACom), 2016
Due to the tremendous growth of internet over the past few years, a large repository of data cove... more Due to the tremendous growth of internet over the past few years, a large repository of data covering almost every area has been formed over the web and as a result of which search engine users are facing a lot of problems in retrieving the most appropriate information out of it which is known as information overkill problem. The main cause of this problem is non-optimization of web pages. This paper is to present a way for investigation of transaction logs obtained by search engines to optimize rank of web pages and then resulting into the topic/subject relevant and user suitable documents at the top of the result pages of search engine. The proposed algorithm starts with query logs maintained by a search engine to get an insight into the exact information need of users. Then, a novel approach is used to find similarity among queries based on two silent features i.e. query keywords and clicked URLs. Further, query cluster making tool is used to form clusters of same kind of queries...
An attempt has been made at Department of Horticulture, C.S.S.S. (P.G.) College, Machhra, Meerut ... more An attempt has been made at Department of Horticulture, C.S.S.S. (P.G.) College, Machhra, Meerut to evaluate genetic variability in bael fruits grown in western Uttar Pradesh. Ripe fruits of bael from seedling trees of diverse origin were collected from 36 villages of 12 C.D. Blocks of Meerut, Bulandshahar and Baghpat districts. Fruits collected 1rom each block were asaumed as a specific genotype of bael and denoted as Bael Type with a given number, i.e., BT-1 to BT-12. All of the fruits from a Block were replicated thrice and analyzed for their physico-chemical properties. Findings revealed that there was great geneticai variation In physcio-chemical attributes in fruits of bael stra!ns studied. Bael Type-a collected from Chhapraull C.D. block of Baghpat district had highest fruit weight as well as fruit volume and pulp contentlfruit followed by BT-7 collected from Binnaull block 01 the same district, and they were vice-versa for polar and transverse diameters of fruits. Peel conto...
Lecture Notes on Data Engineering and Communications Technologies
Lecture Notes on Data Engineering and Communications Technologies
Journal of Computer and Communications
Manipuri traditional game Kei-Yen, which originates from the ancient Meitei mythological story, i... more Manipuri traditional game Kei-Yen, which originates from the ancient Meitei mythological story, is a mind game between two players of different mindsets, one has the mindset of killing (Kei), whereas the other (Yen) has the mindset of protecting itself and block the moves of Kei. We propose and develop an algorithm of this game by incorporating various possible logical tactics and strategies for a possible computer software of this game. Since this game involves various logical mind games, playing this game can improve our way of thinking, strategies, tricks and other skills related to mind game. In this play there is not the case of draw which means one has to win over the other at the end of the game. This game could become one of most interesting indoor national or international game.
International Journal of Computer Applications, 2010
2014 International Conference on Reliability Optimization and Information Technology (ICROIT), 2014
Multilevel secure database systems are the systems in which security classifications are assigned... more Multilevel secure database systems are the systems in which security classifications are assigned from the relations to data elements. Due to security requirements of databases, the concurrency control mechanisms for such databases are different than the concurrency control mechanisms in traditional databases. In this paper, we present a new algorithm for concurrency control that is shown to be starvation-free to some extent.
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology - CCSEIT '12, 2012
ABSTRACT In this paper, we consider multilevel relational database system in which security class... more ABSTRACT In this paper, we consider multilevel relational database system in which security classifications are assigned at the granularity of individual data elements. Usually these multilevel relations exist only at the logical level. In reality, a multilevel relation is decomposed into a collection of single-level relations which are then physically stored in a database, and then a recovery algorithm is used to reconstruct the original multilevel relation. The security considerations require that accessibility of the database must be provided at different levels of security while keeping the optimal performance of the whole system. Here we present comparative analysis of the working of SeaView decomposition and recovery algorithm, decomposition and recovery model and later novel decomposition algorithm proposed by Jojodia and Sandhu to bring out their salient features of the multilevel database systems.
2014 IEEE International Advance Computing Conference (IACC), 2014
Hardware enclaves such as Intel SGX are a promising technology for improving the security of data... more Hardware enclaves such as Intel SGX are a promising technology for improving the security of databases outsourced to the cloud. These enclaves provide an execution environment isolated from the hypervisor/OS, and encrypt data in RAM. However, for applications that use large amounts of memory, including most databases, enclaves do not protect against access pattern leaks, which let attackers gain a large amount of information about the data. Moreover, the naïve way to address this issue, using Oblivious RAM (ORAM) primitives from the security literature, adds substantial overhead. A number of recent works explore trusted hardware enclaves as a path toward secure, access-pattern oblivious outsourcing of data storage and analysis. While these works efficiently solve specific subproblems (e.g. building secure indexes or running analytics queries that always scan entire tables), no prior work has supported oblivious query processing for general query workloads on a DBMS engine with multiple access methods. Moreover, applying these techniques individually does not guarantee that an end-to-end workload, such as a complex SQL query over multiple tables, will be oblivious. In this paper, we introduce ObliDB, an oblivious database engine design that is the first system to provide obliviousness for general database read workloads over multiple access methods. ObliDB introduces a diverse array of new oblivious physical operators to accelerate oblivious SQL queries, giving speedups of up to an order of magnitude over naïve ORAM. It supports a broad range of queries, including aggregation, joins, insertions, deletions and point queries. We implement ObliDB and show that, on analytics workloads, ObliDB ranges from 1.1-19× faster than Opaque, a previous oblivious, enclave-based system designed only for analytics, and comes within 2.6× of Spark SQL, which provides no security guarantees. In addition, ObliDB supports point queries with 3-10ms latency, which is comparable to index-only trusted hardware systems, and runs over 7× faster than HIRB, a previous encryption-based oblivious index system that supports point queries.
International Journal of Computer Applications, 2010
International Journal of Computer Applications, 2013
As the need of distributed processing increases, the complexity in handling of deadlocks also inc... more As the need of distributed processing increases, the complexity in handling of deadlocks also increases. In distributed databases, the conditions for the deadlocks are same as that in centralized but harder to detect, avoid and prevent. Therefore special procedures are required to resolve the deadlock. In this paper we propose a new distributed deadlock detection and recovery algorithm that not only detects deadlock but also resolve them efficiently by aborting less number of transactions. We also present comparative analysis of the proposed algorithm and observed that the proposed algorithm reduces the number of transactions that are to be aborted to resolve the deadlocks, thus improving the performance of the system.
— Database security mainly deal with the secrecy, integrity and availability of data stored in a ... more — Database security mainly deal with the secrecy, integrity and availability of data stored in a database. The common threats to the databases involve Privilege Abuse, Weak Authentication, Weak Audit Trails and Operating System Vulnerabilities. To make the security least compromised; all users are required to follow the rules set up by Database Administrator. These rules are said to be Mandatory Access Control (MAC) based security policies. The Multi-Level secure Databases are implemented by considering these policies. A multilevel secure database provides internal security to the database. The data stored in MLS databases is classified in several levels of sensitivity. A user is allowed to access the data that matches its classification level. The user classification is referred to clearance levels. Therefore, users with different clearance levels access different versions of data. Due to the various issues like Covert channel, Polyinstantiation and lack of security while transmitt...
With the exponential growth in data collection and number of users, the privacy preservation beco... more With the exponential growth in data collection and number of users, the privacy preservation becomes the major issue in design and implement of various database system. Today the basic privacy solution is considered to be Hippocratic database. Our major concern is to get the solution of problems in LD of Hippocratic database. Hence we will formulate the basic privacy laws. On the basis of there laws we will give a chain antology based model to get the solution of LD. Categories and Subject Descriptors
As the need of distributed processing increases, the complexity in handling of deadlocks also inc... more As the need of distributed processing increases, the complexity in handling of deadlocks also increases. In distributed databases, the conditions for the deadlocks are same as that in centralized but harder to detect, avoid and prevent. Therefore special procedures are required to resolve the deadlock. In this paper we propose a new distributed deadlock detection and recovery algorithm that not only detects deadlock but also resolve them efficiently by aborting less number of transactions. We also present comparative analysis of the proposed algorithm and observed that the proposed algorithm reduces the number of transactions that are to be aborted to resolve the deadlocks, thus improving the performance of the system.
2016 3rd International Conference on Computing for Sustainable Global Development (INDIACom), 2016
Due to the tremendous growth of internet over the past few years, a large repository of data cove... more Due to the tremendous growth of internet over the past few years, a large repository of data covering almost every area has been formed over the web and as a result of which search engine users are facing a lot of problems in retrieving the most appropriate information out of it which is known as information overkill problem. The main cause of this problem is non-optimization of web pages. This paper is to present a way for investigation of transaction logs obtained by search engines to optimize rank of web pages and then resulting into the topic/subject relevant and user suitable documents at the top of the result pages of search engine. The proposed algorithm starts with query logs maintained by a search engine to get an insight into the exact information need of users. Then, a novel approach is used to find similarity among queries based on two silent features i.e. query keywords and clicked URLs. Further, query cluster making tool is used to form clusters of same kind of queries...
An attempt has been made at Department of Horticulture, C.S.S.S. (P.G.) College, Machhra, Meerut ... more An attempt has been made at Department of Horticulture, C.S.S.S. (P.G.) College, Machhra, Meerut to evaluate genetic variability in bael fruits grown in western Uttar Pradesh. Ripe fruits of bael from seedling trees of diverse origin were collected from 36 villages of 12 C.D. Blocks of Meerut, Bulandshahar and Baghpat districts. Fruits collected 1rom each block were asaumed as a specific genotype of bael and denoted as Bael Type with a given number, i.e., BT-1 to BT-12. All of the fruits from a Block were replicated thrice and analyzed for their physico-chemical properties. Findings revealed that there was great geneticai variation In physcio-chemical attributes in fruits of bael stra!ns studied. Bael Type-a collected from Chhapraull C.D. block of Baghpat district had highest fruit weight as well as fruit volume and pulp contentlfruit followed by BT-7 collected from Binnaull block 01 the same district, and they were vice-versa for polar and transverse diameters of fruits. Peel conto...
Lecture Notes on Data Engineering and Communications Technologies
Lecture Notes on Data Engineering and Communications Technologies
Journal of Computer and Communications
Manipuri traditional game Kei-Yen, which originates from the ancient Meitei mythological story, i... more Manipuri traditional game Kei-Yen, which originates from the ancient Meitei mythological story, is a mind game between two players of different mindsets, one has the mindset of killing (Kei), whereas the other (Yen) has the mindset of protecting itself and block the moves of Kei. We propose and develop an algorithm of this game by incorporating various possible logical tactics and strategies for a possible computer software of this game. Since this game involves various logical mind games, playing this game can improve our way of thinking, strategies, tricks and other skills related to mind game. In this play there is not the case of draw which means one has to win over the other at the end of the game. This game could become one of most interesting indoor national or international game.
International Journal of Computer Applications, 2010
2014 International Conference on Reliability Optimization and Information Technology (ICROIT), 2014
Multilevel secure database systems are the systems in which security classifications are assigned... more Multilevel secure database systems are the systems in which security classifications are assigned from the relations to data elements. Due to security requirements of databases, the concurrency control mechanisms for such databases are different than the concurrency control mechanisms in traditional databases. In this paper, we present a new algorithm for concurrency control that is shown to be starvation-free to some extent.
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology - CCSEIT '12, 2012
ABSTRACT In this paper, we consider multilevel relational database system in which security class... more ABSTRACT In this paper, we consider multilevel relational database system in which security classifications are assigned at the granularity of individual data elements. Usually these multilevel relations exist only at the logical level. In reality, a multilevel relation is decomposed into a collection of single-level relations which are then physically stored in a database, and then a recovery algorithm is used to reconstruct the original multilevel relation. The security considerations require that accessibility of the database must be provided at different levels of security while keeping the optimal performance of the whole system. Here we present comparative analysis of the working of SeaView decomposition and recovery algorithm, decomposition and recovery model and later novel decomposition algorithm proposed by Jojodia and Sandhu to bring out their salient features of the multilevel database systems.
2014 IEEE International Advance Computing Conference (IACC), 2014
Hardware enclaves such as Intel SGX are a promising technology for improving the security of data... more Hardware enclaves such as Intel SGX are a promising technology for improving the security of databases outsourced to the cloud. These enclaves provide an execution environment isolated from the hypervisor/OS, and encrypt data in RAM. However, for applications that use large amounts of memory, including most databases, enclaves do not protect against access pattern leaks, which let attackers gain a large amount of information about the data. Moreover, the naïve way to address this issue, using Oblivious RAM (ORAM) primitives from the security literature, adds substantial overhead. A number of recent works explore trusted hardware enclaves as a path toward secure, access-pattern oblivious outsourcing of data storage and analysis. While these works efficiently solve specific subproblems (e.g. building secure indexes or running analytics queries that always scan entire tables), no prior work has supported oblivious query processing for general query workloads on a DBMS engine with multiple access methods. Moreover, applying these techniques individually does not guarantee that an end-to-end workload, such as a complex SQL query over multiple tables, will be oblivious. In this paper, we introduce ObliDB, an oblivious database engine design that is the first system to provide obliviousness for general database read workloads over multiple access methods. ObliDB introduces a diverse array of new oblivious physical operators to accelerate oblivious SQL queries, giving speedups of up to an order of magnitude over naïve ORAM. It supports a broad range of queries, including aggregation, joins, insertions, deletions and point queries. We implement ObliDB and show that, on analytics workloads, ObliDB ranges from 1.1-19× faster than Opaque, a previous oblivious, enclave-based system designed only for analytics, and comes within 2.6× of Spark SQL, which provides no security guarantees. In addition, ObliDB supports point queries with 3-10ms latency, which is comparable to index-only trusted hardware systems, and runs over 7× faster than HIRB, a previous encryption-based oblivious index system that supports point queries.
International Journal of Computer Applications, 2010
International Journal of Computer Applications, 2013
As the need of distributed processing increases, the complexity in handling of deadlocks also inc... more As the need of distributed processing increases, the complexity in handling of deadlocks also increases. In distributed databases, the conditions for the deadlocks are same as that in centralized but harder to detect, avoid and prevent. Therefore special procedures are required to resolve the deadlock. In this paper we propose a new distributed deadlock detection and recovery algorithm that not only detects deadlock but also resolve them efficiently by aborting less number of transactions. We also present comparative analysis of the proposed algorithm and observed that the proposed algorithm reduces the number of transactions that are to be aborted to resolve the deadlocks, thus improving the performance of the system.