scholarly journals Context-Aware Query Processing in Ad-Hoc Environments of Peers

Author(s):  
Nikolaos Folinas ◽  
Panos Vassiliadis ◽  
Evaggelia Pitoura ◽  
Evangelos Papapetrou ◽  
Apostolos Zarras

In this article, we deal with context-aware query processing in ad-hoc peer-to-peer networks. Each peer in such an environment has a database over which users execute queries. This database involves (a) relations which are locally stored and (b) virtual relations, all the tuples of which are collected from peers that are present in the network at the time when a query is posed. The objective of our work is to perform query processing in such an environment and, to this end, we start with a formal definition of the system model. Next, we formally define SQLP, an extension of SQL that covers the termination of queries, the failure of individual peers and the semantic characteristics of the peers of such a network. Moreover, we present a query execution algorithm as well as the formal definition of all the operators that take place in a query execution plan.

2009 ◽  
pp. 1844-1866
Author(s):  
Nikolaos Folinas ◽  
Panos Vassiliadis ◽  
Evaggelia Pitoura ◽  
Evangelos Papapetrou ◽  
Apostolos Zarras

In this article, we deal with context-aware query processing in ad-hoc peer-to-peer networks. Each peer in such an environment has a database over which users execute queries. This database involves (a) relations which are locally stored and (b) virtual relations, all the tuples of which are collected from peers that are present in the network at the time when a query is posed. The objective of our work is to perform query processing in such an environment and, to this end, we start with a formal definition of the system model. Next, we formally define SQLP, an extension of SQL that covers the termination of queries, the failure of individual peers and the semantic characteristics of the peers of such a network. Moreover, we present a query execution algorithm as well as the formal definition of all the operators that take place in a query execution plan.


2007 ◽  
Vol 19 (7) ◽  
pp. 919-933 ◽  
Author(s):  
Benjamin Arai ◽  
Gautam Das ◽  
Dimitrios Gunopulos ◽  
Vana Kalogeraki

2003 ◽  
Vol 85 (3) ◽  
pp. 105-121 ◽  
Author(s):  
Rene Mayrhofer ◽  
Florian Ortner ◽  
Alois Ferscha ◽  
Manfred Hechinger

2019 ◽  
Vol 2019 (2) ◽  
pp. 105-125 ◽  
Author(s):  
Christiane Kuhn ◽  
Martin Beck ◽  
Stefan Schiffner ◽  
Eduard Jorswieck ◽  
Thorsten Strufe

Abstract Many anonymous communication networks (ACNs) with different privacy goals have been developed. Still, there are no accepted formal definitions of privacy goals, and ACNs often define their goals ad hoc. However, the formal definition of privacy goals benefits the understanding and comparison of different flavors of privacy and, as a result, the improvement of ACNs. In this paper, we work towards defining and comparing privacy goals by formalizing them as privacy notions and identifying their building blocks. For any pair of notions we prove whether one is strictly stronger, and, if so, which. Hence, we are able to present a complete hierarchy. Using this rigorous comparison between notions, we revise inconsistencies between the existing works and improve the understanding of privacy goals.


2012 ◽  
Vol 17 (5) ◽  
pp. 973-985 ◽  
Author(s):  
Thao P. Nghiem ◽  
Agustinus Borgy Waluyo ◽  
David Taniar

Sign in / Sign up

Export Citation Format

Share Document