A pattern is used to describe best practices and principles. Patterns have been used successfully in architecture and in software design. We propose to apply the pattern method to XML-based security engineering. Organ...A pattern is used to describe best practices and principles. Patterns have been used successfully in architecture and in software design. We propose to apply the pattern method to XML-based security engineering. Organized collections of interrelated patterns (called pattern languages) can embody whole bodies of knowledge on specific topics. We will discuss patterns and security pattern, pattern languages and the requirements of the pattern languages proposing its essential requirement (the template), and lays the groundwork for our future development of a true XML-based security pattern language.展开更多
It is nontrivial to maintain such discovered frequent query patterns in real XML-DBMS because the transaction database of queries may allow frequent updates and such updates may not only invalidate some existing frequ...It is nontrivial to maintain such discovered frequent query patterns in real XML-DBMS because the transaction database of queries may allow frequent updates and such updates may not only invalidate some existing frequent query patterns but also generate some new frequent query patterns. In this paper, two incremental updating algorithms, FUX-QMiner and FUXQMiner, are proposed for efficient maintenance of discovered frequent query patterns and generation the new frequent query patterns when new XMI, queries are added into the database. Experimental results from our implementation show that the proposed algorithms have good performance. Key words XML - frequent query pattern - incremental algorithm - data mining CLC number TP 311 Foudation item: Supported by the Youthful Foundation for Scientific Research of University of Shanghai for Science and TechnologyBiography: PENG Dun-lu (1974-), male, Associate professor, Ph.D, research direction: data mining, Web service and its application, peerto-peer computing.展开更多
In this paper,we propose a new relational schema (R-schema) to XML schema translation algorithm, VQT, which analyzes the value cardinality and user query patterns and extracts the implicit referential integrities by u...In this paper,we propose a new relational schema (R-schema) to XML schema translation algorithm, VQT, which analyzes the value cardinality and user query patterns and extracts the implicit referential integrities by using the cardinality property of foreign key constraints between columns and the equi-join characteristic in user queries. The VQT algorithm can apply the extracted implied referential integrity relation information to the R-schema and create an XML schema as the final result. Therefore, the VQT algorithm prevents the R-schema from being incorrectly converted into the XML schema, and it richly and powerfully represents all the information in the R-schema by creating an XML schema as the translation result on behalf of the XML DTD.展开更多
In the XML community, exact queries allow users to specify exactly what they want to check and/or retrieve in an XML document. When they are applied to a semi-structured document or to a document with an overly comple...In the XML community, exact queries allow users to specify exactly what they want to check and/or retrieve in an XML document. When they are applied to a semi-structured document or to a document with an overly complex model, the lack or the ignorance of the explicit document model (DTD—Document Type Definition, Schema, etc.) increases the risk of obtaining an empty result set when the query is too specific, or, too large result set when it is too vague (e.g. it contains wildcards such as “*”). The reason is that in both cases, users write queries according to the document model they have in mind;this can be very far from the one that can actually be extracted from the document. Opposed to exact queries, preference queries are more flexible and can be relaxed to expand the search space during their evaluations. Indeed, during their evaluation, certain constraints (the preferences they contain) can be relaxed if necessary to avoid precisely empty results;moreover, the returned answers can be filtered to retain only the best ones. This paper presents an algorithm for evaluating such queries inspired by the TreeMatch algorithm proposed by Yao et al. for exact queries. In the proposed algorithm, the best answers are obtained by using an adaptation of the Skyline operator (defined in relational databases) in the context of documents (trees) to incrementally filter into the partial solutions set, those which satisfy the maximum of preferential constraints. The only restriction imposed on documents is No-Self-Containment.展开更多
作为XML(extensible markup language)数据查询的核心操作,树模式查询的应用前景广泛,其研究具有重要意义。针对扩展的树模式GTP++(generalized tree pattern)提出了一种树模式描述语言XTPL(XML tree pattern language),采用指称语义方...作为XML(extensible markup language)数据查询的核心操作,树模式查询的应用前景广泛,其研究具有重要意义。针对扩展的树模式GTP++(generalized tree pattern)提出了一种树模式描述语言XTPL(XML tree pattern language),采用指称语义方式给出其完整的语义描述,使得形式化方法可以用于分析树模式查询的行为特征,有助于验证XML查询的正确性,以及提高查询处理方法的可靠性和鲁棒性。同时以路径表达式为例,以指称语义的方式给出了从路径表达式提取树模式的算法。展开更多
基金"China National Science Foundation"under grant No: 2001AA412010
文摘A pattern is used to describe best practices and principles. Patterns have been used successfully in architecture and in software design. We propose to apply the pattern method to XML-based security engineering. Organized collections of interrelated patterns (called pattern languages) can embody whole bodies of knowledge on specific topics. We will discuss patterns and security pattern, pattern languages and the requirements of the pattern languages proposing its essential requirement (the template), and lays the groundwork for our future development of a true XML-based security pattern language.
文摘It is nontrivial to maintain such discovered frequent query patterns in real XML-DBMS because the transaction database of queries may allow frequent updates and such updates may not only invalidate some existing frequent query patterns but also generate some new frequent query patterns. In this paper, two incremental updating algorithms, FUX-QMiner and FUXQMiner, are proposed for efficient maintenance of discovered frequent query patterns and generation the new frequent query patterns when new XMI, queries are added into the database. Experimental results from our implementation show that the proposed algorithms have good performance. Key words XML - frequent query pattern - incremental algorithm - data mining CLC number TP 311 Foudation item: Supported by the Youthful Foundation for Scientific Research of University of Shanghai for Science and TechnologyBiography: PENG Dun-lu (1974-), male, Associate professor, Ph.D, research direction: data mining, Web service and its application, peerto-peer computing.
基金Project supported by the 2nd Brain Korea Project
文摘In this paper,we propose a new relational schema (R-schema) to XML schema translation algorithm, VQT, which analyzes the value cardinality and user query patterns and extracts the implicit referential integrities by using the cardinality property of foreign key constraints between columns and the equi-join characteristic in user queries. The VQT algorithm can apply the extracted implied referential integrity relation information to the R-schema and create an XML schema as the final result. Therefore, the VQT algorithm prevents the R-schema from being incorrectly converted into the XML schema, and it richly and powerfully represents all the information in the R-schema by creating an XML schema as the translation result on behalf of the XML DTD.
文摘In the XML community, exact queries allow users to specify exactly what they want to check and/or retrieve in an XML document. When they are applied to a semi-structured document or to a document with an overly complex model, the lack or the ignorance of the explicit document model (DTD—Document Type Definition, Schema, etc.) increases the risk of obtaining an empty result set when the query is too specific, or, too large result set when it is too vague (e.g. it contains wildcards such as “*”). The reason is that in both cases, users write queries according to the document model they have in mind;this can be very far from the one that can actually be extracted from the document. Opposed to exact queries, preference queries are more flexible and can be relaxed to expand the search space during their evaluations. Indeed, during their evaluation, certain constraints (the preferences they contain) can be relaxed if necessary to avoid precisely empty results;moreover, the returned answers can be filtered to retain only the best ones. This paper presents an algorithm for evaluating such queries inspired by the TreeMatch algorithm proposed by Yao et al. for exact queries. In the proposed algorithm, the best answers are obtained by using an adaptation of the Skyline operator (defined in relational databases) in the context of documents (trees) to incrementally filter into the partial solutions set, those which satisfy the maximum of preferential constraints. The only restriction imposed on documents is No-Self-Containment.
文摘作为XML(extensible markup language)数据查询的核心操作,树模式查询的应用前景广泛,其研究具有重要意义。针对扩展的树模式GTP++(generalized tree pattern)提出了一种树模式描述语言XTPL(XML tree pattern language),采用指称语义方式给出其完整的语义描述,使得形式化方法可以用于分析树模式查询的行为特征,有助于验证XML查询的正确性,以及提高查询处理方法的可靠性和鲁棒性。同时以路径表达式为例,以指称语义的方式给出了从路径表达式提取树模式的算法。
基金Supported by the Natural Science Foundation of Fujian Province of China under Grant No.A0510020(福建省自然科学基金)the Int'I Science and Technology Cooperation Project of Fujian Province of China under Grant No.20041014(福建省国际科技合作项目)
