International Workshop on the Web and Databases · 2001 · 51 citations · 3 references
ComputingComputer ScienceInformation SystemsAlgorithmsDatabasesInformation RetrievalNearest Neighbor SearchQuery OptimizationQuery ProcessingSearching AlgorithmsStructured Query LanguageXml DatabasesCost-based Query OptimizationSimilarity SearchXml Data ManagementXml Data ModelsXml Document RetrievalXml IndexingXml Query Processing
XML query engines should support structured queries. They should retrieve exact matches as well as results similar to the query. In this paper, we introduce the simple query language approXQL that supports hierarchical, Boolean-connected query patterns. The interpretation of approXQL queries is founded on cost-based query transformations: The total cost of a sequence of transformations measures the similarity between a query and the data and is used to rank the results. All results of an approXQL query can be computed in polynomial time with respect to the database size.
3
The Tree-to-Tree Correction Problem
Kuo‐Chung Tai · Journal of the ACM · 1979 · 863 citations · Full text
Jonathan Robie · Journal of Applied Microbiology · 1998 · 251 citations