Decomposing federated queries in presence of replicated fragments

详细信息    查看全文

• 作者：Gabriela Montoya^a ; ^{gabriela.montoya@univ-nantes.fr} ; Hala Skaf-Molli^a ; ^{hala.skaf@univ-nantes.fr} ; Pascal Molli^a ; ^{pascal.molli@univ-nantes.fr} ; Maria-Esther Vidal^b ; ^{mvidal@ldc.usb.ve}
• 关键词：Linked data ; Federated query processing ; Query decomposition ; Fragment replication
• 刊名：Web Semantics: Science, Services and Agents on the World Wide Web
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：42
• 期：Complete
• 页码：1-18
• 全文大小：1165 K
• 卷排序：42

文摘

Federated query engines allow for linked data consumption using SPARQL endpoints. Replicating data fragments from different sources enables data re-organization and provides the basis for more effective and efficient federated query processing. However, existing federated query engines are not designed to support replication. In this paper, we propose a replication-aware framework named LILAC, sparqL query decomposItion against federations of repLicAted data sourCes, that relies on replicated fragment descriptions to accurately identify sources that provide replicated data. We defined the query decomposition problem with fragment replication (QDP-FR). QDP-FR corresponds to the problem of finding the sub-queries to be sent to the endpoints that allows the federated query engine to compute the query answer, while the number of tuples to be transferred from endpoints to the federated query engine is minimized. An approximation of QDP-FR is implemented by the LILAC replication-aware query decomposition algorithm. Further, LILAC techniques have been included in the state-of-the-art federated query engines FedX and ANAPSID to evaluate the benefits of the proposed source selection and query decomposition techniques in different engines. Experimental results suggest that LILAC efficiently solves QDP-FR and is able to reduce the number of transferred tuples and the execution time of the studied engines.