DBScholar

Back to papers

A Query Language for NC

Summary: Query language extending relational algebra with divide-and-conquer set recursion that exactly captures NC on ordered relational databases. k nested recursion levels correspond precisely to AC^k; results extended to complex objects. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1027
Venue
PODS
Year
1994
Pagerank
5.7073076e-05
Overall Rank
7,086 | 51.39%
DOI
10.1145/182591.182610

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{suciu_pods94,
        address = {New York, NY, USA},
        series = {{PODS} '94},
        title = {{A Query Language for NC}},
        url = {https://dl.acm.org/doi/10.1145/182591.182610},
        doi = {10.1145/182591.182610},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Suciu, Dan and Breazu-Tannen, Val},
        year = {1994}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers