Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Ian Letter

dblp:206/9536 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Distributed and cloud data management · 87% Knowledge graphs · 13%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed and cloud data management
client-server query processing		 0.312018
A Model of Distributed Query Computation in Client-Server Scenarios on the Semantic Web · IJCAI 2018
Distributed and cloud data management
distributed query processing		 0.312018
A Model of Distributed Query Computation in Client-Server Scenarios on the Semantic Web · IJCAI 2018

Methods — techniques the papers use, named apart from their topics

complexity analysis · 0.3
YearPublicationVenuePosition
2018 A Model of Distributed Query Computation in Client-Server Scenarios on the Semantic Web
abstract
This paper provides an overview of a model for capturing properties of client-server-based query computation setups. This model can be used to formally analyze different combinations of client and server capabilities, and compare them in terms of various fine-grain complexity measures. While the motivations and the focus of the presented work are related to querying the Semantic Web, the main concepts of the model are general enough to be applied in other contexts as well.
Olaf Hartig, Ian Letter, Jorge Pérez 0001
 IJCAI2
2017 A Formal Framework for Comparing Linked Data Fragments
Olaf Hartig, Ian Letter, Jorge Pérez 0001
 ISWC (1)2