Amanote Research

Amanote Research

    RegisterSign In

A Path-Sequence Based Discrimination for Subtree Matching in Approximate XML Joins

doi 10.1109/icdew.2006.15
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2006

Authors
H. Yokota
Publisher

IEEE


Related search

Approximate Subtree Identification in Heterogeneous XML Documents Collections

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

A System for Approximate Tree Matching

IEEE Transactions on Knowledge and Data Engineering
Computational TheoryComputer Science ApplicationsInformation SystemsMathematics
1994English

Efficient Structural Joins on Indexed XML Documents

2002English

Inconsistent Path Detection for XML IDEs

2011English

Path Locks for XML Document Collaboration

English

A Suboptimal Lossy Data Compression Based on Approximate Pattern Matching

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1997English

A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1999English

Vector Algorithms for Approximate String Matching

International Journal of Foundations of Computer Science
Computer Science
2002English

Phrase-Based Statistical Machine Translation Using Approximate Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy