Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Eleftherios Kalogeros"'
Autor:
Eleftherios Kalogeros
Στην παρούσα διδακτορική διατριβή μελετάται το πρόβλημα της παράλληλης επεξεργασίας ερωτημάτων σε μεγάλου όγκου διασυνδεδεμένα δεδομ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::74f4894f38ee9fea42cd6fb3aed4c9cf
https://doi.org/10.12681/eadd/51958
https://doi.org/10.12681/eadd/51958
Publikováno v:
Information Systems. 115:102194
As RDF becomes more widely established and the amount of linked data is rapidly increasing, the efficient querying of large amount of data becomes a significant challenge. In this paper, we propose a family of algorithms for querying large amount of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ddb73bdb917bd3df27ab95e18a5514a
https://doi.org/10.1016/j.is.2023.102194
https://doi.org/10.1016/j.is.2023.102194
Autor:
Eleftherios Kalogeros, Matthew Damigos, Michalis Sfakakis, Sofia Zapounidou, Aggeliki Drakopoulou, Costas Zervopoulos, Gerasimos Martinis, Christos Papatheodorou, Manolis Gergatsoulis
Publikováno v:
Metadata and Semantic Research ISBN: 9783030988753
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::08d47872e14eee23b1c18511320cc7b2
https://doi.org/10.1007/978-3-030-98876-0_32
https://doi.org/10.1007/978-3-030-98876-0_32
Publikováno v:
From Born-Physical to Born-Virtual: Augmenting Intelligence in Digital Libraries ISBN: 9783031217555
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b3a4d3629e7240136fc46eb369beb3e2
https://doi.org/10.1007/978-3-031-21756-2_27
https://doi.org/10.1007/978-3-031-21756-2_27
Autor:
Ioannis Mpismpikopoulos, Eleftherios Kalogeros, Manolis Gergatsoulis, Katerina Tsiouprou, Georgios Papaioannou, Robert Carter
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030916688
Lecture Notes in Computer Science
Lecture Notes in Computer Science
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43217e5beb93dbe7b956343820bab3ce
https://doi.org/10.1007/978-3-030-91669-5_28
https://doi.org/10.1007/978-3-030-91669-5_28
Publikováno v:
Metadata and Semantic Research ISBN: 9783030719029
MTSR
MTSR
This paper uses CIDOC CRM and CRM-based models (CRMarchaeo, CRMsci) to represent archaeological excavation activities and the observations of archaeologists during their work in the excavation field. These observations are usually recorded in documen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9766ec1d9ad0d6fb387b5e1bfcf7ff68
https://doi.org/10.1007/978-3-030-71903-6_33
https://doi.org/10.1007/978-3-030-71903-6_33
Publikováno v:
Metadata and Semantic Research ISBN: 9783030144005
MTSR
MTSR
In this paper, we investigate the problem of efficiently evaluating SPARQL queries, over large amount of linked data utilizing distributed NoSQL system. We propose an efficient approach for partitioning large linked data graphs using distributed fram
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c17e5ab3be9990c033520e32e4a89b43
https://doi.org/10.1007/978-3-030-14401-2_2
https://doi.org/10.1007/978-3-030-14401-2_2
Publikováno v:
International Journal of Metadata, Semantics and Ontologies. 14:63
In this paper, we investigate the problem of efficiently evaluating (Basic Graph Pattern) BGP SPARQL queries over a large amount of RDF data. We propose an effective data model for storing RDF data in a document database using maximum replication fac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2562bfd154954246d7924b09110acadc
https://doi.org/10.1504/ijmso.2020.107798
https://doi.org/10.1504/ijmso.2020.107798
Publikováno v:
Research and Advanced Technology for Digital Libraries ISBN: 9783319439969
TPDL
TPDL
The DBpedia ontology forms the structural backbone of DBpedia linked open dataset. Among its classes dbo:Building and dbo:HistoricBuilding entities, hold information for thousands of important buildings and monuments, thus making DBpedia an internati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac93f9e2ae781d25f6cb43fc1fa6772b
https://doi.org/10.1007/978-3-319-43997-6_33
https://doi.org/10.1007/978-3-319-43997-6_33
Publikováno v:
FiCloud
The problem of efficient querying large amount of linked data using Map-Reduce is investigated in this paper. The proposed approach is based on the following assumptions: a) Data graphs are arbitrarily partitioned in the distributed file system is su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aaa3299642dd97313e2f9dd0f4e29de6
https://doi.org/10.1109/ficloud.2015.36
https://doi.org/10.1109/ficloud.2015.36