Data Cache Research Articles

Deep deterministic policy gradient caching method for privacy protection in Internet of Vehicles

To address the problem of low cache hit ratio in edge nodes for privacy-preserving in the Internet of Vehicles (IoV), a deep deterministic policy gradient caching (DDPGC) method was proposed. First, a taxi certified by a trusted authority acted as a second-level caching edge node to acquire hotspot data and store it in the local cache. It then broadcasted this information to the neighboring service requesting vehicles (SRVs). SRVs cached the broadcasted data locally and search for service requests in the order of priority of local cache, taxi, and cloud server when such requests arise. Secondly, a neural network was deployed in taxis and SRVs to maximize the caching benefit through deep reinforcement learning for decision replacement of their cached data. Finally, when SRVs were located in vehicle sparsity and could not obtain request data from neighboring vehicles, a combination of k-anonymity and random response perturbation mechanisms generated anonymity sets to send requests to cloud servers in an anonymous manner to obtain services while protecting user location privacy. Simulation experimental results show that DDPGC can effectively improve the vehicle cache hit ratio, reduce the frequency of SRV interaction with the cloud server, and effectively protect user privacy security.

Hybrid Shared-Buffer for Multi-Master Databases

Distributed shared buffer (DSB) is a well-known solution to support multi-master database systems. DSB involves controlling access to shared data among different nodes through a distributed shared buffer and lock-based cache coherence protocols. Existing DSB implementations resolve conflicts at the page level and lack the flexibility required by modern cloud database systems. Authors present HyBuffer which mixes rows and pages in the distributed shared buffer. It enables multiple masters to independently modify different rows on the same page, thereby enhancing concurrency and performance. HyBuffer adopts the hybrid design to track the location information of cached data. A centralized node maintains page locations indicating which masters have cached which pages, and the record locations of a cached page are maintained by the master which has cached this page. This design eliminates the need to redistribute metadata when dynamically adding or removing masters. Experimental results demonstrate that HyBuffer achieves better scalability and performance compared to existing approaches.

Optimization model for vehicular network data queries in edge environments

As the Internet of Vehicles advances, the demand for timely data acquisition by vehicle users continues to escalate, albeit confronted with the challenge of excessive data retrieval latency. The emergence of edge computing provides technical support for the development of vehicular networks by caching data in advance to reduce data acquisition latency. Therefore, how to effectively cache and query data becomes a key issue in addressing the timeliness of data acquisition in vehicular networks. In this paper, we investigate an efficient query optimization model to minimize data acquisition latency. Firstly, based on the distribution of data query frequencies across different servers, we propose an edge collaborative caching strategy using a tabu search algorithm. This strategy prioritizes high-traffic data by finding two optimal storage nodes for each high-traffic data in descending order of data popularity, ensuring a backup within the collaborative domain for each data segment. This not only reduces data transmission latency between nodes during task execution but also prevents single-point failures. Secondly, we deploy cuckoo filters on edge nodes to enable rapid localization of cached data nodes when users query data, thus reducing data processing latency. Finally, simulation results demonstrate that the proposed query optimization model outperforms other schemes in terms of average data query latency.

Research on Construction of Offline Data Warehouse for Ship Shore Power based on DolphinScheduler and Hive

In today's networked, intelligent, and data-driven era, the shore power industry is facing the challenge of rapidly growing data. This paper presents the construction of a professional offline data warehouse system for shore power based on DolphinScheduler and Hive. Firstly, MySQL is adopted as the backend database, combined with Sqoop to synchronize business data to HDFS, ensuring data reliability and integrity. Secondly, the Flume-Kafka-Flume architecture is utilized to achieve real-time collection and caching of user behavior data, providing data support for subsequent analysis. Thirdly, HQL statements are written in Hive to clean, merge, and analyze shore power data, calculating key indicators such as electricity consumption and usage trends. Fourthly, data visualization is achieved through the integration of Superset, displaying data analysis results via a web interface. Fifthly, DolphinScheduler is employed for timed scheduling, ensuring dependency control among various tasks and the smooth operation of the project. This system fully leverages the replication mechanism of HDFS to enhance reliability, dynamically adds nodes to achieve system scalability, and fully utilizes the fault tolerance of the Yarn scheduler. It saves time and computational costs for the shore power industry, realizing higher value and benefits.

HEMLAB Algorithm Applied to the High-Lift Japan Aerospace Exploration Agency Standard Model

The high-lift Japan Aerospace Exploration Agency (JAXA) standard model (HL-JSM) has been numerically analyzed in order to further validate the HEMLAB code for realistic aircraft configurations. The numerical algorithm is based on highly efficient edge-based data structure for a vertex-based finite volume algorithm on hybrid meshes. The data pattern is arranged to meet the requirements of a vertex-based finite volume algorithm by considering data access patterns and cache efficiency. A fully implicit version of the numerical algorithm has also been implemented based on the Portable, Extensible Toolkit for Scientific Computation (PETSc) library in order to improve the robustness of the algorithm. The resulting algebraic equations, including the one-equation Spalart–Allmaras, are solved in a monolithic manner using the restricted additive Schwarz preconditioner combined with the flexible generalized minimal residual method [FGMRES(m)] Krylov subspace algorithm. The numerical method is also combined with the metric-based anisotropic mesh refinement library Python Adaptive Mesh Geometry Suite–INRIA (pyAMG) from National Institute for Research in Digital Science and Technology in order to improve the numerical accuracy. The numerical algorithm is initially applied to the two-dimensional L1T2 (National High Lift Programme) high-lift system, and then the calculations around the HL-JSM are carried out at relatively high angles of attack. The numerical results with the anisotropic mesh refinement library pyAMG indicate significant improvements in numerical accuracy.

Leadership in Platform Engineering: Best Practices for High-Traffic E-Commerce Retail Applications

High-traffic retail applications need great platform engineering leadership to assure operational excellence and scalability in the continually changing e-commerce industry. This study examines how leadership matters in platform engineering for high-traffic e-commerce retail systems. It covers best practices, methods, and frameworks for managing and optimizing platforms with high traffic and flawless user experiences. The report defines platform engineering executives' key duties as connecting technology strategy with business objectives. Platform engineering leaders must be technical, innovative, manage cross-functional teams, and respond to market changes. Leaders must promote continual development and adaptability to maintain high performance in dynamic e-commerce settings. it focuses on the architectural design concepts that support high-traffic e-commerce systems. Leaders must ensure platform design is durable, scalable, and can handle peak traffic without performance deterioration. The article explores microservices architectures, containerization, and cloud-native solutions for scalability and flexibility. Effective data management and caching are also investigated to improve platform performance and user experience. Security is another important paper topic. E-commerce sites are obvious targets for cyberattacks, therefore executives must employ robust security measures. Proactive security, strict access limits, and vulnerability monitoring are best practices. The article emphasizes the need of data protection rules and industry standards to secure consumer data and build confidence.

Upscaling Current Data Caching and Prefetching Strategies for Online Databases in Nigeria

This study investigated upscaling current data caching and prefetching strategies for online databases in Nigeria, with a focus on practical implications. The research design adopted for this study was the descriptive survey. The population comprised of all undergraduate’s library students in public tertiary institutions in Ekiti State. A simple random sampling technique was adopted to select 200 library students from Ekiti State University in the study area. The instrument used for data collection was a structured 4 Likert type questionnaire. The questionnaire was distributed to the respondents to find out the effectiveness of caching and prefetching techniques on online databases. The instrument was both face and content validated by two experts from the department of Library studies in Ekiti State University, Ado-Ekiti State. The reliability of the instrument was ensured using Pearson Product Moment Correlation formula which yielded a coefficient of 0.99. The data collected were analyzed using descriptive statistics such as mean and standard deviation. The result showed that the current caching and prefetching techniques employed in online databases are highly effective; the different access patterns have effect on the effectiveness of caching and prefetching techniques in online databases and there are impacts of cache coherence mechanisms on the efficiency of caching and prefetching techniques in online databases. It was therefore recommended that the inclusion of caching and prefetching in curriculum is important across all educational level in Nigeria, with a clear emphasis on the practical implications. In addition, caching and perfecting have come under fire for focusing mostly on computer science.

A New Approach to Recording Rumination Behavior in Dairy Cows.

Rumination behavior in cattle can provide valuable information for monitoring health status and animal welfare, but continuous monitoring is essential to detect changes in rumination behavior. In a previous study validating the use of a respiration rate sensor equipped with a triaxial accelerometer, the regurgitation process was also clearly visible in the pressure and accelerometer data. The aim of the present study, therefore, was to measure the individual lengths of rumination cycles and to validate whether the sensor data showed the same number of regurgitations as those counted visually (video or direct observation). For this purpose, 19 Holstein Friesian cows equipped with a respiration rate sensor were observed for two years, with a focus on rumination behavior. The results showed a mean duration of 59.27 ± 9.01 s (mean ± SD) per rumination cycle and good agreement (sensitivity: 99.1-100%, specificity: 87.8-95%) between the two methods (sensor and visual observations). However, the frequency of data streaming (continuously or every 30 s) from the sensor to the data storage system strongly influenced the classification performance. In the future, an algorithm and a data cache will be integrated into the sensor to provide rumination time as an additional output.

SSF-CDW: achieving scalable, secure, and fast OLAP query for encrypted cloud data warehouse

Implementing a cloud-based data warehouse to store sensitive or critical strategic data presents challenges primarily related to the security of the stored information and the exchange of OLAP queries between the cloud server and users. Although encryption is a viable solution for safeguarding outsourced data, applying it to OLAP queries involving multidimensional data, measures, and Multidimensional Expressions (MDX) operations on encrypted data poses difficulties. Existing searchable encryption solutions are inadequate for handling such complex queries, which complicates the use of business intelligence tools that rely on efficient and secure data processing and analysis.This paper proposes a new privacy-preserving cloud data warehouse scheme called SSF-CDW which facilitates a secure and scalable solution for an encrypted cloud data warehouse. Our SSF-CDW improves the OLAP queries accessible only to authorized users who can decrypt the query results with improved query performance compared to traditional OLAP tools. The approach involves utilizing symmetric encryption and Ciphertext Policy Attribute-Based Encryption (CP-ABE) to protect the privacy of the dimension and fact data modeled in Multidimensional OLAP (MOLAP). To support efficient OLAP query execution, we proposed a new data cube retrieval mechanism using a Redis schema which is an in-memory database. This technique dynamically compiles queries by disassembling them down into multiple levels and consolidates the results mapped to the corresponding encrypted data cube. The caching of dimensional and fact data associated with the encrypted cube is also implemented to improve the speed of frequently queried data. Experimental comparisons between our proposed indexed search strategy and other indexing schemes demonstrate that our approach surpasses alternative techniques in terms of search speed for both ad-hoc and repeated OLAP queries, all while preserving the privacy of the query results.

Cache blocking for flux reconstruction: Extension to Navier-Stokes equations and anti-aliasing

In this article, cache blocking is implemented for the Navier Stokes equations with anti-aliasing support on mixed grids in PyFR for CPUs. In particular, cache blocking is used as an alternative to kernel fusion to eliminate unnecessary data movements between kernels at the main memory level. Specifically, kernels that exchange data are grouped together, and these groups are then executed on small sub-regions of the domain that fit in per-core private data cache. Additionally, cache blocking is also used to efficiently implement a tensor product factorisation of the interpolation operators associated with anti-aliasing. By using cache blocking, the intermediate results between application of the sparse factors are stored in per-core private data cache, and a significant amount of data movement from main memory is avoided. In order to assess the performance gains a theoretical model is developed, and the implementation is benchmarked using a compressible 3D Taylor-Green vortex test case on both hexahedral and prismatic grids, with third-, fourth-, and fifth-order solution polynomials. The expected performance gains based on the theoretical model range from 1.99 to 2.83, and the speedups obtained in practice range from 1.51 to 3.91 compared to PyFR v1.11.0.

Blockchain-Based Caching Architecture for DApp Data Security and Delivery.

Decentralized applications (DApps) built on blockchain technology offer a promising solution to issues caused by centralization. However, traditional DApps leveraging off-chain storage face performance challenges due to factors such as storage location, network speed, and hardware conditions. For example, decentralized storage solutions such as IPFS suffer from diminished download performance due to I/O constraints influenced by data access patterns. Aiming to enhance the Quality of Service (QoS) in DApps built on blockchain technology, this paper proposes a blockchain node-based distributed caching architecture that guarantees real-time responsiveness for users. The proposed architecture ensures data integrity and user data ownership through blockchain while maintaining cache data consistency through local blockchain data. By implementing local cache clusters on blockchain nodes, our system achieves rapid response times. Additionally, attribute-based encryption is applied to stored content, enabling secure content sharing and access control, which prevents data leakage and unauthorized access in unreliable off-chain storage environments. Comparative analysis shows that our proposed system achieves a reduction in request processing latency of over 89% compared to existing off-chain solutions, maintaining cache data consistency and achieving response times within 65 ms. This demonstrates the model's effectiveness in providing secure and high-performance DApp solutions.

Genetic Algorithm-Based Cooperative Coding and Caching Data Dissemination Scheme in Multi-UAV-Enabled Internet of Vehicles.

Unmanned Aerial Vehicles (UAVs) have emerged as efficient tools in disaster-stricken areas, facilitating efficient data dissemination for post-disaster rescue operations. However, the limited onboard energy of UAVs imposes significant constraints on their operational lifespan, thereby presenting substantial challenges for efficient data dissemination. Therefore, this work investigates a data dissemination scheme to enhance the UAVs' bandwidth efficiency in multi-UAV-enabled Internet of Vehicles, thereby reducing UAVs' energy consumption and improving overall system performance when UAVs hover along designated flight trajectories for data dissemination. Specifically, first, we present a software-defined network-based framework for data dissemination in multi-UAV-enabled IoV. According to this framework, we formulate a problem called C2BS (Coding-based Cooperative Broadcast Scheduling) that focuses on optimizing the UAVs' bandwidth efficiency by leveraging the combined benefits of coding and caching. Furthermore, we demonstrate the NP-hardness of the C2BS problem by employing a polynomial time reduction technique on the simultaneous matrix completion problem. Then, inspired by the benefits offered by genetic algorithms, we propose a novel approach called the Genetic algorithm-based Cooperative Scheduling (GCS) algorithm to address the C2BS problem. This approach encompasses a coding scheme for representing individuals, a fitness function for assessing individuals, operators (i.e., crossover and mutation) for generating offspring, a local search technique to enhance search performance, and a repair operator employed to rectify infeasible solutions. Additionally, we present an analysis of the time complexity for the GCS algorithm. Finally, we present a simulation model to evaluate the performance. Experimental findings provide evidence of the excellence of the proposed scheme.

Efficient Heuristic Management of Cloud Data Lakes for Enhanced Big Data Handling in Cloud Computing Environments

Efficient control of cloud data lakes is important for improving big data dealing in cloud computing settings. Cloud data lakes serve as stores for vast amounts of organized, semi-structured, and unstructured data from varied sources, offering scaling and freedom in data storage and processing. However, the sheer amount and range of data offer difficulties in improving storage, access, and analysis processes. This study suggests a heuristic method to handle these issues by improving the order and recovery of data within cloud data lakes. The heuristic method focuses on automatically handling data splitting, storage, and caching strategies based on data access trends and task factors. By leveraging heuristic principles, such as adaptable splitting and predictive caching, the suggested method aims to reduce delay and improve total query speed. Key components of the heuristic management include adaptable splitting methods that actively change data partition sizes based on access frequency and data distribution patterns. This flexible method ensures that frequently accessed data is easily available, while less accessed data is efficiently saved to improve storage usage. Furthermore, predictive storing methods expect future data access patterns using machine learning models or previous data trends. By strategically saving relevant datasets in memory or high-speed storage, the system reduces delay for repeated questions, thereby improving real-time data processing capabilities. The success of the suggested heuristic management method is tested through models and benchmarks using real big data tasks. Comparative research against standard static splitting and caching methods shows significant changes in query response times and resource utilization efficiency.

Methods for improving the performance of JavaScript interfaces

This article discusses various methods for improving the performance of JavaScript interfaces, which are critically important in the context of the rapid development of digital technologies. Effective, responsive interfaces not only attract and retain users, but also improve the position of websites in search engines and increase conversion rates. The research covers topics related to reducing the number of requests, asynchronous programming, optimizing data loading and caching. The article provides specific examples and tips, such as minimizing queries, using local variables to increase the speed of code execution, using event delegation methods and algorithmic optimization. Tools for diagnosing and fixing performance issues such as Lighthouse and Google PageSpeed Insights are also being considered. These recommendations and techniques have been tested and systematized by experienced developers to achieve the best results in improving JavaScript performance.

Federated learning in smart home: A dynamic contract-based incentive approach with task preferences

Federated Learning (FL) is a new type of distributed machine learning paradigm aimed at addressing data privacy and security issues in the Internet of Things (IoT) context. In the training process of federated learning model of smart home, data owners need to constantly update cached data, which lead to resources consumption and service latency. Meanwhile, the update cost of the data owners will change with the passage of time when the model owner requests data update. Therefore, this paper first puts forward an incentive scheme based on two-period dynamic contract theory under the information asymmetry. The scheme can balance the weighted preference of the model owner for age of information (AoI) and service latency, as well as encourage more data owners to participate in model training to increase the utility of model owner. Then we formally prove the feasibility of the proposed dynamic contract, which satisfies the constraints of individual rationality and intertemporal incentive compatibility. The experimental results on MNIST dataset show that the accuracy of the proposed dynamic contract is improved by at least 4% compared with the existing contracts. Additionally, compared with traditional contract and consistent pricing strategy, the model owner obtains more profit from the proposed contract.

Human right to be forgiven

The article examines in detail the concept of “a person’s right to be forgotten” as an important aspect of a natural person’s right to information about himself, which allows a person to demand the removal or destruction of his personal information. The question is also devoted to the main aspects of the history and development of the “right to be forgotten” concept. The author states that a significant contribution to the regulation of the right to be forgotten within the framework of the legislation on personal data protection was made by the European Union. After all, EU Regulation 2016/679 defines the conditions for obtaining this right, the conditions for fulfilling requests to delete information about yourself, and the circumstances under which this right may be limited. However, this Regulation does not take into account the entire amount of personal information, which complicates the process of realizing the human right to be forgotten. It has been determined that different countries develop their own approaches to the right to be forgotten. It was found that the current legislation of Ukraine provides for two stages of “forgetting”: a court decision and filing a complaint for violation of the terms of consent to the processing and storage of personal data. At the same time, the decision of the European Court, which became key in the world judicial practice regarding the human right to be forgotten, was considered. In addition, the balance between the right to be forgotten and freedom of information is described. The public interest and ethical aspects in the context of the right to be forgotten are studied. The need for transparency and a balanced approach to the researched law is substantiated. The technical aspects of the human right to be forgotten and the challenges they generate are also described. The complexity of technical data deletion and the challenges of data caching and indexing have been studied. The general aspects of ensuring the security and protection of data during deletion are identified, as well as the impact of artificial intelligence and automation on the human right to be forgotten.

Edge Caching Data Distribution Strategy with Minimum Energy Consumption.

In the context of the rapid development of the Internet of Vehicles, virtual reality, automatic driving and the industrial Internet, the terminal devices in the network show explosive growth. As a result, more and more information is generated from the edge of the network, which makes the data throughput increase dramatically in the mobile communication network. As the key technology of the fifth-generation mobile communication network, mobile edge caching technology which caches popular data to the edge server deployed at the edge of the network avoids the data transmission delay of the backhaul link and the occurrence of network congestion. With the growing scale of the network, distributing hot data from cloud servers to edge servers will generate huge energy consumption. To realize the green and sustainable development of the communication industry and reduce the energy consumption of distribution of data that needs to be cached in edge servers, we make the first attempt to propose and solve the problem of edge caching data distribution with minimum energy consumption (ECDDMEC) in this paper. First, we model and formulate the problem as a constrained optimization problem and then prove its NP-hardness. Subsequently, we design a greedy algorithm with computational complexity of O(n2) to solve the problem approximately. Experimental results show that compared with the distribution strategy of each edge server directly requesting data from the cloud server, the strategy obtained by the algorithm can significantly reduce the energy consumption of data distribution.

Hybrid deduplication system with content-based cache for cloud environment

Primary storage deduplication systems are performance sensitive. Their performance depends upon two factors — metadata access for duplicate detection and strategy for elimination of duplicate data. Various approaches for duplicate detection through suitable caching mechanisms have been proposed in the literature. Most of the approaches assumed that the primary workloads exhibit strong temporal locality. Whereas, this cannot be assumed in the context of Cloud as the workloads locality does not exist with interferences among different workloads on the same system. Duplicate content among the data blocks with different addresses lead to an inefficient utilization of the data cache. In this context, applying deduplication causes sharing of the data blocks among the clients with different access patterns and frequencies. In this situation, LRU cache, which considers only the recency of the references, is not appropriate. In this paper, Hybrid Deduplication System (HDS) containing the content-based cache with a new replacement policy — Modified Adaptive Replacement Cache (ARC), is proposed. The proposed system is simulated in the Linux environment using three different types of FIU traces. Effectiveness of the system is compared with a full deduplication system. Experimental results show that the system has performed consistently better than the full deduplication system in reducing the metadata overhead for all of the three data sets.

A person’s right to be forgotten

The article examines in detail the concept of “a person’s right to be forgotten” as an important aspect of a natural person’s right to information about himself, which allows a person to demand the removal or destruction of his personal information. The question is also devoted to the main aspects of the history and development of the “right to be forgotten” concept.
 The author states that a significant contribution to the regulation of the right to be forgotten within the framework of the legislation on personal data protection was made by the European Union. After all, EU Regulation 2016/679 defines the conditions for obtaining this right, the conditions for fulfilling requests to delete information about yourself, and the circumstances under which this right may be limited. However, this Regulation does not take into account the entire amount of personal information, which complicates the process of realizing the human right to be forgotten.
 It has been determined that different countries develop their own approaches to the right to be forgotten. It was found that the current legislation of Ukraine provides for two stages of “forgetting”: a court decision and filing a complaint for violation of the terms of consent to the processing and storage of personal data.
 At the same time, the decision of the European Court, which became key in the world judicial practice regarding the human right to be forgotten, was considered. In addition, the balance between the right to be forgotten and freedom of information is described. The public interest and ethical aspects in the context of the right to be forgotten are studied. The need for transparency and a balanced approach to the researched law is substantiated.
 The technical aspects of the human right to be forgotten and the challenges they generate are also described. The complexity of technical data deletion and the challenges of data caching and indexing have been studied. The general aspects of ensuring the security and protection of data during deletion are identified, as well as the impact of artificial intelligence and automation on the human right to be forgotten.

Joint user association, service caching, and task offloading in multi-tier communication/multi-tier edge computing heterogeneous networks

Due to the wide range of intensive computational applications and ubiquitous connectivity of the Internet of Things (IoT) paradigms, it has become crucial to develop a new platform that can achieve low delay, high network throughput, and enhanced quality of service (QoS). This paper proposes a joint user association, service caching, and task offloading strategy to reduce delay and enhance users’ QoS in multi-tier communication and multi-tier edge computing heterogeneous networks (HetNets). The considered system model consists of multi-users with different tasks and service data sizes communicating in a heterogeneous network of one massive multiple-input multiple-output (M-MIMO) macro base station and some small base stations. The proposed work investigates user association, power allocation, optimum service data caching, and task offloading strategies at the computing network edges. Thereby, the objectives of this work are to propose an efficient framework to reduce the system delay, increase the network throughput, and meet the user requirements in multi-tier communication and multi-tier edge computing heterogeneous networks. The simulation results show that the proposed algorithm outperforms the state-of-the-art with a 49.48% decrease in system delay, 80% reduction in cost and hardware complexity in terms of the reduced number of installed antennas, and 48.58% enhancement in the network throughput.