Database Paper Browser

Back to papers

Queries with Incomplete Answers over Semistructured Data

Summary: Formalizes query evaluation with partial (maximal) answers over semistructured (labeled graph) data via a two‑phase model: a search phase with three matching semantics and a filter phase distinguishing weak vs. strong constraints. Provides algorithms, complexity and containment analyses for each semantics and a polynomial-time evaluation result for a restricted class of filter queries. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1177
Venue
PODS
Year
1999
Pagerank
6.84255e-05
Overall Rank
3,683 | 74.41%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
3,285 Foundations of Semantic Web Databases 2004 PODS 7.2738104e-05
5,275 Annotated XML: Queries and Provenance 2008 PODS 5.5908918e-05
6,505 Representing and Querying XML with Incomplete Information 2001 PODS 5.0282726e-05
9,512 Computing Full Disjunctions 2003 PODS 4.3299485e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 15 of 15 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers