Tree Matching Problems with Applications to Structured Text Databases

A venturi scrubber for the scrubbing of an inlet gas stream with a scrubbing liquid or slurry, to remove gaseous or vaporous components from the gas stream, or to remove entrained solid particulate or discrete liquid droplet (fog or mist) constituents, and thereby to prevent air pollution and/or to recover the component or constituent. The venturi scrubber has an adjustable throat characterized by the provision of structure to adjust the cross-sectional dimension of the gas passage at or adjacent to the throat section. The structure includes at least one movable baffle at the periphery of the gas passage, and a container. The container is disposed external to and contiguous with the baffle, and a controlled amount of a fluid is passed into the container so that the internal fluid pressure within the container, and resultant volumetric dimension of the container, and thereby also the resultant displacement of the baffle relative to the periphery of the throat section, are adjustable in proportion to a change in the flow rate of the inlet gas stream.

[1]  Heather Brown.  Standards for Structured Documents , 1989, Comput. J..

[2]  Steven W. Reyner,et al.  An Analysis of a Good Algorithm for the Subtree Problem , 1977, SIAM J. Comput..

[3]  Zvi Galil,et al.  Faster tree pattern matching , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[4]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[5]  Forbes J. Burkowski.  Retrieval activities in a database consisting of heterogeneous collections of structured text , 1992, SIGIR '92.

[6]  Heikki Mannila,et al.  The Tree Inclusion Problem , 1991, TAPSOFT, Vol.1.

[7]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[8]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[9]  E. Sperner.  Ein Satz über Untermengen einer endlichen Menge , 1928 .

[10]  Leon Sterling,et al.  The Art of Prolog , 1987, IEEE Expert.

[11]  William F. Clocksin,et al.  Programming in Prolog , 1987, Springer Berlin Heidelberg.

[12]  Heikki Mannila,et al.  A Structured Document Database System , 1990 .

[13]  Roberto Grossi.  A Note on the Subtree Isomorphism for Ordered Trees and Related Problems , 1991, Inf. Process. Lett..

[14]  Michael McGill,et al.  Introduction to Modern Information Retrieval , 1983 .

[15]  Michael Stonebraker,et al.  Document processing in a relational database system , 1983, TOIS.

[16]  Moon-Jung Chung,et al.  O(n^(2.55)) Time Algorithms for the Subgraph Homeomorphism Problem on Trees , 1987, J. Algorithms.

[17]  Eiichi Tanaka,et al.  The Tree-to-Tree Editing Problem , 1988, Int. J. Pattern Recognit. Artif. Intell..

[18]  Christoph M. Hoffmann,et al.  Pattern Matching in Trees , 1982, JACM.

[19]  Maurice Bruynooghe,et al.  The memory management of PROLOG implementations , 1980 .

[20]  Kaizhong Zhang,et al.  Fast Serial and Parallel Algorithms for Approximate Tree Matching with VLDC's , 1992, CPM.

[21]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[22]  Kari-Jouko Räihä,et al.  On query languages for the P-string data model , 1990 .

[23]  Ian A. Macleod.  A Query Language for Retrieving Information from Hierarchic Text Structures , 1991, Comput. J..

[24]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[25]  Alfred V. Aho,et al.  Efficient string matching , 1975, Commun. ACM.

[26]  Alfred V. Aho,et al.  Principles of Compiler Design , 1977 .

[27]  Letizia Tanca,et al.  Logic Programming and Databases , 1990, Surveys in Computer Science.

[28]  Paliath Narendran,et al.  Complexity of Matching Problems , 1987, J. Symb. Comput..

[29]  Kaizhong Zhang,et al.  Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems , 1989, SIAM J. Comput..

[30]  Kaizhong Zhang,et al.  Approximate Tree Matching in the Presence of Variable Length Don't Cares , 1994, J. Algorithms.

[31]  Pratul Dublish.  Some Comments on the Subtree Isomorphism Problem for Ordered Trees , 1990, Inf. Process. Lett..

[32]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[33]  Rakesh M. Verma.  Strings, Trees, and Patterns , 1992, Inf. Process. Lett..

[34]  I. V. Ramakrishnan,et al.  Nonlinear Pattern Matching in Trees , 1988, ICALP.

[35]  Moshé M. Zloof.  Query-by-Example: A Data Base Language , 1977, IBM Syst. J..

[36]  Dana Angluin,et al.  Finding Patterns Common to a Set of Strings , 1980, J. Comput. Syst. Sci..

[37]  Kuo-Chung Tai,et al.  The Tree-to-Tree Correction Problem , 1979, JACM.

[38]  Robert E. Tarjan,et al.  Variations on the Common Subexpression Problem , 1980, J. ACM.

[39]  Philippe Flajolet,et al.  Analytic Variations on the Common Subexpression Problem , 1990, ICALP.

[40]  François Bancilhon,et al.  Managing Texts and Facts in a mixed Data Base Environment , 1983, ICOD-2 Workshop on New Applications of Data Bases.

[41]  M. Fischer,et al.  STRING-MATCHING AND OTHER PRODUCTS , 1974 .

[42]  Heikki Mannila,et al.  Grammatical Tree Matching , 1992, CPM.

[43]  V. Quint,et al.  Text processing and document manipulation: Grif: An Interactive System for Structured Document Manipulation , 1986 .

[44]  G. Coray,et al.  Text processing and document manipulation: Formatting Structure Documents: Batch versus Interactive? , 1986 .

[45]  Marc Gyssens,et al.  A grammar-based approach towards unifying hierarchical data models , 1989, SIGMOD '89.

[46]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[47]  Gaston H. Gonnet,et al.  Lexicographical Indices for Text: Inverted files vs. PAT trees , 1991 .

[48]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[49]  David S. Johnson,et al.  `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

[50]  David H. D. Warren,et al.  Efficient Processing of Interactive Relational Data Base Queries expressed in Logic , 1981, VLDB.

[51]  Kaizhong Zhang,et al.  Reference manual for the ATBE: A tool for approximate tree matching , 1991 .

[52]  Alfred V. Aho,et al.  The Theory of Parsing, Translation, and Compiling , 1972 .

[53]  Gyula O. H. Katona,et al.  On the Number of Databases and Closure Operations , 1991, Theor. Comput. Sci..

[54]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[55]  David Maier,et al.  Computing with Logic: Logic Programming with Prolog , 1988 .

[56]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.