The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version)

Summary: Complexity analysis of positive-existential queries over databases with indefinite order information (partial orders interpreted via all linear extensions under open-world semantics with special nulls). Proves high hardness (Pi^p_2-complete containment; often intractable data complexity) and isolates PTIME fragments (monadic queries; some disjunctive cases via well-quasi-order arguments). (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 978
Venue: PODS
Year: 1992
Pagerank: 0.00019767772
Overall Rank: 581 | 95.96%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. R. van der Meyden

Incoming Citations (Sorted by Pagerank)

Showing 19 of 19 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
82	Answering Queries Using Views (Extended Abstract)	1995	PODS	0.00054402763
620	Constraint Programming and Database Languages: A Tutorial	1995	PODS	0.00019005954
810	Query Containment for Conjunctive Queries With Regular Expressions	1998	PODS	0.00016428374
938	Queries Independent of Updates	1993	VLDB	0.00015197786
971	Rewriting Aggregate Queries Using Views	1999	PODS	0.00014925576
976	Answering Queries Using Limited External Query Processors	1996	PODS	0.0001489085
1,578	Constraint Checking with Partial Information	1994	PODS	0.00011284233
1,952	Deciding Containment for Queries with Complex Objects (Extended Abstract)	1997	PODS	9.9677831e-05
2,103	Deciding Equivalences among Aggregate Queries	1998	PODS	9.5385023e-05
2,327	Obtaining Complete Answers from Incomplete Databases	1996	VLDB	9.0276061e-05
2,877	Semantic Query Optimization in Datalog Programs (Extended Abstract)	1995	PODS	7.9715251e-05
3,168	Query Containment for Data Integration Systems	2000	PODS	7.4508875e-05
5,195	Equivalence of Queries Combining Set and Bag-Set Semantics	2006	PODS	5.6366303e-05
5,471	Answering Queries Using Views with Arithmetic Comparisons	2002	PODS	5.4888202e-05
5,709	On the Containment and Equivalence of Database Queries with Linear Constraints* (Extended Abstract)	1997	PODS	5.3602702e-05
6,294	Containment of Nested XML Queries	2004	VLDB	5.1255418e-05
8,704	Equivalence of Nested Queries with Mixed Semantics	2009	PODS	4.4647149e-05
12,209	Completeness of Queries over Incomplete Databases	2011	VLDB	4.1945683e-05
12,432	Index-Based Multidimensional Array Queries: Safety and Equivalence	2007	PODS	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
856	Querying Constraints	1990	PODS	0.00015892437

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
431	On the Complexity of Database Queries (Extended Abstract)	1997	PODS	0.00023370207
571	The Complexity of Query Reliability	1998	PODS	0.00019910719
7,598	Polynomial-time program transformations in deductive databases	1990	PODS	4.7004867e-05
2,243	The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints	2015	PODS	9.2166927e-05
827	On the Representation and Querying of Sets of Possible Worlds	1987	SIGMOD	0.00016220185
6,236	Inherent Complexity of Recursive Queries (Extended Abstract)	1999	PODS	5.1436959e-05
3,681	Queries with Incomplete Answers over Semistructured Data	1999	PODS	6.8492288e-05
915	The Complexity of Evaluating Relational Queries	1983	PODS	0.0001538509
4,048	On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates	1998	PODS	6.4968603e-05
4,778	Dense-Order Constraint Databases (Extended Abstract)	1995	PODS	5.9290535e-05