In this paper, an interval-gap-based 1NF temporal tuple calculus language and the corresponding temporal relation algebra are established on the basis of considering the trouble of stack operations in both S. Gadia’s...In this paper, an interval-gap-based 1NF temporal tuple calculus language and the corresponding temporal relation algebra are established on the basis of considering the trouble of stack operations in both S. Gadia’s TCAL and temporal tuple calculus due to their NINF.展开更多
A new secured database management system architecture using intrusion detection systems(IDS)is proposed in this paper for organizations with no previous role mapping for users.A simple representation of Structured Que...A new secured database management system architecture using intrusion detection systems(IDS)is proposed in this paper for organizations with no previous role mapping for users.A simple representation of Structured Query Language queries is proposed to easily permit the use of the worked clustering algorithm.A new clustering algorithm that uses a tube search with adaptive memory is applied to database log files to create users’profiles.Then,queries issued for each user are checked against the related user profile using a classifier to determine whether or not each query is malicious.The IDS will stop query execution or report the threat to the responsible person if the query is malicious.A simple classifier based on the Euclidean distance is used and the issued query is transformed to the proposed simple representation using a classifier,where the Euclidean distance between the centers and the profile’s issued query is calculated.A synthetic data set is used for our experimental evaluations.Normal user access behavior in relation to the database is modelled using the data set.The false negative(FN)and false positive(FP)rates are used to compare our proposed algorithm with other methods.The experimental results indicate that our proposed method results in very small FN and FP rates.展开更多
在Internet上经常遇到海量数据库分页呈现问题,针对ADO(AxtiveX Data Object)记录集分页、转储记录集分页和基于SQL(Structured Query Language)分页等算法在海量数据下存在响应速度慢、响应能力弱、资源占用多等缺陷,在分析这些方法的...在Internet上经常遇到海量数据库分页呈现问题,针对ADO(AxtiveX Data Object)记录集分页、转储记录集分页和基于SQL(Structured Query Language)分页等算法在海量数据下存在响应速度慢、响应能力弱、资源占用多等缺陷,在分析这些方法的基础上,提出了一种改进的方法.该方法在传统的C/S(Client/Server)结构中将Server端的海量数据以分页的方式在Client端Web呈现给用户,然后,对所有的方法进行测试和分析,通过对比表明,新算法的响应速度最大可提高21.4%,响应能力比其他算法提高1.3～4倍,在大数据量下尤其明显.展开更多
基金Supported by both the High Technology Research Development Programme of Chinathe National Natural Science Foundation of China
文摘In this paper, an interval-gap-based 1NF temporal tuple calculus language and the corresponding temporal relation algebra are established on the basis of considering the trouble of stack operations in both S. Gadia’s TCAL and temporal tuple calculus due to their NINF.
文摘A new secured database management system architecture using intrusion detection systems(IDS)is proposed in this paper for organizations with no previous role mapping for users.A simple representation of Structured Query Language queries is proposed to easily permit the use of the worked clustering algorithm.A new clustering algorithm that uses a tube search with adaptive memory is applied to database log files to create users’profiles.Then,queries issued for each user are checked against the related user profile using a classifier to determine whether or not each query is malicious.The IDS will stop query execution or report the threat to the responsible person if the query is malicious.A simple classifier based on the Euclidean distance is used and the issued query is transformed to the proposed simple representation using a classifier,where the Euclidean distance between the centers and the profile’s issued query is calculated.A synthetic data set is used for our experimental evaluations.Normal user access behavior in relation to the database is modelled using the data set.The false negative(FN)and false positive(FP)rates are used to compare our proposed algorithm with other methods.The experimental results indicate that our proposed method results in very small FN and FP rates.
文摘在Internet上经常遇到海量数据库分页呈现问题,针对ADO(AxtiveX Data Object)记录集分页、转储记录集分页和基于SQL(Structured Query Language)分页等算法在海量数据下存在响应速度慢、响应能力弱、资源占用多等缺陷,在分析这些方法的基础上,提出了一种改进的方法.该方法在传统的C/S(Client/Server)结构中将Server端的海量数据以分页的方式在Client端Web呈现给用户,然后,对所有的方法进行测试和分析,通过对比表明,新算法的响应速度最大可提高21.4%,响应能力比其他算法提高1.3～4倍,在大数据量下尤其明显.
