{
"types" : {
"Bookmark" : {
"pluralLabel" : "Bookmarks"
},
"Publication" : {
"pluralLabel" : "Publications"
},
"GoldStandardPublication" : {
"pluralLabel" : "GoldStandardPublications"
},
"GoldStandardBookmark" : {
"pluralLabel" : "GoldStandardBookmarks"
},
"Tag" : {
"pluralLabel" : "Tags"
},
"User" : {
"pluralLabel" : "Users"
},
"Sphere" : {
"pluralLabel" : "Spheres"
}
},
"properties" : {
"count" : {
"valueType" : "number"
},
"date" : {
"valueType" : "date"
},
"changeDate" : {
"valueType" : "date"
},
"url" : {
"valueType" : "url"
},
"id" : {
"valueType" : "url"
},
"tags" : {
"valueType" : "item"
},
"user" : {
"valueType" : "item"
}
},
"items" : [
{
"type" : "Publication",
"id" : "https://www.bibsonomy.org/bibtex/29c52a4ae61c6aa51a88f53da2bc49221/mostrare",
"tags" : [
"matching","tree"
],
"intraHash" : "9c52a4ae61c6aa51a88f53da2bc49221",
"interHash" : "86353794970f5b3043fa4ffa10d72712",
"label" : "Tree Matching Problems with Applications to Structured Text Databases",
"user" : "mostrare",
"description" : "",
"date" : "2010-10-18 09:49:03",
"changeDate" : "2010-10-18 09:49:03",
"count" : 2,
"pub-type": "phdthesis",
"publisher":"University of Helsinki, Department of Computer Science",
"year": "1992",
"url": "http://ethesis.helsinki.fi/julkaisut/mat/tieto/vk/kilpelainen/treematc.pdf",
"author": [
"P. KilpelĂ¤inen"
],
"authors": [
{"first" : "P.", "last" : "KilpelĂ¤inen"}
],
"abstract": "Tree mat thing is concerned with finding the instances, or matches, of a given pattern tree in a given target tree. We introduce ten interrelated matching problems called tree inclusion problems. A specific tree inclusion problem is defined by specifying the trees that are instances of the patterns. The problems differ from each other in the amount of similarity required between the patterns and their instances. We present and analyze algorithms for solving these problems, and show that the computational complexities of the problems range from linear to NP-complete. The problems are motivated by the study of query languages for structured text databases. The structure of a text document can be described by a context-free grammar, and text collections can be represented as collections of parse trees. Matching-based operations are an intuitive basis for accessing the contents of structured text databases. In \"C-grammatical\" tree inclusion problems the target tree is a parse tree over a context-free grammar C. We show that a certain natural class of grammars allows solving some of the grammatical inclusion problems in linear time. Tree inclusion problems are extended by introducing logical variables in the patterns. These variables allow extracting substructures of the pattern matches and posing equality constraints on them. We show that most of the tree inclusion problems with logical variables are NP-hard, and also consider solving their polynomial versions. As an application of these problems we finally show how tree inclusion with logical variables can be used for querying structured text databases, and discuss how the inclusion queries should be evaluated in practice.",
"file" : "kilpelainentmp.pdf:kilpelainentmp.pdf:PDF",
"docname" : "kilpelainentmp.pdf",
"bibtexKey": "kilpelainen:tmp"
}
]
}