Dataset · Atlas · Vocabulary
Low-Cost Queryable Linked Data through Triple Pattern Fragments
https://momo54.github.io/fedlit/paper/conf/semweb/VerborghHMHVSCCMW14a
- Authors
- Ruben Verborgh, Olaf Hartig, Ben De Meester, Gerald Haesendonck, Laurens De Vocht, Miel Vander Sande, Richard Cyganiak, Pieter Colpaert, Erik Mannens, Rik Van de Walle
- Year
- 2014
- Venue
- ISWC
- Type
- Demo, poster or PhD symposium paper
- Links
- DBLP
- Found by
- title search
Classification
Made by an LLM (Claude), in a single pass, and not yet validated by a human coder.
- Category
- Decentralized querying (related)
- Family
- Reliable, low-cost interfaces
- Based on
- title and prior knowledge
- Problem
- Low-cost queryable Linked Data (TPF)
- Problème
- Linked Data interrogeable à faible coût (TPF)
- Motivated by unreliable servers
- yes