Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The World Wide b currently evolves into a b of Linked Data where content providers publish and link data as they have done with hypertext for the last 20 years. While the declarative query language SPARQL is the de facto for querying a-priory defined sets of data from the b, no language exists for querying the b of Linked Data itself. Hover, it seems natural to ask whether SPARQL is also suitable for such a purpose#R##N##R##N#  formally investigate the applicability of SPARQL as a query language for Linked Data on the b. In particular,  study two query models: 1) a full-b semantics where the scope of a query is the complete set of Linked Data on the b and 2) a family of reachability-based semantics which restrict the scope to data that is reachable by traversing certain data links. For both models  discuss properties such as monotonicity and computability as ll as the implications of querying ab that is infinitely large due to data generating servers.
['Olaf Hartig']
I am writing a research paper on a idea SPARQL for a web of linked data: semantics and computability
[{"from": "human", "value": "I am writing a research paper on a idea SPARQL for a web of linked data: semantics and computability"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The World Wide b currently evolves into a b of Linked Data where content providers publish and link data as they have done with hypertext for the last 20 years. While the declarative query language SPARQL is the de facto for querying a-priory defined sets of data from the b, no language exists for querying the b of Linked Data itself. Hover, it seems natural to ask whether SPARQL is also suitable for such a purpose#R##N##R##N#  formally investigate the applicability of SPARQL as a query language for Linked Data on the b. In particular,  study two query models: 1) a full-b semantics where the scope of a query is the complete set of Linked Data on the b and 2) a family of reachability-based semantics which restrict the scope to data that is reachable by traversing certain data links. For both models  discuss properties such as monotonicity and computability as ll as the implications of querying ab that is infinitely large due to data generating servers."}]