The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
Abstract. This paper addresses the pattern matching problem for model transformation languages. Despite being an NP-complete problem, the pattern matching can be solved efficiently...
State of the art ontology matching techniques are limited to detect simple correspondences between atomic concepts and properties. Nevertheless, for many concepts and properties at...
Dominique Ritze, Christian Meilicke, Ondrej Sv&aac...
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tian...