Abstract | ||
---|---|---|
To ensure the privacy of data in the relational databases, prior work has given techniques to support data encryption and execute SQL queries over the encrypted data. However, the problem of how to put these techniques together in an optimum manner was not addressed, which is equivalent to having an RDBMS without a query optimizer. This paper models and solves that optimization problem. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1007/11408079_7 | DASFAA |
Keywords | Field | DocType |
data encryption,paper model,query optimization,relational databases,optimum manner,optimization problem,prior work,sql query,encrypted database system,query optimizer,encrypted data,database system,relational database | SQL,Query optimization,Data mining,Relational database,Information retrieval,Computer science,Sargable,View,Encryption,Query by Example,Relational database management system,Database | Conference |
Volume | ISSN | ISBN |
3453 | 0302-9743 | 3-540-25334-3 |
Citations | PageRank | References |
18 | 0.95 | 20 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Hakan Hacıgümüş | 1 | 87 | 11.63 |
Bala Iyer | 2 | 1024 | 72.28 |
Sharad Mehrotra | 3 | 7097 | 1001.95 |