Private and Efficient Query Processing on Outsourced Genomic Databases
نویسندگان
چکیده
منابع مشابه
Efficient Delegated Private Set Intersection on Outsourced Private Datasets
Private set intersection (PSI) is an essential cryptographic protocol that has many real world applications. As cloud computing power and popularity have been swiftly growing, it is now desirable to leverage the cloud to store private datasets and delegate PSI computation to it. Although a set of efficient PSI protocols have been designed, none support outsourcing of the datasets and the comput...
متن کاملEfficient Query Processing in Distributed RDF Databases
The Semantic Web takes the concept of data integration in a mediator architecture to a new level. Since the distribution of data is not managed centrally, query processing over a set of autonomous data stores poses new challenges for query optimization. Because URIs provide a global resource identification mechanism and RDF data stores have no schema, all data stores can potentially have inform...
متن کاملQuery Execution Assurance for Outsourced Databases
In this paper we propose and analyze a method for proofs of actual query execution in an outsourced database framework, in which a client outsources its data management needs to a specialized provider. The solution is not limited to simple selection predicate queries but handles arbitrary query types. While this work focuses mainly on read-only, computeintensive (e.g. data-mining) queries, it a...
متن کاملEfficient Query Processing Techniques in Uncertain Databases
Query processing on uncertain data has become increasingly important in many real-world applications. In this paper, we present our works on formulating and tackling three important queries in uncertain databases, that is, probabilistic group nearest neighbor (PGNN), probabilistic reverse skyline (PRSQ), and probabilistic reverse nearest neighbor (PRNN) queries.
متن کاملEfficient algorithms for supergraph query processing on graph databases
We study the problem of processing supergraph queries on graph databases. A graph database D is a large set of graphs. A supergraph query q on D is to retrieve all the graphs in D such that q is a supergraph of them. The large number of graphs in databases and the NP-completeness of subgraph isomorphism testing make it challenging to efficiently processing supergraph queries. In this paper, a n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of Biomedical and Health Informatics
سال: 2017
ISSN: 2168-2194,2168-2208
DOI: 10.1109/jbhi.2016.2625299