Skip to Content
Future InternetFuture Internet
  • Article
  • Open Access

20 November 2025

21 Pages

Semantic Data Federated Query Optimization Based on Decomposition of Block-Level Subqueries

and
1
School of Engineering, University of Glasgow, Glasgow G12 8QQ, UK
2
School of Computer Science (National Pilot Software Engineering School), Beijing University of Posts and Telecommunications, Beijing 100876, China
*
Authors to whom correspondence should be addressed.

Abstract

The digital age and the rise of Internet of Things technology have led to an explosion of data, including vast amounts of semantic data. In the context of large-scale semantic data graphs, centralized storage struggles to meet the efficiency requirements of the queries. This has led to a shift towards distributed semantic data systems. In federated semantic data systems, ensuring both query efficiency and comprehensive results is challenging because of data independence and privacy constraints. To address this, we propose a query processing framework featuring a block-level star decomposition method for generating efficient query plans, augmented by auxiliary indexes to guarantee the completeness of the results. A specialized FEDERATEDAND BY keyword is introduced for federated environments, and a partition-based parallel assembly method accelerates the result integration. Our approach demonstrably improves query efficiency and is analyzed for its potential application in energy systems.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.