Pekka Kilpeläinen  Home/Search
Context Related
| cs.helsinki.fi/TR/A19...A19926.ps.gz cs.helsinki.fi/pub...xt_Databases.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.helsinki.fi/TR/A (more) From: oasisopen.org/cover/bibil (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Tree matching 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... (Update)
Context of citations to this paper: More
...approach. Finally, we review related work in Section 9, and give a conclusion in Section 10. 2 Tree Matching Kilpel ainen introduced in [Kil92] several variations of Tree Matching techniques as simple and intuitive means to answer queries over trees. We decided to use a slightly...
...type they are closely related to traditional information retrieval from a conceptual point of view. Multi dimensional formalisms such as [Kil92, DFF 98, CCD 99, AQM 97] by relating di erent parts of the data in each single answer, are closer to database formalisms. 2...
Cited by: More
Logical Tree Matching with Complete Answer Aggregates for.. - Meuss (2000) (Correct)
Tree Edit Distance, Alignment Distance and Inclusion - Bille (2003) (Correct)
ApproXQL: Design and Implementation of an Approximate Pattern.. - Schlieder (2001) (Correct)
Active bibliography (related documents): More All
1.4: A Structured Document Database System - Kilpeläinen, Lindén.. (1990) (Correct)
1.3: Incremental Updates in Structured Documents - Lindén (1994) (Correct)
0.8: Approximate Tree Matching in the Presence of Variable.. - Zhang, Shasha, Wang (1993) (Correct)
Similar documents based on text: More All
0.1: Structured Document Transformations - Lindén (1997) (Correct)
0.1: TranSID: An SGML Tree Transformation Language - Jaakkola, Kilpeläinen.. (1997) (Correct)
0.1: Intelligent Assembly of Structured Documents - Ahonen, Heikkinen, Heinonen.. (1996) (Correct)
Related documents from co-citation: More All
4: Data on the Web: From Relations to Semistructured Data and XML (context) - Abiteboul, Buneman et al. - 2000
4: Dataguides: Enabling query formulation and optimization in semistructured databa.. - Goldman, Widom - 1977
4: Comparative analysis of ve XML query languages (context) - Bonifati, Ceri - 2000
BibTeX entry: (Update)
P. Kilpelainen. Tree Matching Problems with Applications to Structured Text Databases. PhD thesis, Dept. of Computer Science, University of Helsinki, 1992. http://citeseer.ist.psu.edu/kilpel92tree.html More
@misc{ kilpel92tree,
author = "P. Kilpel",
title = "Tree Matching Problems with Applications to Structured Text Databases",
text = "P. Kilpelainen. Tree Matching Problems with Applications to Structured
Text Databases. PhD thesis, Dept. of Computer Science, University of Helsinki,
1992.",
year = "1992",
url = "citeseer.ist.psu.edu/kilpel92tree.html" }
Citations (may not include all citations):2003 The Art of Computer Programming (context) - Knuth - 1969
1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
1256 Introduction to Modern Information Retrieval (context) - Salton, McGill - 1983
981 Principles of Database and Knowledge-Base Systems (context) - Ullman - 1989
534 The complexity of theorem-proving procedures (context) - Cook - 1971
482 Combinatorial Optimization: Algorithms and Complexity (context) - Papadimitriou, Steiglitz - 1982
440 The Art of Prolog (context) - Sterling, Shapiro - 1986
363 Programming in Prolog (context) - Clocksin, Mellish - 1984
316 Freeman and Company (context) - Garey, Johnson et al. - 1979
218 Logic Programming and Databases (context) - Ceri, Gottlob et al. - 1990
185 algorithm for maximum matching in bipartite graphs (context) - Hopcroft, Karp - 1973
164 Society for Industrial and Applied Mathematics (context) - Tarjan, Network - 1983
157 The Art of Computer Programming: Sorting and Searching (context) - Knuth - 1973
144 The NP-completeness column: An ongoing guide (context) - Johnson - 1987
143 Algorithmic aspects of tree-width (context) - Robertson, Seymour - 1986
142 Finding patterns common to a set of strings (context) - Angluin - 1980
137 Efficient string matching: an aid to bibliographic search (context) - Aho, Corasick - 1975
127 Principles of Compiler Design (context) - Aho, Ullman - 1977
98 Query-by-example: a data base language (context) - Zloof - 1977
82 Variations of the common subexpression problem (context) - Downey, Sethi et al. - 1980
76 Simple fast algorithms for the editing distance between tree.. (context) - Zhang, Shasha - 1989
57 The tree-to-tree correction problem (context) - Tai - 1979
56 Cambridge University Press (context) - Bollob'as - 1986
50 Graph algorithms (context) - van Leeuwen - 1990
48 Implementing Prolog - compiling predicate logic programs (context) - Warren - 1977
48 PAT expressions: an algebra for text search - Salminen, Wm - 1992
47 Interactively editing structured documents - Furuta, Quint et al. - 1988
47 Grif: An interactive system for structured document manipula.. (context) - Quint, Vatton - 1986
39 Complexity of matching problems (context) - Benanav, Kapur et al. - 1987
35 String-matching and other products (context) - Fischer, Paterson - 1974
35 Ein Satz uber Untermengen einer endlichen Menge (context) - Sperner - 1928
35 A grammar-based approach towards unifying hierarchical data .. (context) - Gyssens, Paradaens et al. - 1989
28 A query language for retrieving information from hierarchic .. (context) - Macleod - 1991
28 The tree-to-tree editing problem (context) - Selkow - 1977
27 Computing with Logic - Logic Programming with Prolog (context) - Maier, Warren - 1988
24 Pattern matching in trees (context) - Hoffman, O'Donnell - 1982
24 Faster tree pattern matching (context) - Dubiner, Galil et al. - 1990
23 An analysis of a good algorithm for the subtree problem (context) - Reyner - 1977
23 Approximate tree matching in the presence of variable length.. - Zhang, Shasha et al. - 1991
22 Ordered and unordered tree inclusion (context) - Kilpelainen, Mannila - 1991
21 Document processing in a relational database system (context) - Stonebraker, Stettner et al. - 1983
20 Efficient tree pattern matching (context) - Kosaraju - 1989
18 time algorithms for the subgraph homeomorphism problem on tr.. (context) - Chung - 1987
17 Standards for structured documents (context) - Brown - 1989
16 The memory management of Prolog implementations (context) - Bruynooghe - 1982
13 Nonlinear pattern matching in trees (context) - Ramesh, Ramakrishnan - 1992
13 Patterns and pattern-matching in trees: An analysis (context) - Steyaert, Flajolet - 1983
13 Nonlinear pattern matching in trees (context) - Ramesh, Ramakrishnan - 1988
12 Efficient processing of interactive relational database quer.. (context) - Warren - 1981
11 A structured document database system - Kilpelainen, Lind'en et al. - 1990
10 Retrieval activities in a database consisting of heterogeneo.. (context) - Burkowski - 1992
10 Lexicographical indices for text: Inverted files vs - Gonnet, Baeza-Yates et al. - 1991
9 Analytic variations on the common subexpression problem - Flajolet, Sipala et al. - 1990
8 An algorithm for subtree identification (context) - Matula - 1968
5 An overview of hypertext (context) - Smith, Weiss - 1988
5 NP-completeness results: Motivation (context) - Garey, Johnson - 1978
4 Managing texts and facts in a mixed data base environment (context) - Bancilhon, Richard - 1984
4 Formatting structured documents: Batch versus interactive (context) - Coray, Ingold et al. - 1986
3 Fast serial and parallel algorithms for approximate tree mat.. (context) - Zhang, Shasha et al. - 1992
3 The tree inclusion problem (context) - Kilpelainen, Mannila - 1991
3 Views in structured text databases (context) - Nikunen - 1990
3 The data model and query language of the Helsinki structured.. (context) - Kilpelainen, Lind'en et al. - 1991
3 A note on the subtree isomorphism for ordered trees and rela.. (context) - Grossi - 1991
3 LQL user notes: An informal guide to the lexical query langu.. (context) - Byrd - 1989
2 Grammatical tree matching (context) - Kilpelainen, Mannila - 1992
2 vol I and II (context) - Aho, Ullman et al. - 1972
2 Mind your grammar - a new approach to text databases (context) - Gonnet, Wm - 1987
1 An overview of Waterloo's database software for the OED (context) - Wm - 1992
1 string data model (context) - Mannila, Raiha et al. - 1990
1 Some comments on the subtree isomorphism problem for ordered.. (context) - Dublish - 1990
1 Information Processing Letters (context) - Verma, trees - 1992
1 Reference manual for ATBE -- a tool for approximate tree pat.. (context) - Wang, Jeong et al. - 1991
1 Theoretical Computer Science (context) - Burosch, Demetrovics et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.helsinki.fi/TR/A.html): More
Tools and Techniques for Decision Tree Learning - Elomaa (1996) (Correct)
Discovery of Frequent Patterns in Large Data Collections - Toivonen (1996) (Correct)
Eliot - an Algorithm Animation Environment - Sutinen, Tarhio, Lahtinen.. (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC