Výsledky vyhledávání - "Adaptive Query Optimization"

Extended Adaptive Join Operator with Bind-Bloom Join for Federated SPARQL Queries

Autor: Abdelkader Hameurlain, Shaoyi Yin, Damla Oguz, Oguz Dikenelli, Belgin Ergenc

Publikováno v: International Journal of Data Warehousing and Mining (IJDWM).

The goal of query optimization in query federation over linked data is to minimize the response time and the completion time. Communication time has the highest impact on them both. Static query optimization can end up with inefficient execution plan

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9be8e7ea3c43d46d911ce2f5ba1aab97
https://oatao.univ-toulouse.fr/19041/

Zobrazit plný text záznamu

Dissertation/ Thesis

Méthodes d'optimisation pour le traitement de requêtes réparties à grande échelle sur des données liées

Autor: Oğuz, Damla

Données Liées est un terme pour définir un ensemble de meilleures pratiques pour la publication et l'interconnexion des données structurées sur le Web. A mesure que le nombre de fournisseurs de Données Liées augmente, le Web devient un vaste e

Externí odkaz: http://www.theses.fr/2017TOU30067/document

Zobrazit plný text záznamu

Optimization methods for large-scale distributed query processing on linked data

Autor: Oğuz, Damla

Publikováno v: Web. Université Paul Sabatier-Toulouse III, 2017. Français. ⟨NNT : 2017TOU30067⟩

Linked Data is a term to define a set of best practices for publishing and interlinking structured data on the Web. As the number of data providers of Linked Data increases, the Web becomes a huge global data space. Query federation is one of the app

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::5d1950c2108b5807b03d447d0ea63ade
https://tel.archives-ouvertes.fr/tel-01820773/document

Zobrazit plný text záznamu

Büyük ölçekli dağıtık bağlı veri üzerinde sorgu işleme için eniyileme yöntemleri

Autor: Oğuz, Damla

Publikováno v: Web. Université Paul Sabatier-Toulouse III, 2017. Français. ⟨NNT : 2017TOU30067⟩

As the number of Linked Data providers increases, the Web becomes a huge global data space. Query federation is one of the approaches for querying this distributed data space. Query optimization in this approach aims to minimize the response time and

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::990e4a19e7d524e9c37ca64249774f35
https://acikbilim.yok.gov.tr/handle/20.500.12812/369690

Zobrazit plný text záznamu

Adaptive Join Operator for Federated Queries over Linked Data Endpoints

Autor: Abdelkader Hameurlain, Belgin Ergenc, Oguz Dikenelli, Damla Oguz, Shaoyi Yin

Publikováno v: Advances in Databases and Information Systems
20th East-European Conference on Advances in Databases and Information Systems (ADBIS 2016)
20th East-European Conference on Advances in Databases and Information Systems (ADBIS 2016), Aug 2016, Prague, Czech Republic. pp. 275-290
Advances in Databases and Information Systems ISBN: 9783319440385
ADBIS

20th East European Conference on Advances in Databases and Information Systems, ADBIS 2016; Prague; Czech Republic; 28 August 2016 through 31 August 2016
Traditional static query optimization is not adequate for query federation over linked data

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5757f0b059e3bb3994422c17818b4c10
https://hal.archives-ouvertes.fr/hal-01474885

Zobrazit plný text záznamu

10381 Summary and Abstracts Collection �� Robust Query Processing

Autor: Graefe, G��tz, K��nig, Arnd Christian, Kuno, Harumi Anne, Markl, Volker, Sattler, Kai-Uwe

Dagstuhl seminar 10381 on robust query processing (held 19.09.10 - 24.09.10) brought together a diverse set of researchers and practitioners with a broad range of expertise for the purpose of fostering discussion and collaboration regarding causes, o

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::5df8b41e12dac3778f4d6821e7bb139d

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání