Affiliation:
1. Lyon 1 University, Lyon, France
2. University of Bayreuth, Bayreuth, Germany
Abstract
With the adoption of RDF as the data model for Linked Data and the Semantic Web, query specification from end-users has become more and more common in SPARQL endpoints. In this paper, we conduct an in-depth analytical study of the queries formulated by end-users and harvested from large and up-to-date query logs from a wide variety of RDF data sources. As opposed to previous studies, ours is the first assessment on a voluminous query corpus, spanning over several years and covering many representative SPARQL endpoints. Apart from the syntactical structure of the queries, that exhibits already interesting results on this generalized corpus, we drill deeper in the structural characteristics related to the graph and hypergraph representation of queries. We outline the most common shapes of queries when visually displayed as undirected graphs, and characterize their (hyper-)tree width. Moreover, we analyze the evolution of queries over time, by introducing the novel concept of a streak, i.e., a sequence of queries that appear as subsequent modifications of a seed query. Our study offers several fresh insights on the already rich query features of real SPARQL queries formulated by real users, and brings us to draw a number of conclusions and pinpoint future directions for SPARQL query evaluation, query optimization, tuning, and benchmarking.
Subject
General Earth and Planetary Sciences,Water Science and Technology,Geography, Planning and Development
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The Road Ahead;Synthesis Lectures on Data Management;2023
2. Pattern Selection for Large Networks;Synthesis Lectures on Data Management;2023
3. Characterizing Robotic and Organic Query in SPARQL Search Sessions;Web and Big Data;2020
4. An Efficient Index for RDF Query Containment;Proceedings of the 2019 International Conference on Management of Data;2019-06-25
5. Efficiently Answering Regular Simple Path Queries on Large Labeled Networks;Proceedings of the 2019 International Conference on Management of Data;2019-06-25