Approximate schemas, source-consistency and query answering

Authors:
Michel Rougemont;Adrien Vieilleribière
Affiliations:
CNRS-LRI, University Paris-II, Paris, France;LRI, University Paris-Sud, Paris, France
Venue:
Journal of Intelligent Information Systems
Year:
2008

Citing 13
Cited 1

Property testing and its connection to learning and approximation

Journal of the ACM (JACM)
On Context-Free Languages

Journal of the ACM (JACM)
The String-to-String Correction Problem

Journal of the ACM (JACM)
The Tree-to-Tree Correction Problem

Journal of the ACM (JACM)
The string edit distance matching problem with moves

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Robust Characterizations of Polynomials withApplications to Program Testing

SIAM Journal on Computing
Regular Languages are Testable with a Constant Number of Queries

SIAM Journal on Computing
Data Exchange: Semantics and Query Answering

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Edit Distance with Move Operations

CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
On the Resemblance and Containment of Documents

SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
Frontiers of tractability for typechecking simple XML transformations

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML data exchange: consistency and query answering

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximate Satisfiability and Equivalence

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science

XML information retrieval through tree edit distance and structural summaries

AIRS'11 Proceedings of the 7th Asia conference on Information Retrieval Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are 驴-close if every word (tree) of one language is 驴-close to the other. A transducer model is introduced to compare tree languages (schemas) with different alphabets and attributes. Using the statistical embedding of Fischer et al. (Proceedings of 21st IEEE Symposium on Logic in Computer Science, pp. 421---430, 2006), we show that Source-Consistency and Approximate Query Answering are testable on words and trees, i.e. can be approximately decided within 驴 by only looking at a constant fraction of the input.