A query language and optimization techniques for unstructured data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
On saying “Enough already!” in SQL
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query containment for conjunctive queries with regular expressions
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Catching the boat with Strudel: experiences with a Web-site management system
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
ICDT '97 Proceedings of the 6th International Conference on Database Theory
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Utilizing Constraint Satisfaction Techniques for Efficient Graph Pattern Matching
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Managing semistructured data requires more flexibility than traditional database systems provide. Recently we proposed a query language for semistructured data represented as labeled directed graphs. This language is based on matching a partial schema into the database. In this paper we describe how we achieve this matching using constraints. We show how to match a schema into a database without using any additional information. In order to match schemata more efficiently, we are able to incorporate results of previously matched schemata. To this end, we formulate a sufficient condition for schema containment and describe how to test this condition, again, using constraints. We show how the knowledge of schema containment can be used for optimization. As a theoretical contribution we prove that, under some circumstances, schema matches can be found without any backtracking and in polynomial time.