Towards Interactive Analytics over RDF Graphs

نویسندگان

چکیده

The continuous accumulation of multi-dimensional data and the development Semantic Web Linked Data published in Resource Description Framework (RDF) bring new requirements for analytics tools. Such tools should take into account special features RDF graphs, exploit semantics support flexible aggregate queries. In this paper, we present an approach applying to based on a high-level functional query language, called HIFUN. According that each analytical is considered be well-formed expression algebra its definition independent nature structure data. investigate how HIFUN can used easing formulation analytic queries over We detail applicability RDF, as well transformations may required, introduce translation rules SPARQL describe first implementation proposed model.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Neighborhood Window Analytics over Large-Scale Graphs

Information networks are often modeled as graphs, where the vertices are associated with attributes. In this paper, we study neighborhood window analytics, namely k-hop window query, that aims to capture the properties of a local community involving the k-hop neighbors (defined on the graph structures) of each vertex. We develop a novel index, Dense Block Index (DBIndex), to facilitate efficien...

متن کامل

Piglet: Interactive and Platform Transparent Analytics for RDF & Dynamic Data

Data analytics has gained more and more focus during recent years and many data processing platforms have been developed. They all provide a powerful but often complex API that users have to learn. Furthermore, results can only be stored or printed, without any possibility for visualization. In this paper we present Piglet, a compiler for the high-level Pig Latin script language that generates ...

متن کامل

A Query Approximating Approach Over RDF Graphs

Regardless of the knowledge structure lack about Resource Description Framework (RDF) data, difficulties, principally, occur in specifying and answering queries. Approximate querying is the solution to find relevant information by getting a set of sub structures (e.g. sub graphs) matching the query. Approaches based on the structure and others based on semantic, marginalized the common meaning ...

متن کامل

Faceted search over RDF-based knowledge graphs

Knowledge graphs such as Yago and Freebase have become a powerful asset for enhancing search, and are being intensively used in both academia in industry. Many existing knowledge graphs are either available as Linked Open Data, or they can be exported as RDF datasets enhanced with background knowledge in the form of an OWL 2 ontology. Faceted search is the de facto approach for exploratory sear...

متن کامل

Towards an RDF Analytics Language: Learning from Successful Experiences

SPARQL, the W3C standard querying language for RDF, provides rich capabilities for slicing and dicing RDF data. The latest version, SPARQL 1.1, added support for aggregation, nested and distributed queries among others. Nevertheless, the purely declarative nature of SPARQL and the lack of support for common programming patterns, such as recursion and iteration, make it challenging to perform co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithms

سال: 2021

ISSN: ['1999-4893']

DOI: https://doi.org/10.3390/a14020034