Rational equivalence relations
Theoretical Computer Science
Improved limitedness theorems on finite automata with distance functions
Theoretical Computer Science - Special issue on theoretical computer science, algebra and combinatorics
Limitedness theorem on finite automata with distance functions: an algebraic proof
Theoretical Computer Science
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finding Regular Simple Paths in Graph Databases
SIAM Journal on Computing
Path constraints on semistructured and structured data
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Rewriting of regular expressions and regular path queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
New upper bounds to the limitedness of distance automata
Theoretical Computer Science
Regular path queries with constraints
Journal of Computer and System Sciences
Introduction to the Theory of Computation
Introduction to the Theory of Computation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
An Optimization Technique for Answering Regular Path Queries
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
View-Based Query Processing and Constraint Satisfaction
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Fault-tolerant computation of distributed regular path queries
Theoretical Computer Science
Preferential Regular Path Queries
Fundamenta Informaticae
Visibly pushdown transducers for approximate validation of streaming XML
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Combining approximation and relaxation in semantic web path queries
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Evolving schemas for streaming XML
Theoretical Computer Science
Evolving schemas for streaming XML
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
Query languages for graph databases
ACM SIGMOD Record
Preferential Regular Path Queries
Fundamenta Informaticae
Distributed multi-source regular path queries
ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
Expressive languages for selecting groups from graph-structured data
Proceedings of the 22nd international conference on World Wide Web
| Hi-index | 0.00 |
We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the query languages for semistructured databases. To enable approximations, we allow the regular path queries to be distorted. The distortions are expressed in the system by using weighted regular expressions, which correspond to weighted regular transducers. After defining the notion of weighted approximate answers we show how to compute them in order of their proximity to the query. In the new approximate setting, query containment has to be redefined in order to take into account the quantitative proximity information in the query answers. For this, we define the approximate containment, and its variants k-containment and reliable contain-ment. Then, we give an optimal algorithm for deciding the k-containment. Regarding the reliable approximate containment, we show that it is polynomial time equivalent to the notorious limitedness problem in distance automata.