Schema-Driven Evaluation of Approximate Tree-Pattern Queries
暂无分享,去创建一个
[1] Gerhard Weikum,et al. Adding Relevance to XML , 2000, WebDB.
[2] Pekka Kilpeläinen,et al. Tree Matching Problems with Applications to Structured Text Databases , 2022 .
[3] Roy Goldman,et al. DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases , 1997, VLDB.
[4] Nicholas Kushmerick,et al. Expressive retrieval from XML documents , 2001, SIGIR '01.
[5] David Schach,et al. XML Query Language (XQL) , 1998, QL.
[6] Norbert Fuhr,et al. XIRQL: a query language for information retrieval in XML documents , 2001, SIGIR '01.
[7] Torsten Schlieder,et al. ApproXQL: Design and Implementation of an Approximate Pattern Matching Language for XML , 2001 .
[8] Kaizhong Zhang. A New Editing based Distance between Unordered Labeled Trees , 1993, CPM.
[9] Jeffrey F. Naughton,et al. Generating Synthetic Complex-Structured XML Data , 2001, WebDB.
[10] Kuo-Chung Tai,et al. The Tree-to-Tree Correction Problem , 1979, JACM.
[11] Stefano Ceri,et al. Comparative analysis of five XML query languages , 1999, SGMD.
[12] Torsten Schlieder,et al. Schema-Driven Evaluation of ApproXQL Queries , 2002 .
[13] Lusheng Wang,et al. Alignment of trees: an alternative to tree edit , 1995 .
[14] R. Statman,et al. Chapter 14. Approximate Tree Pattern Matching , .