The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we propose an obfuscation/ deobfuscation based technique to detect the presence of possible SQL Injection Attacks (SQLIA) in a query before submitting it to a DBMS. This technique combines static and dynamic analysis. In the static phase, the queries in the application are replaced by queries in obfuscated form. The main idea behind obfuscation is to isolate all the atomic formulas...
In this paper, we systematically explore the problem of frequent subtree mining and present a novel pruning strategy, F2SC (frequent 2-subtree checking), which can be used in all Apriori-like subtree mining algorithms. With a little more memory overhead of keeping frequent 2-subtrees list, F2SC can prunes the invalid candidate which contains infrequent 2-subtree by checking the frequent 2-subtrees...
XML query technology has attracted more and more attention in data management research community. Finding all the occurrences of a twig pattern in an XML database is a core operation for XML queries. The previous approaches produce large set of intermediate results when they processing queries with parent-child relationship edges. We propose a new labeling scheme, called extended region encoding labeling...
Traditional databases manage only deterministic information, but now many applications that use databases involve uncertain data. For example, it is infeasible for a sensor database to contain only the exact value of each sensor at all points in time. The uncertainty is inherent in these systems due to measurement and sampling errors, and resource limitations. This paper aims at the query processing...
A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor. Compiling nested expressions of the fully compositional XQuery language, however, yields odd algebraic plan shapes featuring scattered distributions of join operators that currently overwhelm commercial SQL query optimizers. This work rewrites such plans before submission to the...
In this paper we present an algorithm for mining of unordered embedded subtrees. This is an important problem for association rule mining from semi-structured documents, and it has important applications in many biomedical, Web and scientific domains. The proposed U3 algorithm is an extension of our general tree model guided (TMG) candidate generation framework and it considers both transaction based...
Concept hierarchies are important for generalization across database/data mining applications. Hierarchy generation has witnessed a booming interest with the exponential growth of information and the ever increasing needs for organizations. The underlying hierarchical structure identifies the relationships of dependence between different data categories and provides valuable sources of information...
In this paper, we propose a new method for mining maximal frequent itemsets. Our method introduces an efficient database encoding technique, a novel tree structure called PC_Tree and also PC_Miner algorithm. The database encoding technique utilizes Prime number characteristics and transforms each transaction into a positive integer that has all properties of its items. The PC_Tree is a simple tree...
As a de facto standard for information representation and exchange over the Internet, XML has been used extensively in many applications. And XML query technology has attracted more and more attention in data management research community. Standard XML query languages, e.g. XPath and XQuery, use twig pattern as a basic unit to match relevant fragments from a given XML document. However, in most existing...
This paper presents algorithm SCCMETreeMiner which can find all closed and maximal frequent embedded subtrees using length-decreasing support constraint. SCCMETreeMiner combines the rightmost path expansion scheme and projection technique to construct pattern growth space, and uses several techniques proposed in the paper to prune the branches of the enumeration trees that do not correspond to closed...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.