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
- 2. K. Vadaparty
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,297 | Incomplete Objects - A Data Model for Design and Planning Applications | 1991 | SIGMOD | 0.00012758233 |
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 |
|---|---|---|---|---|
| 827 | On the Representation and Querying of Sets of Possible Worlds | 1987 | SIGMOD | 0.00016220185 |
Previous
Page 1 / 1
Next