Filters








3,001 Hits in 2.9 sec

Efficient Oblivious Database Joins [article]

Simeon Krastnikov, Florian Kerschbaum, Douglas Stebila
2020 arXiv   pre-print
Our approach, which is based on sorting networks and novel provably-oblivious constructions, is conceptually simple, easily verifiable, and very efficient in practice.  ...  We present an oblivious algorithm for equi-joins which (up to a logarithmic factor) matches the optimal O(nlog n) complexity of the standard non-secure sort-merge join (on inputs producing O(n) outputs  ...  Consider, for example, the standard O(n log n) sort-merge algorithm for database joins.  ... 
arXiv:2003.09481v1 fatcat:gc5ctx34tzgqdc4v6piatg5bn4

From Oblivious AES to Efficient and Secure Database Join in the Multiparty Setting [chapter]

Sven Laur, Riivo Talviste, Jan Willemson
2013 Lecture Notes in Computer Science  
Our main theoretical contribution is an efficient multi-party protocol for database join, which combines oblivious shuffle with pseudorandom function evaluation on secret-shared data.  ...  The most notable operation still missing is database join based on secret-shared key columns.  ...  As the second important contribution, we described and benchmarked efficient protocols for joining secret-shared databases.  ... 
doi:10.1007/978-3-642-38980-1_6 fatcat:sih2pvrdybarzgv3kbs2guyxg4

Oblivious Query Processing [article]

Arvind Arasu, Raghav Kaushik
2013 arXiv   pre-print
Our study of oblivious query processing also reveals interesting connections to database join theory.  ...  We present oblivious query processing algorithms for a rich class of database queries involving selections, joins, grouping and aggregation.  ...  It follows that there does not exist an instance efficient oblivious algorithm for cyclic joins.  ... 
arXiv:1312.4012v1 fatcat:zaethry4wfgnfelknzhhzl35fq

ObliDB: Oblivious Query Processing for Secure Databases [article]

Saba Eskandarian, Matei Zaharia
2019 arXiv   pre-print
In this paper, we introduce ObliDB, an oblivious database engine design that is the first system to provide obliviousness for general database read workloads over multiple access methods.  ...  While these works efficiently solve specific subproblems (e.g. building secure indexes or running analytics queries that always scan entire tables), no prior work has supported oblivious query processing  ...  Introduction Many organizations outsource their databases to the public cloud to take advantage of its cost efficiency, high availability, and convenience.  ... 
arXiv:1710.00458v6 fatcat:da3l3u2safakzmx3oscjhiru5a

Query processing in multilevel secure distributed databases

Pooja Sapra, Suresh Kumar, Rk Rathy
2014 2014 IEEE International Advance Computing Conference (IACC)  
In this paper, we introduce ObliDB, an oblivious database engine design that is the first system to provide obliviousness for general database read workloads over multiple access methods.  ...  While these works efficiently solve specific subproblems (e.g. building secure indexes or running analytics queries that always scan entire tables), no prior work has supported oblivious query processing  ...  INTRODUCTION Many organizations outsource their databases to the public cloud to take advantage of its cost efficiency, high availability, and convenience.  ... 
doi:10.1109/iadcc.2014.6779373 fatcat:w3hlim3rezgr7k4cfgqfibbmei

Adaptive Reprogramming for Databases on Heterogeneous Processors

David Broneske
2015 Proceedings of the 2015 ACM SIGMOD on PhD Symposium - SIGMOD '15 PhD Symposium  
because of an abstract operator description (the hardware-oblivious way).  ...  ., in database systems) either cause enormous programming effort for tuning one algorithm to several processors (the hardware-sensitive way), or do not fully exploit possible performance possibilities  ...  [15] show how to tailor the hash join to work efficiently on an APU (a CPU with an integrated GPU) and Jha et al. [17] investigate hash joins on an Intel Xeon Phi. Moreover, Mueller et al.  ... 
doi:10.1145/2744680.2744685 dblp:conf/sigmod/Broneske15 fatcat:ph4d2xwztffthe6nzr72nnbluy

Cache-oblivious databases

Bingsheng He, Qiong Luo
2008 ACM Transactions on Database Systems  
These properties are highly attractive to autonomous databases, especially because the hardware architectures are becoming increasingly complex and diverse.  ...  cache-oblivious approach as well as the opportunities given by the upcoming hardware architectures.  ...  For example, both models predict that the hash join is the most cache efficient and the non-indexed nestedloop join is the least cache efficient among the four join algorithms.  ... 
doi:10.1145/1366102.1366105 fatcat:dig7mn7i7zhl3m74f2yz3xadva

Hardware-oblivious parallelism for in-memory column-stores

Max Heimel, Michael Saecker, Holger Pirk, Stefan Manegold, Volker Markl
2013 Proceedings of the VLDB Endowment  
We propose an alternative design for a parallel database engine, based on a single set of hardware-oblivious operators, which are compiled down to the actual hardware at runtime.  ...  Writing such applications in a generic, hardware-oblivious manner is a challenging problem: Current database systems thus rely on laborintensive and error-prone manual tuning to exploit the full potential  ...  OCELOT: A HARDWARE-OBLIVIOUS DATABASE ENGINE In this section, we present an overview of Ocelot, our prototypical hardware-oblivious parallel database engine.  ... 
doi:10.14778/2536360.2536370 fatcat:lhhr6q57c5csrg37s5563wq2ku

Privacy Preserving Joins

Yaping Li, Minghua Chen
2008 2008 IEEE 24th International Conference on Data Engineering  
Based on this new definition, we propose three provable correct and secure algorithms to compute general joins of arbitrary predicates.  ...  In this paper, we design a system to perform privacy preserving joins of data from mutually distrustful organizations, leveraging the power of a secure coprocessor.  ...  The communication cost of Algorithm A2 mainly depends on the write efficiency M L , while that of Algorithm A3 mainly depends on the cost associated with oblivious filtering.  ... 
doi:10.1109/icde.2008.4497553 dblp:conf/icde/LiC08 fatcat:fmkylcgikneqbje6dz7jvq25fi

A Tale of Two Approaches: Query Performance Study of XML Storage Strategies in Relational Databases [chapter]

Sandeep Prakash, Sourav S. Bhowmick
2006 Lecture Notes in Computer Science  
Our analysis shows an interesting fact that schemaconscious approaches are not always a better option than schema-oblivious approaches!  ...  Several recent papers have investigated a relational approach to store XML data and there is a growing evidence that schema-conscious approaches are a better option than schema-oblivious techniques as  ...  First, we consider a relatively more efficient schema-oblivious storage strategy (Sucxent++) compared to the approaches used in [16, 11] for our study.  ... 
doi:10.1007/11827405_15 fatcat:3qwt2dvqkbe2zeepivk7gscwf4

Secrecy: Secure collaborative analytics on secret-shared data [article]

John Liagouris, Vasiliki Kalavri, Muhammad Faisal, Mayank Varia
2021 arXiv   pre-print
We provide an efficient implementation of our framework, called Secrecy, and evaluate it using real queries from several MPC application areas.  ...  We define a set of oblivious operators, explain the secure primitives they rely on, and provide an analysis of their costs in terms of operations and inter-party communication.  ...  the cost of oblivious join and group-by operators.  ... 
arXiv:2102.01048v1 fatcat:27jutmvouzgi3k7nevwoaojpge

Page 2803 of Mathematical Reviews Vol. , Issue 91E [page]

1991 Mathematical Reviews  
This establishes a significant gap between oblivious and nonoblivious search.  ...  Summary: “Relational database transformations, encompassing database queries and updates, are studied.  ... 

KloakDB: A Platform for Analyzing Sensitive Data with K-anonymous Query Processing [article]

Madhav Suresh, Zuohao She, William Wallace, Adel Lahlou, Jennie Rogers
2020 arXiv   pre-print
KloakDB offers a semi-oblivious computing framework, k-anonymous query processing.  ...  Our results show that KloakDB enjoys speedups of up to 117X using k-anonymous query processing over full-oblivious evaluation.  ...  The latter requires specialized hardware, but is more efficient.  ... 
arXiv:1904.00411v2 fatcat:akwbhi7o6vb5zi3sq6rjxvch7q

Page 7059 of Mathematical Reviews Vol. , Issue 2003i [page]

2003 Mathematical Reviews  
One of the important qualities of relational database systems is that they can be implemented so that queries can be answered efficiently.  ...  In particular, we characterize keys of a database relation in terms of dense sets.”  ... 

Efficient recursive XML query processing using relational database systems

Sandeep Prakash, Sourav S. Bhowmick, Sanjay Madria
2006 Data & Knowledge Engineering  
Recursive queries are quite important in the context of XML databases.  ...  To that end, we propose a novel schema-oblivious approach, called Sucxent++ (Schema Unconcious XML Enabled System), that outperforms existing schema-oblivious approaches such as XParent by up to 15 times  ...  Overview In this paper, we present an efficient approach to process recursive XML queries using a schema-oblivious approach 1 .  ... 
doi:10.1016/j.datak.2005.07.001 fatcat:dy7pdqxgvnepngtmcl7qnjf2dy
« Previous Showing results 1 — 15 out of 3,001 results