Flexible Queries Over Semistructured Data

Abstract

Flexible queries facilitate, in a novel way, easy and concise querying of databases that have varying structures. Two different semantics, flexible and semiflexible, are introduced and investigated. The complexity of evaluating queries under the two semantics is analyzed. Query evaluation is polynomial in the size of the query, the database and the result in the following two cases. First, a semiflexible DAG query and a tree database. Second, a flexible tree query and a database that is any graph. Query containment and equivalence are also investigated. For the flexible semantics, query equivalence is always polynomial. For the semiflexible semantics, query equivalence is polynomial for DAG queries and exponential when the queries have cycles. Under the semiflexible and flexible semantics, two databases could be equivalent even when they are not isomorphic. Database equivalence is formally defined and characterized. The complexity of deciding equivalences among databases is analyzed. The implications of database equivalence on query evaluation are explained.

DOI: 10.1145/375551.375558

Extracted Key Phrases

Statistics

051015'02'04'06'08'10'12'14'16
Citations per Year

126 Citations

Semantic Scholar estimates that this publication has 126 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Kanza2001FlexibleQO, title={Flexible Queries Over Semistructured Data}, author={Yaron Kanza and Yehoshua Sagiv}, booktitle={PODS}, year={2001} }