Efficient query answering against dynamic RDF databases

Goasdoué, François; Manolescu, Ioana; Roatiş, Alexandra

doi:10.1145/2452376.2452412

Cited by 35 publications

(51 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We will commit specific thoughtfulness regarding an educational acquaintance of the issues related with thinking, since they are frequently disregarded in standard database works. We will represent with nitty gritty cases and present the different procedures proposed in the writing to deal with understood information [2,31] and their execution tradeoffs [24]. Toward the finish of this fragment, the group of onlookers will have a decent handle of the RDF model and RDF information administration issues.…”

Section: Related Work Semistructured Data and Rdfmentioning

confidence: 99%

“…Notwithstanding they might be seen impeded from the point of view of the information store, given that they don't have effective fine-grained information stores to depend on. Delegates of the second class incorporate frameworks, for example, Rya [19] which utilizes Apache Accumulo [6], CumulusRDF [22] in light of Apache Cassandra [7], Stratustore [24] which depends on Amazon's SimpleDB [11], and RDF [30], based over HBase [9]. These frameworks advantage from the effi-cient and fine-grained capacity and recovery of the key-esteem stores, however endure in more unpredictable functionalities, for example, joins.…”

Section: State-of-the-art Cloud-based Rdf Systemsmentioning

confidence: 99%

“…The acknowledgment of the semantic Web vision requires productive RDF information administration frameworks. A few RDF unified triple shops [12,15,7] have been proposed and the consequent research has concentrated on the making of proficient ordering structures for inquiry preparing [8,33,24]. These methodologies emerge an alternate number of record blends that permit altogether decreased reaction times.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An Efficient and Scalable Management of Distributed RDF Data in Cloud Storage

2018

IJMTER

View full text Add to dashboard Cite

Abstract-Circulated figuring is the use of handling resources (gear and programming) that are passed on as an organization over a framework (ordinarily the Internet). The disseminated processing uses frameworks of tremendous social occasions of servers normally running insignificant exertion purchaser PC development with specific relationship with spread dataprocessing errands across finished them. Buyer orchestrated applications, for instance, cash related portfolios to pass on altered information, to give data storage.Speculate that far reaching scaledata examination assignments, decision sincerely strong systems, and application specific data shops will presumably misuse circulated registering stages than operation. A scattered system is a model in which parts arranged on masterminded PCs pass on and sort out their exercises by passing messages. Beneficial RDF data organization is one of the establishments in understanding the Semantic Web vision. Some time recently, different RDF storing pushed frameworks like gathering or vertical allocating the predicates.RDF truly encodes rich and complex graphs mixing both event and mapping level data. Sharding such data using built up techniques or distributing graph using ordinary min-cut counts prompts to a great degree inefficient flowed operations and to a high number of joins. In this paper, we depict DiploCloud, a powerful and flexible passed on RDF data organization structure for the cloud. Despite past philosophies, DiploCloud runs a physiological examination of both event and diagram information before allotting the data. In this paper, we portray the outline of DiploCloud, its essential data structures, and moreover the new computations we use to divide pass on data. We moreover show an expansive evaluation of DiploCloud exhibiting that our system is frequently two solicitations of enormity speedier than best in class structures on standard workloads.

show abstract

Section: Related Work Semistructured Data and Rdfmentioning

confidence: 99%

Section: State-of-the-art Cloud-based Rdf Systemsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Efficient and Scalable Management of Distributed RDF Data in Cloud Storage

2018

IJMTER

View full text Add to dashboard Cite

show abstract

“…For the latter task, strong tools (e.g. [13,22]) are available. For the actual rewriting, we shall follow the rewriting from [9] (see also [28] for a similar approach) which incorporates several improvements compared with the original algorithm from [7] used in the previous section.…”

Section: Holistic Query Rewritingmentioning

confidence: 99%

Towards Reconciling SPARQL and Certain Answers

Ahmetaj

Fischl

Pichler

et al. 2015

Proceedings of the 24th International Conference on World Wide Web

View full text Add to dashboard Cite

SPARQL entailment regimes are strongly influenced by the big body of works on ontology-based query answering, notably in the area of Description Logics (DLs). However, the semantics of query answering under SPARQL entailment regimes is defined in a more naive and much less expressive way than the certain answer semantics usually adopted in DLs. The goal of this work is to introduce an intuitive certain answer semantics also for SPARQL and to show the feasibility of this approach. For OWL 2 QL entailment, we present algorithms for the evaluation of an interesting fragment of SPARQL (the so-called well-designed SPARQL). Moreover, we show that the complexity of the most fundamental query analysis tasks (such as query containment and equivalence testing) is not negatively affected by the presence of OWL 2 QL entailment under the proposed semantics.

show abstract

“…BGP query answering techniques have been studied intensively, e.g., [18,29], and some are deployed in commercial systems such as Oracle 11g, which provides a "Semantic Graph" extension etc. Our work defines a novel framework for RDF analytics, based on analytical schemas and queries; these can be efficiently deployed on top of any RDF data management platform, to extend it with analytic capabilities.…”

Section: Related Workmentioning

confidence: 99%

RDF analytics

Colazzo

Goasdoué

Manolescu

et al. 2014

Proceedings of the 23rd International Conference on World Wide Web

Self Cite

View full text Add to dashboard Cite

The development of Semantic Web (RDF) brings new requirements for data analytics tools and methods, going beyond querying to semantics-rich analytics through warehouse-style tools. In this work, we fully redesign, from the bottom up, core data analytics concepts and tools in the context of RDF data, leading to the first complete formal framework for warehouse-style RDF analytics. Notably, we define i) analytical schemas tailored to heterogeneous, semantics-rich RDF graph, ii) analytical queries which (beyond relational cubes) allow flexible querying of the data and the schema as well as powerful aggregation and iii) OLAP-style operations. Experiments on a fully-implemented platform demonstrate the practical interest of our approach.

show abstract

Efficient query answering against dynamic RDF databases

Cited by 35 publications

References 17 publications

An Efficient and Scalable Management of Distributed RDF Data in Cloud Storage

An Efficient and Scalable Management of Distributed RDF Data in Cloud Storage

Towards Reconciling SPARQL and Certain Answers

RDF analytics

Contact Info

Product

Resources

About