Ruben Verborgh’s data

Matches in Ruben’s data for { ?s ?p ?o }

• 978-3-030-74296-6_3 subject Linked_Data.
• 978-3-030-74296-6_3 subject World_Wide_Web.
• 978-3-030-74296-6_3 authorList b0_b1949.
• 978-3-030-74296-6_3 topic interoperability.
• 978-3-030-74296-6_3 topic Hypermedia.
• 978-3-030-74296-6_3 topic Linked_Data.
• 978-3-030-74296-6_3 topic World_Wide_Web.
• 978-3-030-74296-6_3 abstract "Fostering interoperability, Public Sector Bodies (PSBs) maintain datasets that should become queryable as an integrated Knowledge Graph (KG). While some PSBs allow to query a part of the KG on their servers, others favor publishing data dumps allowing the querying to happen on third party servers. As the budget of a PSB to publish their dataset on the Web is finite, PSBs need guidance on what interface to offer first. A core API can be designed that covers the core tasks of Base Registries, which is a well-defined term in Flanders for the management of authoritative datasets. This core API should be the basis on which an ecosystem of data services can be built. In this paper, we introduce the concept of a Linked Data Event Stream (LDES) for datasets like air quality sensors and observations or a registry of officially registered addresses. We show that extra ecosystem requirements can be built on top of the LDES using a generic fragmenter. By using hypermedia for describing the LDES as well as the derived datasets, agents can dynamically discover their best way through the KG, and server administrators can dynamically add or remove functionality based on costs and needs. This way, we allow PSBs to prioritize API functionality based on three tiers: (i) the LDES, (ii) intermediary indexes and (iii) querying interfaces. While the ecosystem will never be feature-complete, based on the market needs, PSBs as well as market players can fill in gaps as requirements evolve.".
• 978-3-030-74296-6_3 datePublished "2021".
• 978-3-030-74296-6_3 mainEntityOfPage vanlancker_icwe_2021.
• 978-3-030-74296-6_3 sameAs 978-3-030-74296-6_3.
• 978-3-030-74296-6_3 isPrimaryTopicOf vanlancker_icwe_2021.
• 978-3-030-74296-6_3 page vanlancker_icwe_2021.
• 978-3-030-74296-6_3 number "12840".
• 978-3-030-74296-6_3 number "36".
• 978-3-030-74296-6_3 number "28".
• 978-3-030-74296-6_3 volume "12840".
• 978-3-030-74296-6_3 locator "12840".
• 978-3-030-74296-6_3 locator "36".
• 978-3-030-74296-6_3 locator "28".
• 978-3-030-74296-6_3 volume "12840".
• 978-3-030-74296-6_3 position "12840".
• 978-3-030-74296-6_3 volumeNumber "12840".
• 978-3-030-74296-6_3 endingPage "36".
• 978-3-030-74296-6_3 startingPage "28".
• 978-3-030-74296-6_3 pageEnd "36".
• 978-3-030-74296-6_3 pageStart "28".
• 978-3-030-74296-6_3 pageEnd "36".
• 978-3-030-74296-6_3 pageStart "28".
• 978-3-030-74296-6_5 author me.
• 978-3-030-74296-6_5 author harm_delva.
• 978-3-030-74296-6_5 author dedecker_ruben.
• 978-3-030-74296-6_5 author me.
• 978-3-030-74296-6_5 creator me.
• 978-3-030-74296-6_5 creator harm_delva.
• 978-3-030-74296-6_5 creator dedecker_ruben.
• 978-3-030-74296-6_5 creator me.
• 978-3-030-74296-6_5 about Linked_Data_Fragments.
• 978-3-030-74296-6_5 about Web_API.
• 978-3-030-74296-6_5 about Linked_Data.
• 978-3-030-74296-6_5 about World_Wide_Web.
• 978-3-030-74296-6_5 author me.
• 978-3-030-74296-6_5 author harm_delva.
• 978-3-030-74296-6_5 author dedecker_ruben.
• 978-3-030-74296-6_5 author me.
• 978-3-030-74296-6_5 coparticipatesWith me.
• 978-3-030-74296-6_5 coparticipatesWith harm_delva.
• 978-3-030-74296-6_5 coparticipatesWith dedecker_ruben.
• 978-3-030-74296-6_5 coparticipatesWith me.
• 978-3-030-74296-6_5 type PublicationVolume.
• 978-3-030-74296-6_5 type ScholarlyArticle.
• 978-3-030-74296-6_5 type Article.
• 978-3-030-74296-6_5 type Document.
• 978-3-030-74296-6_5 type Q386724.
• 978-3-030-74296-6_5 type CreativeWork.
• 978-3-030-74296-6_5 type Document.
• 978-3-030-74296-6_5 type Work.
• 978-3-030-74296-6_5 type Document.
• 978-3-030-74296-6_5 P50 me.
• 978-3-030-74296-6_5 P50 harm_delva.
• 978-3-030-74296-6_5 P50 dedecker_ruben.
• 978-3-030-74296-6_5 P50 me.
• 978-3-030-74296-6_5 maker me.
• 978-3-030-74296-6_5 maker harm_delva.
• 978-3-030-74296-6_5 maker dedecker_ruben.
• 978-3-030-74296-6_5 maker me.
• 978-3-030-74296-6_5 title "A File-Based Linked Data Fragments Approach to Prefix Search".
• 978-3-030-74296-6_5 isPartOf proceedings_of_the_21th_international_conference_on_web_engineering.
• 978-3-030-74296-6_5 name "A File-Based Linked Data Fragments Approach to Prefix Search".
• 978-3-030-74296-6_5 label "A File-Based Linked Data Fragments Approach to Prefix Search".
• 978-3-030-74296-6_5 name "A File-Based Linked Data Fragments Approach to Prefix Search".
• 978-3-030-74296-6_5 topic Linked_Data_Fragments.
• 978-3-030-74296-6_5 topic Web_API.
• 978-3-030-74296-6_5 topic Linked_Data.
• 978-3-030-74296-6_5 topic World_Wide_Web.
• 978-3-030-74296-6_5 subject Linked_Data_Fragments.
• 978-3-030-74296-6_5 subject Web_API.
• 978-3-030-74296-6_5 subject Linked_Data.
• 978-3-030-74296-6_5 subject World_Wide_Web.
• 978-3-030-74296-6_5 authorList b0_b1959.
• 978-3-030-74296-6_5 topic Linked_Data_Fragments.
• 978-3-030-74296-6_5 topic Web_API.
• 978-3-030-74296-6_5 topic Linked_Data.
• 978-3-030-74296-6_5 topic World_Wide_Web.
• 978-3-030-74296-6_5 abstract "Text-fields that need to look up specific entities in a dataset can be equipped with autocompletion functionality. When a dataset becomes too large to be embedded in the page, setting up a full-text search API is not the only alternative. Alternate API designs that balance different trade-offs such as archivability, cacheability and privacy, may not require setting up a new back-end architecture. In this paper, we propose to perform prefix search over a fragmentation of the dataset, enabling the client to take part in the query execution by navigating through the fragmented dataset. Our proposal consists of (i) a self-describing fragmentation strategy, (ii) a client search algorithm, and (iii) an evaluation of the proposed solution, based on a small dataset of 73k entities and a large dataset of 3.87 m entities. We found that the server cache hit ratio is three times higher compared to a server-side prefix search API, at the cost of a higher bandwidth consumption. Nevertheless, an acceptable user-perceived performance has been measured: assuming 150 ms as an acceptable waiting time between keystrokes, this approach allows 15 entities per prefix to be retrieved in this interval. We conclude that an alternate set of trade-offs has been established for specific prefix search use cases: having added more choice to the spectrum of Web APIs for autocompletion, a file-based approach enables more datasets to afford prefix search.".
• 978-3-030-74296-6_5 datePublished "2021".
• 978-3-030-74296-6_5 mainEntityOfPage dedecker_icwe_2021.
• 978-3-030-74296-6_5 sameAs 978-3-030-74296-6_5.
• 978-3-030-74296-6_5 isPrimaryTopicOf dedecker_icwe_2021.
• 978-3-030-74296-6_5 page dedecker_icwe_2021.
• 978-3-030-74296-6_5 number "67".
• 978-3-030-74296-6_5 number "12840".
• 978-3-030-74296-6_5 number "53".
• 978-3-030-74296-6_5 volume "12840".
• 978-3-030-74296-6_5 locator "67".
• 978-3-030-74296-6_5 locator "12840".
• 978-3-030-74296-6_5 locator "53".
• 978-3-030-74296-6_5 volume "12840".
• 978-3-030-74296-6_5 position "12840".
• 978-3-030-74296-6_5 volumeNumber "12840".

• first
• previous
• next