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.00019753367
Overall Rank: 582 | 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.00054430106
618	Constraint Programming and Database Languages: A Tutorial	1995	PODS	0.00018990567
808	Query Containment for Conjunctive Queries With Regular Expressions	1998	PODS	0.000164132
937	Queries Independent of Updates	1993	VLDB	0.00015194231
971	Rewriting Aggregate Queries Using Views	1999	PODS	0.00014915911
976	Answering Queries Using Limited External Query Processors	1996	PODS	0.00014877501
1,579	Constraint Checking with Partial Information	1994	PODS	0.00011273105
1,959	Deciding Containment for Queries with Complex Objects (Extended Abstract)	1997	PODS	9.958725e-05
2,105	Deciding Equivalences among Aggregate Queries	1998	PODS	9.5309231e-05
2,331	Obtaining Complete Answers from Incomplete Databases	1996	VLDB	9.019917e-05
2,887	Semantic Query Optimization in Datalog Programs (Extended Abstract)	1995	PODS	7.9640219e-05
3,174	Query Containment for Data Integration Systems	2000	PODS	7.444226e-05
5,196	Equivalence of Queries Combining Set and Bag-Set Semantics	2006	PODS	5.6311982e-05
5,496	Answering Queries Using Views with Arithmetic Comparisons	2002	PODS	5.4741922e-05
5,719	On the Containment and Equivalence of Database Queries with Linear Constraints* (Extended Abstract)	1997	PODS	5.3551435e-05
6,293	Containment of Nested XML Queries	2004	VLDB	5.1206121e-05
8,699	Equivalence of Nested Queries with Mixed Semantics	2009	PODS	4.4604187e-05
12,217	Completeness of Queries over Incomplete Databases	2011	VLDB	4.1905499e-05
12,441	Index-Based Multidimensional Array Queries: Safety and Equivalence	2007	PODS	4.1905499e-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
855	Querying Constraints	1990	PODS	0.00015877874

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
432	On the Complexity of Database Queries (Extended Abstract)	1997	PODS	0.00023349408
572	The Complexity of Query Reliability	1998	PODS	0.00019888988
7,603	Polynomial-time program transformations in deductive databases	1990	PODS	4.6959912e-05
2,246	The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints	2015	PODS	9.2039096e-05
6,234	Inherent Complexity of Recursive Queries (Extended Abstract)	1999	PODS	5.1387584e-05
823	On the Representation and Querying of Sets of Possible Worlds	1987	SIGMOD	0.00016225326
3,683	Queries with Incomplete Answers over Semistructured Data	1999	PODS	6.84255e-05
912	The Complexity of Evaluating Relational Queries	1983	PODS	0.00015374685
4,782	Dense-Order Constraint Databases (Extended Abstract)	1995	PODS	5.9233349e-05
4,055	On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates	1998	PODS	6.4906839e-05