DBScholar

Back to papers

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)

Paper ID
849
Venue
PODS
Year
1989
Pagerank
5.093636e-05
Overall Rank
13,129 | 9.93%
DOI
10.1145/73721.73726

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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,690 Incomplete Objects - A Data Model for Design and Planning Applications 1991 SIGMOD 0.00010001011
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
947 On the Representation and Querying of Sets of Possible Worlds 1987 SIGMOD 0.00013041389
Previous Page 1 / 1 Next

Semantically Similar Papers