scholarly journals Tool for SPARQL Querying over Compact RDF Representations

2021 ◽  
Vol 7 (1) ◽  
pp. 33
Author(s):  
Delfina Ramos-Vidal ◽  
Guillermo de Bernardo
Keyword(s):  
Data Storage ◽  
Data Structures ◽  
Low Level ◽  
Level Data ◽  
Query Engine ◽  
Compact Data Structures ◽  
High Level

We present an architecture for the efficient storing and querying of large RDF datasets. Our approach seeks to store RDF datasets in very little space while offering complete SPARQL functionality. To achieve this, our proposal was built over HDT, an RDF serialization framework, and its interaction with the Jena query engine. We propose a set of modifications to this framework in order to incorporate a range of space-efficient compact data structures for data storage and access, while using high-level capabilities to answer more complicated SPARQL queries. As a result, our approach provides a standard mechanism for using low-level data structures in complicated query situations requiring SPARQL searches, which are typically not supported by current solutions.

Agent-Based Negotiation in E-Marketing

2005 ◽  
pp. 88-92
Author(s):  
V. K. Murthy ◽  
E. V. Krishnamurthy
Keyword(s):  
Data Structures ◽  
Agent Based ◽  
Object Based ◽  
Level Data ◽  
Rule System ◽  
High Level ◽  
Two Stages ◽  
Active Objects

This article describes in brief the design of agent-based negotiation system in e-marketing. Such a negotiation scheme requires the construction of a suitable set of rules, called protocol, among the participating agents. The construction of the protocol is carried out in two stages: first expressing a program into an object-based rule system and then converting the rule applications into a set of agent-based transactions on a database of active objects represented using high-level data structures.

A Threat Assessment Method Based on Hierarchies and Modules

2014 ◽  
Vol 18 (1) ◽  
pp. 93-99
Author(s):  
Fang Deng ◽  
◽  
Xinan Liu ◽  
Zhihong Peng ◽  
Jie Chen
Keyword(s):  
Data Fusion ◽  
Threat Assessment ◽  
Assessment Method ◽  
Fusion Technology ◽  
Low Level ◽  
Information Classification ◽  
Level Data ◽  
High Level

With the development of low-level data fusion technology, threat assessment, which is a part of high-level data fusion, is recognized by an increasing numbers of people. However, the method to solve the problem of threat assessment for various kinds of targets and attacks is unknown. Hence, a threat assessment method is proposed in this paper to solve this problem. This method includes tertiary assessments: information classification, reorganization, and summary. In the tertiary assessments model, various threats with multi-class targets and attacks can be comprehensively assessed. A case study with specific algorithms and scenarios is shown to prove the validity and rationality of this method.

Agent-Based Negotiation in E-Marketing

2011 ◽  
pp. 88-92
Author(s):  
V.K. Murthy ◽  
E.V. Krishnamurthy
Keyword(s):  
Data Structures ◽  
Agent Based ◽  
Object Based ◽  
Level Data ◽  
Rule System ◽  
High Level ◽  
Two Stages ◽  
Active Objects

This article describes in brief the design of agent-based negotiation system in e-marketing. Such a negotiation scheme requires the construction of a suitable set of rules, called protocol, among the participating agents. The construction of the protocol is carried out in two stages: first expressing a program into an object-based rule system and then converting the rule applications into a set of agent-based transactions on a database of active objects represented using high-level data structures.

A SQL to C compiler in 500 lines of code

2019 ◽  
Vol 29 ◽  
Author(s):  
TIARK ROMPF ◽  
NADA AMIN
Keyword(s):  
Data Structures ◽  
Partial Evaluation ◽  
Database Systems ◽  
Relational Algebra ◽  
Input Program ◽  
Query Engine ◽  
Programming Patterns ◽  
High Level ◽  
Sql Query ◽  
Mixed Stage

AbstractWe present the design and implementation of a SQL query processor that outperforms existing database systems and is written in just about 500 lines of Scala code – a convincing case study that high-level functional programming can handily beat C for systems-level programming where the last drop of performance matters. The key enabler is a shift in perspective toward generative programming. The core of the query engine is an interpreter for relational-algebra operations, written in Scala. Using the open-source lightweight modular staging framework, we turn this interpreter into a query compiler with very low effort. To do so, we capitalize on an old and widely known result from partial evaluation: the first Futamura projection, which states that a process that can specialize an interpreter to any given input program is equivalent to a compiler. In this context, we discuss lightweight modular staging programming patterns such as mixed-stage data structures (e.g., data records with static schema and dynamic field components) and techniques to generate low-level C code, including specialized data structures and data loading primitives.

High Level Data Structures for GPGPU Programming in a Statically Typed Language

2016 ◽  
Vol 45 (2) ◽  
pp. 242-261 ◽  
Author(s):  
Mathias Bourgoin ◽  
Emmanuel Chailloux ◽  
Jean-Luc Lamotte
Keyword(s):  
Data Structures ◽  
Level Data ◽  
High Level

scholarly journals Secure distributed ledgers to support IoT technologies data

2019 ◽  
Author(s):  
Adrian Concepcion Leon ◽  
Markus Endler
Keyword(s):  
Data Storage ◽  
Data Structures ◽  
Large Scale ◽  
Peer To Peer ◽  
Computer Applications ◽  
Consensus Algorithms ◽  
Complex Events ◽  
Public Record ◽  
Iot Devices ◽  
High Level

Blockchain and Tangle are data structures used to create an immutable public record of data insured by a network of peer-to-peer participants who maintain a set of constantly growing data records known as ledgers. Blockchain and Tangle technologies are a decentralized solution that guarantees the exchange of large amounts of trusted messages, among billions of connected IoT devices, which are very valuable as they are valid and complete. This highly encrypted and secure peer-to-peer messaging mechanism is adopted in this project to manage the processing of IoT transactions and the coordination between the devices that interact with the process. To maintain private transactions, secure and trustless, the distributed consensus algorithms are responsible for validating and choosing transactions and recording them in the global ledger. The results showed that the speed of the consensus algorithms can affect the creation in real time of reliable stories that track the events of the IoT networks. After incorporating Complex Event Processing that allows selecting only those high level events, it is possible to get an improvement in many situations. The result is a Middleware system that provides a framework for the construction of large-scale computer applications that use Complex Events Processing and different decentralized ledgers such as the blockchain of Ethereum or IOTA Tangle, for secure data storage.

High-level data structures

2012 ◽  
Vol 55 (12) ◽  
pp. 90-90 ◽  
Author(s):  
Yannis Smaragdakis
Keyword(s):  
Data Structures ◽  
Level Data ◽  
High Level
Sign in / Sign up

Export Citation Format

Share Document