DBScholar

Back to papers

TriAL for RDF: Adapting Graph Query Languages for RDF Data

Summary: TriAL: a triple-oriented algebra (plus recursive Datalog fragment) that queries RDF directly and preserves closure by replacing product with specialized join operators. Shows low-degree polynomial combined complexity, clarifies recursion issues for triples, and subsumes many graph-query languages. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1608
Venue
PODS
Year
2013
Pagerank
5.6242786e-05
Overall Rank
7,410 | 49.17%
DOI
10.1145/2463664.2465226

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{libkin_pods13,
        address = {New York, NY, USA},
        series = {{PODS} '13},
        title = {{TriAL for RDF: Adapting Graph Query Languages for RDF Data}},
        url = {https://dl.acm.org/doi/10.1145/2463664.2465226},
        doi = {10.1145/2463664.2465226},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Libkin, Leonid and Reutter, Juan and Vrgoč, Domagoj},
        year = {2013}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
9,181 Expressive Languages for Querying the Semantic Web 2014 PODS 5.3064263e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 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