A secure and scalable IoT consensus protocol

Several consensus algorithms have been proposed as a way of resolving the Byzantine General problem with respect to blockchain consensus process. However, when these consensus algorithms are applied to a distributed, asynchronous network some suffer with security and/or scalability issues, while others suffer with liveness and/or safety issues. This is because the majority of research have not considered the importance of liveness and safety, with respect to the integrity of the consensus decision. In this paper a novel solution to this challenge is presented. A solution that protects blockchain transactions from fraudulent or erroneous mis-spends. This consensus protocol uses a combination of probabilistic randomness, an isomorphic balance authentication, error detection and synchronised time restrictions, when assessing the authenticity and validity of IoT request. Designed to operate in a distributed asynchronous network, this approach increases scalability while maintaining a high transactional throughput, even when faced with Byzantine failure

Open issues in semantic query optimization in relational DBMS

After two decades of research into Semantic Query Optimization (SQO) there is clear agreement as to the efficacy of SQO. However, although there are some experimental implementations there are still no commercial implementations. We first present a thorough analysis of research into SQO. We identify three problems which inhibit the effective use of SQO in Relational Database Management Systems(RDBMS). We then propose solutions to these problems and describe first steps towards the implementation of an effective semantic query optimizer for relational databases