Query Processing Over Graph Structured Data On The Web

In the last years, Linked Data initiatives have encouraged the publication of large graph-structured datasets using the Resource Description Framework (RDF). Due to the constant growth of RDF data on the web, more flexible data management infrastructures must be able to efficiently and effectively exploit the vast amount of knowledge accessible on the web. This book presents flexible query processing strategies over RDF graphs on the web using the SPARQL query language. In this work, we show how query engines can change plans on-the-fly with adaptive techniques to cope with unpredictable conditions and to reduce execution time. Furthermore, this work investigates the application of crowdsourcing in query processing, where engines are able to contact humans to enhance the quality of query answers. The theoretical and empirical results presented in this book indicate that flexible techniques allow for querying RDF data sources efficiently and effectively.

Many databases today capture both, structured and unstructured data. Making use of such hybrid data has become an important topic in research and industry. The efficient evaluation of hybrid data queries is the main topic of this thesis. Novel techniques are proposed that improve the whole processing pipeline, from indexes and query optimization to run-time processing. The contributions are evaluated in extensive experiments showing that the proposed techniques improve upon the state of the art.

Knowledge graphs are increasingly used in scientific and industrial applications. The large number and size of knowledge graphs published as Linked Data in autonomous sources has led to the development of various interfaces to query these knowledge graphs. Therefore, effective query processing approaches that enable efficient information retrieval from these knowledge graphs need to address the capabilities and limitations of different Linked Data Fragment interfaces. This book investigates novel approaches to addressing the challenges that arise in the presence of decentralized, heterogeneous sources of knowledge graphs. The effectiveness of these approaches is empirically evaluated and demonstrated using various real world and synthetic large-scale knowledge graphs throughout. First, a sample-based approach for generating fine-grained performance profiles is proposed, and it is demonstrated how the information from such profiles can be leveraged in cost model-based query planning. In addition, a sample-based data distribution profiling approach is advocated which aims to estimate the statistical profile features of large knowledge graphs and the applicability of these estimations in federated querying processing is demonstrated. The remainder of the book focuses on techniques to devise efficient query processing approaches when heterogeneous interfaces need to be queried but no fine-grained statistics are available. Robust techniques to support efficient query processing in these circumstances are investigated and results are shared to demonstrate the way in which these techniques can outperform state-of-the-art approaches. Finally, the author describes a framework for federated query processing over heterogeneous federations of Linked Data Fragments to exploit the capabilities of different sources by defining interface-aware approaches.

This book constitutes the refereed proceedings of the joint 6th International Semantic Web Conference, ISWC 2007, and the 2nd Asian Semantic Web Conference, ASWC 2007, held in Busan, Korea, in November 2007. The 50 revised full academic papers and 12 revised application papers presented together with 5 Semantic Web Challenge papers and 12 selected doctoral consortium articles were carefully reviewed and selected from a total of 257 submitted papers to the academic track and 29 to the applications track. The papers address all current issues in the field of the semantic Web, ranging from theoretical and foundational aspects to various applied topics such as management of semantic Web data, ontologies, semantic Web architecture, social semantic Web, as well as applications of the semantic Web. Short descriptions of the top five winning applications submitted to the Semantic Web Challenge competition conclude the volume.

"This revised and updated edition of Advanced ANSI SQL data modeling and structure processing ..."--Pref.

Managing and Mining Graph Data is a comprehensive survey book in graph management and mining. It contains extensive surveys on a variety of important graph topics such as graph languages, indexing, clustering, data generation, pattern mining, classification, keyword search, pattern matching, and privacy. It also studies a number of domain-specific scenarios such as stream mining, web graphs, social networks, chemical and biological data. The chapters are written by well known researchers in the field, and provide a broad perspective of the area. This is the first comprehensive survey book in the emerging topic of graph data processing. Managing and Mining Graph Data is designed for a varied audience composed of professors, researchers and practitioners in industry. This volume is also suitable as a reference book for advanced-level database students in computer science and engineering.

This book constitutes the refereed proceedings of the joined 6th International Semantic Web Conference, ISWC 2007, and the 2nd Asian Semantic Web Conference, ASWC 2007. The papers address all current issues in the field of the semantic Web, ranging from theoretical and foundational aspects to various applied topics such as management of semantic Web data, ontologies, semantic Web architecture, social semantic Web, as well as applications of the semantic Web.