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)
Incoming Non-self Citations Over Time
Authors
- 1. Leonid Libkin (University of Edinburgh)
- 2. Juan Reutter (Pontifical Catholic University of Chile; University of Edinburgh)
- 3. Domagoj Vrgoč (University of Edinburgh)
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,392 | Expressive Languages for Querying the Semantic Web | 2014 | PODS | 5.1677817e-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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 299 | GraphLog: a Visual Formalism for Real Life Recursion | 1990 | PODS | 0.00021766741 |
| 306 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00021533151 |
| 796 | On the Complexity of Bounded-Variable Queries | 1995 | PODS | 0.00013890233 |
| 1,148 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB | 0.00011777466 |
| 1,474 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS | 0.00010526746 |
| 2,238 | Monadic Datalog and the Expressive Power of Languages for Web Information Extraction | 2002 | PODS | 8.7761804e-05 |
| 2,494 | Querying Semantic Web Data with SPARQL | 2011 | PODS | 8.3699384e-05 |
| 3,483 | The Complexity of Evaluating Path Expressions in SPARQL | 2012 | PODS | 7.2450764e-05 |
| 3,806 | The Expressivity of XPath with Transitive Closure* | 2006 | PODS | 6.9902521e-05 |
| 8,077 | Graph Data Management Systems for New Application Domains | 2011 | VLDB | 5.3780077e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,103 | Natural Language Question Answering over RDF — A Graph Data Driven Approach | 2014 | SIGMOD |
| 2 | 4,858 | Graph Queries in a Next-Generation Datalog System | 2013 | VLDB |
| 3 | 5,073 | On the Optimization of Recursive Relational Queries: Application to Graph Queries | 2020 | SIGMOD |
| 4 | 9,647 | A Theory of Regular Queries | 2016 | PODS |
| 5 | 1,474 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS |
| 6 | 719 | Querying Graph Databases | 2013 | PODS |
| 7 | 8,858 | Graph Data Models, Query Languages and Programming Paradigms | 2018 | VLDB |
| 8 | 306 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD |
| 9 | 288 | Graphs-at-a-time: Query Language and Access Methods for Graph Databases | 2008 | SIGMOD |
| 10 | 9,392 | Expressive Languages for Querying the Semantic Web | 2014 | PODS |