Complexity of Query Processing in Databases with OR-Objects
Summary: Complete syntactic characterization of CoNP-complete versus PTIME conjunctive queries over OR-Databases, enabling complexity-aware schema and query-design. Extending this classification to disjunctive queries (negation on base predicates) would settle Graph Isomorphism's complexity. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. T. Imielinski (Rutgers University)
- 2. K. Vadaparty (Rutgers University)
BibTeX Citation
@inproceedings{imielinski_pods89,
address = {New York, NY, USA},
series = {{PODS} '89},
title = {{Complexity of Query Processing in Databases with OR-Objects}},
url = {https://dl.acm.org/doi/10.1145/73721.73726},
doi = {10.1145/73721.73726},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Imielinski, T. and Vadaparty, K.},
year = {1989}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,718 | Incomplete Objects - A Data Model for Design and Planning Applications | 1991 | SIGMOD | 9.7987023e-05 |
Previous
Page 1 / 1
Next
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 |
|---|---|---|---|---|
| 970 | On the Representation and Querying of Sets of Possible Worlds | 1987 | SIGMOD | 0.00012772086 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,864 | A Decision Procedure for Conjunctive Query Disjointness | 1989 | PODS |
| 2 | 13,283 | Normalizing Incomplete Databases | 1995 | PODS |
| 3 | 1,503 | The Complexity of Evaluating Relational Queries | 1983 | PODS |
| 4 | 7,712 | Complexity Aspects of Various Semantics for Disjunctive Databases | 1993 | PODS |
| 5 | 7,858 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS |
| 6 | 8,053 | Polynomial-time program transformations in deductive databases | 1990 | PODS |
| 7 | 642 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS |
| 8 | 1,065 | The Dichotomy of Conjunctive Queries on Probabilistic Structures | 2007 | PODS |
| 9 | 1,735 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 10 | 3,870 | On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates | 1998 | PODS |