A weighted algorithm for watermarking relational databases for copyright protection is presented. The possibility of watermarking an attribute is assigned according to its weight decided by the owner of the database. ...A weighted algorithm for watermarking relational databases for copyright protection is presented. The possibility of watermarking an attribute is assigned according to its weight decided by the owner of the database. A one-way hash function and a secret key known only to the owner of the data are used to select tuples and bits to mark. By assigning high weight to significant attributes, the scheme ensures that important attributes take more chance to be marked than less important ones. Experimental results show that the proposed scheme is robust against various forms of attacks, and has perfect immunity to subset attack.展开更多
MatBase is a prototype data and knowledge base management expert intelligent system based on the Relational,Entity-Relationship,and(Elementary)Mathematical Data Models.Dyadic relationships are quite common in data mod...MatBase is a prototype data and knowledge base management expert intelligent system based on the Relational,Entity-Relationship,and(Elementary)Mathematical Data Models.Dyadic relationships are quite common in data modeling.Besides their relational-type constraints,they often exhibit mathematical properties that are not covered by the Relational Data Model.This paper presents and discusses the MatBase algorithm that assists database designers in discovering all non-relational constraints associated to them,as well as its algorithm for enforcing them,thus providing a significantly higher degree of data quality.展开更多
In this paper,a quantitative precipitation estimation based on the hydrometeor classification(HCA-QPE)algorithm was proposed for the first operational S band dual-polarization radar upgraded from the CINRAD/SA radar o...In this paper,a quantitative precipitation estimation based on the hydrometeor classification(HCA-QPE)algorithm was proposed for the first operational S band dual-polarization radar upgraded from the CINRAD/SA radar of China.The HCA-QPE algorithm,localized Colorado State University-Hydrometeor Identification of Rainfall(CSUHIDRO)algorithm,the Joint Polarization Experiment(JPOLE)algorithm,and the dynamic Z-R relationships based on variational correction QPE(DRVC-QPE)algorithm were evaluated with the rainfall events from March 1 to October 30,2017 in Guangdong Province.The results indicated that even though the HCA-QPE algorithm did not use the observed rainfall data for correction,its estimation accuracy was better than that of the DRVC-QPE algorithm when the rainfall rate was greater than 5 mm h-1;and the stronger the rainfall intensity,the greater the QPE improvement.Besides,the HCA-QPE algorithm worked better than the localized CSU-HIDRO and JPOLE algorithms.This study preliminarily evaluated the improved accuracy of QPE by a dual-polarization radar system modified from CINRAD-SA radar.展开更多
After a relation scheme R is decomposed into the set of schemes ρ={R_1,...,R_n},we may pose queries as if R existed in the database,taking a join of R_i's,when it is necessary to implement the query.Suppose a que...After a relation scheme R is decomposed into the set of schemes ρ={R_1,...,R_n},we may pose queries as if R existed in the database,taking a join of R_i's,when it is necessary to implement the query.Suppose a query involves a set of attributes S(?)R,we want to find the smallest subset of ρ whose union includes S.We prove that the problem is NP-complete and present a polynomial-bounded approximation algorithm.A subset of ρ whose union includes S and has a decomposition into 3NF with a lossless join and preservation of dependencies is given in the paper.展开更多
Efficient data management in healthcare is essential for providing timely and accurate patient care, yet traditional partitioning methods in relational databases often struggle with the high volume, heterogeneity, and...Efficient data management in healthcare is essential for providing timely and accurate patient care, yet traditional partitioning methods in relational databases often struggle with the high volume, heterogeneity, and regulatory complexity of healthcare data. This research introduces a tailored partitioning strategy leveraging the MD5 hashing algorithm to enhance data insertion, query performance, and load balancing in healthcare systems. By applying a consistent hash function to patient IDs, our approach achieves uniform distribution of records across partitions, optimizing retrieval paths and reducing access latency while ensuring data integrity and compliance. We evaluated the method through experiments focusing on partitioning efficiency, scalability, and fault tolerance. The partitioning efficiency analysis compared our MD5-based approach with standard round-robin methods, measuring insertion times, query latency, and data distribution balance. Scalability tests assessed system performance across increasing dataset sizes and varying partition counts, while fault tolerance experiments examined data integrity and retrieval performance under simulated partition failures. The experimental results demonstrate that the MD5-based partitioning strategy significantly reduces query retrieval times by optimizing data access patterns, achieving up to X% better performance compared to round-robin methods. It also scales effectively with larger datasets, maintaining low latency and ensuring robust resilience under failure scenarios. This novel approach offers a scalable, efficient, and fault-tolerant solution for healthcare systems, facilitating faster clinical decision-making and improved patient care in complex data environments.展开更多
基金Supported by the Aeronautics Science Foundation of China (02F52033), the High-Technology Research Project of Jiangsu Province (BG2004005) and Youth Research Foundation of Qufu Normal Univer-sity(XJ02057)
文摘A weighted algorithm for watermarking relational databases for copyright protection is presented. The possibility of watermarking an attribute is assigned according to its weight decided by the owner of the database. A one-way hash function and a secret key known only to the owner of the data are used to select tuples and bits to mark. By assigning high weight to significant attributes, the scheme ensures that important attributes take more chance to be marked than less important ones. Experimental results show that the proposed scheme is robust against various forms of attacks, and has perfect immunity to subset attack.
文摘MatBase is a prototype data and knowledge base management expert intelligent system based on the Relational,Entity-Relationship,and(Elementary)Mathematical Data Models.Dyadic relationships are quite common in data modeling.Besides their relational-type constraints,they often exhibit mathematical properties that are not covered by the Relational Data Model.This paper presents and discusses the MatBase algorithm that assists database designers in discovering all non-relational constraints associated to them,as well as its algorithm for enforcing them,thus providing a significantly higher degree of data quality.
基金National Key Research and Development Program of China(2017YFC1404700,2018YFC1506905)Open Research Program of the State Key Laboratory of Severe Weather(2018LASW-B09,2018LASW-B08)+7 种基金Science and Technology Planning Project of Guangdong Province,China(2019B020208016,2018B020207012,2017B020244002)National Natural Science Foundation of China(41375038)Special Scientific Research Fund of Meteorological Public Welfare Profession of China(GHY201506006)2017-2019Meteorological Forecasting Key Technology Development Special Grant(YBGJXM(2017)02-05)Guangdong Science&Technology Plan Project(2015A020217008)Zhejiang Province Major Science and Technology Special Project(2017C03035)Scientific and Technological Research Projects of Guangdong Meteorological Service(GRMC2018M10)Natural Science Foundation of Guangdong Province(2018A030313218)
文摘In this paper,a quantitative precipitation estimation based on the hydrometeor classification(HCA-QPE)algorithm was proposed for the first operational S band dual-polarization radar upgraded from the CINRAD/SA radar of China.The HCA-QPE algorithm,localized Colorado State University-Hydrometeor Identification of Rainfall(CSUHIDRO)algorithm,the Joint Polarization Experiment(JPOLE)algorithm,and the dynamic Z-R relationships based on variational correction QPE(DRVC-QPE)algorithm were evaluated with the rainfall events from March 1 to October 30,2017 in Guangdong Province.The results indicated that even though the HCA-QPE algorithm did not use the observed rainfall data for correction,its estimation accuracy was better than that of the DRVC-QPE algorithm when the rainfall rate was greater than 5 mm h-1;and the stronger the rainfall intensity,the greater the QPE improvement.Besides,the HCA-QPE algorithm worked better than the localized CSU-HIDRO and JPOLE algorithms.This study preliminarily evaluated the improved accuracy of QPE by a dual-polarization radar system modified from CINRAD-SA radar.
文摘After a relation scheme R is decomposed into the set of schemes ρ={R_1,...,R_n},we may pose queries as if R existed in the database,taking a join of R_i's,when it is necessary to implement the query.Suppose a query involves a set of attributes S(?)R,we want to find the smallest subset of ρ whose union includes S.We prove that the problem is NP-complete and present a polynomial-bounded approximation algorithm.A subset of ρ whose union includes S and has a decomposition into 3NF with a lossless join and preservation of dependencies is given in the paper.
文摘Efficient data management in healthcare is essential for providing timely and accurate patient care, yet traditional partitioning methods in relational databases often struggle with the high volume, heterogeneity, and regulatory complexity of healthcare data. This research introduces a tailored partitioning strategy leveraging the MD5 hashing algorithm to enhance data insertion, query performance, and load balancing in healthcare systems. By applying a consistent hash function to patient IDs, our approach achieves uniform distribution of records across partitions, optimizing retrieval paths and reducing access latency while ensuring data integrity and compliance. We evaluated the method through experiments focusing on partitioning efficiency, scalability, and fault tolerance. The partitioning efficiency analysis compared our MD5-based approach with standard round-robin methods, measuring insertion times, query latency, and data distribution balance. Scalability tests assessed system performance across increasing dataset sizes and varying partition counts, while fault tolerance experiments examined data integrity and retrieval performance under simulated partition failures. The experimental results demonstrate that the MD5-based partitioning strategy significantly reduces query retrieval times by optimizing data access patterns, achieving up to X% better performance compared to round-robin methods. It also scales effectively with larger datasets, maintaining low latency and ensuring robust resilience under failure scenarios. This novel approach offers a scalable, efficient, and fault-tolerant solution for healthcare systems, facilitating faster clinical decision-making and improved patient care in complex data environments.
