Expressive power and data complexity of nonrecursive query languages for lists and trees (Extended Abstract)

Authors

• 1. Evgeny Dantsin (St. Petersburg Institute of Mathematics; University of Manchester)
• 2. Andrei Voronkov (University of Manchester)

@inproceedings{dantsin_pods00,
        address = {New York, NY, USA},
        series = {{PODS} '00},
        title = {{Expressive power and data complexity of nonrecursive query languages for lists and trees (Extended Abstract)}},
        url = {https://dl.acm.org/doi/10.1145/335168.335218},
        doi = {10.1145/335168.335218},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Dantsin, Evgeny and Voronkov, Andrei},
        year = {2000}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

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

Semantically Similar Papers