For large data, data mining methods were used on a Hadoop-based distributed infrastructure, using map reduction paradigm approaches for rapid data processing. Though data mining approaches are established methodologies, the Apriori algorithm provides a specific strategy for increasing data processing performance in big data analytics by applying map reduction. Apriori property is used to increase the efficiency of level-wise creation of frequent itemsets by minimizing the search area. A frequent itemset’s subsets must also be frequent (Apriori property). If an itemset is rarely, then all of its supersets are infrequent as well. We refined the apriori approach by varying the degree of order in locating frequent item sets in large clusters using map reduction programming. Fixed Pass Combined Counting (FPC) and Dynamic Pass Combined Counting (DPC) is a classical algorithm which are used for data processing from the huge datasets but their accuracy is not up to the mark. In this article, updated Apriori algorithms such as multiplied-fixed-pass combined counting (MFPC) and average time-based dynamic combined counting (ATDFC) are used to successfully achieve data processing speed. The proposed approaches are based on traditional Apriori core notions in data mining and will be used in the map-reduce multi-pass phase by ignoring pruning in some passes. The optimized-MFPC and optimized-ATDFC map-reduce framework model algorithms were also presented. The results of the experiments reveal that MFPC and ATDFC are more efficient in terms of execution time than previously outmoded approaches such as Fixed Pass Combined Counting (FPC) and Dynamic Pass Combined Counting (DPC). In a Hadoop multi-node cluster, this paradigm accelerates data processing on big data sets. Previous techniques were stated in terms of reducing execution time by 60–80% through the use of several passes. Because of the omitted trimming operation in data pre-processing, our proposed new approaches will save up to 84–90% of that time.
Improving data processing in big data is a delicate procedure in our current digital era due to the massive amounts of data created by humans and machines in daily life. Handling this data, creating a repository for storage, and retrieving photos from internet platforms is a difficult issue for businesses and industries. Currently, clusters have been constructed for many types of data, such as text, documents, audio, and video files, but the extraction time and accuracy during data processing remain stressful. Hadoop Distributed File System (HDFS) is a system that provides a large storage area in big data for managing large datasets, although the accuracy level is not as high as desired. Furthermore, query optimization was used to produce low latency and high throughput outcomes. To address these concerns, this study proposes a novel technique for query optimization termed the Enhanced Salp Swarm Algorithm (ESSA) in conjunction with the Modified K-Means Algorithm (MKM) for cluster construction. The process is separated into two stages: data collection and organization, followed by data extraction from the repository. Finally, numerous experiments with assessments were carried out, and the outcomes were compared. This strategy provides a more efficient method for enhancing data processing speed in a big data environment while maintaining an accuracy level of 98% while processing large amounts of data.
Web browsers have become an integral part of our daily lives, granting us access to vast information and services. However, this convenience significantly risks personal information and data security. One common source of this risk is browser extensions, which users often employ to add new features to their browsers. Unfortunately, these extensions can also pose a security threat, as malicious ones may access and steal sensitive information such as passwords, credit card details, and personal data. The vulnerability of web browsers to malicious extensions is a significant challenge that effectively tackles through robust defence mechanisms. To address this concern, Secure Vault – API is proposed and designed to safeguard confidential web page content from malicious extensions. The Web Crypto API provides cryptographic functions that protect data during transmission and storage. The Secure Vault encompasses a Sentinel extension responsible for parsing the web page’s Document Object Model (DOM) content and querying for all “vault” elements. The extension then verifies that the DOM content has not been tampered with by any malicious extension by calculating the SHA512 hash value of the concatenated vault elements as a string, with no whitespace between them. With its encryption, hashing, and isolation techniques, the Secure Vault effectively protects confidential web page content from malicious extensions. It provides a secure environment for storing and processing sensitive data, reducing the risk of data breaches caused by malicious extensions. The proposed approach offers significant advantages over existing strategies in terms of protecting confidential web page content from malicious extensions. This not only improves the efficiency and effectiveness of the browser extensions but also ensures compatibility, interoperability and performance across different web browsers with respect to the load time of HTML elements. Users can browse the web and carry out sensitive transactions with peace of mind, knowing their data is safeguarded against theft or manipulation by malicious extensions.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.