This book details recent developments in the emerging area of plug-and-play (PnP) visual subgraph query interfaces (VQI). These PnP interfaces are grounded in the principles of human-computer interaction (HCI) and cognitive psychology to address long-standing limitations to bottom-up search capabilities in graph databases using traditional graph query languages, which often require domain experts and specialist programmers. This book explains how PnP interfaces go against the traditional mantra of VQI construction by taking a data-driven approach and giving end users the freedom to easily and quickly construct and maintain a VQI for any data sources without resorting to coding. The book walks readers through the intuitive PnP interface that uses templates where the underlying graph repository represents the socket and user-specified requirements represent the plug. Hence, a PnP interface enables an end user to change the socket (i.e., graph repository) or the plug (i.e., requirements) as necessary to automatically and effortlessly generate VQIs. The book argues that such a data-driven paradigm creates several benefits, including superior support for visual subgraph query construction, significant reduction in the manual cost of constructing and maintaining a VQI for any graph data source, and portability of the interface across diverse sources and querying applications. This book provides a comprehensive introduction to the notion of PnP interfaces, compares it to its classical manual counterpart, and reviews techniques for automatic construction and maintenance of these new interfaces. In synthesizing current research on plug-and-play visual subgraph query interface management, this book gives readers a snapshot of the state of the art in this topic as well as future research directions.

This book provides a comprehensive and accessible introduction to knowledge graphs, which have recently garnered notable attention from both industry and academia. Knowledge graphs are founded on the principle of applying a graph-based abstraction to data, and are now broadly deployed in scenarios that require integrating and extracting value from multiple, diverse sources of data at large scale. The book defines knowledge graphs and provides a high-level overview of how they are used. It presents and contrasts popular graph models that are commonly used to represent data as graphs, and the languages by which they can be queried before describing how the resulting data graph can be enhanced with notions of schema, identity, and context. The book discusses how ontologies and rules can be used to encode knowledge as well as how inductive techniques—based on statistics, graph analytics, machine learning, etc.—can be used to encode and extract knowledge. It covers techniques for the creation, enrichment, assessment, and refinement of knowledge graphs and surveys recent open and enterprise knowledge graphs and the industries or applications within which they have been most widely adopted. The book closes by discussing the current limitations and future directions along which knowledge graphs are likely to evolve. This book is aimed at students, researchers, and practitioners who wish to learn more about knowledge graphs and how they facilitate extracting value from diverse data at large scale. To make the book accessible for newcomers, running examples and graphical notation are used throughout. Formal definitions and extensive references are also provided for those who opt to delve more deeply into specific topics.

Data model. Queries. Types. Sysems. A syntax for data. XML.. Query languages. Query languages for XML. Interpretation and advanced features. Typing semistructured data. Query processing. The lore system. Strudel. Database products supporting XML. Bibliography. Index. About the authors.

Discover how graph databases can help you manage and query highly connected data. With this practical book, you’ll learn how to design and implement a graph database that brings the power of graphs to bear on a broad range of problem domains. Whether you want to speed up your response to user queries or build a database that can adapt as your business evolves, this book shows you how to apply the schema-free graph model to real-world problems. This second edition includes new code samples and diagrams, using the latest Neo4j syntax, as well as information on new functionality. Learn how different organizations are using graph databases to outperform their competitors. With this book’s data modeling, query, and code examples, you’ll quickly be able to implement your own solution. Model data with the Cypher query language and property graph model Learn best practices and common pitfalls when modeling with graphs Plan and implement a graph database solution in test-driven fashion Explore real-world examples to learn how and why organizations use a graph database Understand common patterns and components of graph database architecture Use analytical techniques and algorithms to mine graph database information

This book presents a comprehensive overview of fundamental issues and recent advances in graph data management. Its aim is to provide beginning researchers in the area of graph data management, or in fields that require graph data management, an overview of the latest developments in this area, both in applied and in fundamental subdomains. The topics covered range from a general introduction to graph data management, to more specialized topics like graph visualization, flexible queries of graph data, parallel processing, and benchmarking. The book will help researchers put their work in perspective and show them which types of tools, techniques and technologies are available, which ones could best suit their needs, and where there are still open issues and future research directions. The chapters are contributed by leading experts in the relevant areas, presenting a coherent overview of the state of the art in the field. Readers should have a basic knowledge of data management techniques as they are taught in computer science MSc programs.

This book provides an introduction to the mathematical and algorithmic foundations of data science, including machine learning, high-dimensional geometry, and analysis of large networks. Topics include the counterintuitive nature of data in high dimensions, important linear algebraic techniques such as singular value decomposition, the theory of random walks and Markov chains, the fundamentals of and important algorithms for machine learning, algorithms and analysis for clustering, probabilistic models for large networks, representation learning including topic modelling and non-negative matrix factorization, wavelets and compressed sensing. Important probabilistic techniques are developed including the law of large numbers, tail inequalities, analysis of random projections, generalization guarantees in machine learning, and moment methods for analysis of phase transitions in large random graphs. Additionally, important structural and complexity measures are discussed such as matrix norms and VC-dimension. This book is suitable for both undergraduate and graduate courses in the design and analysis of algorithms for data.

Existence of huge amounts of data on the Web has developed an undeferring need to locate right information at right time, as well as to integrating information effectively to provide a comprehensive source of relevant information. There is a need to develop efficient tools for analyzing and managing Web data, and efficiently managing Web information from the database perspective. The book proposes a data model called WHOM (Warehouse Object Model) to represent HTML and XML documents in the warehouse. It defines a set of web algebraic operators for building new web tables by extracting relevant data from the Web, as well as generating new tables from existing ones. These algebraic operators are used for change detection.