The design and implementation of a log-structured file system
ACM Transactions on Computer Systems (TOCS)
The log-structured merge-tree (LSM-tree)
Acta Informatica
An efficient bitmap encoding scheme for selection queries
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Differential files: their application to the maintenance of large databases
ACM Transactions on Database Systems (TODS)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Efficient execution of joins in a star schema
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
The LHAM log-structured history data access method
The VLDB Journal — The International Journal on Very Large Data Bases
The VLDB Journal — The International Journal on Very Large Data Bases
Sing the truth about ad hoc join costs
The VLDB Journal — The International Journal on Very Large Data Bases
PicoDBMS: Scaling down database techniques for the smartcard
The VLDB Journal — The International Journal on Very Large Data Bases
Logical and physical design issues for smart card databases
ACM Transactions on Information Systems (TOIS)
MyLifeBits: a personal database for everything
Communications of the ACM - Personal information management
TEC-Tree: A Low-Cost, Parallelizable Tree for Efficient Defense Against Memory Replay Attacks
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
A sequential indexing scheme for flash-based embedded systems
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Distributed and Parallel Databases
Lazy-Adaptive Tree: an optimized index structure for flash devices
Proceedings of the VLDB Endowment
Pluggable personal data servers
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Secure personal data servers: a vision paper
Proceedings of the VLDB Endowment
Tree indexing on solid state drives
Proceedings of the VLDB Endowment
SkimpyStash: RAM space skimpy key-value store on flash-based storage
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
SILT: a memory-efficient, high-performance key-value store
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
Hi-index | 0.00 |
Mass-storage secure portable tokens are emerging and provide a real breakthrough in the management of sensitive data. They can embed personal data and/or metadata referencing documents stored encrypted in the Cloud and can manage them under holder's control. Mass on-board storage requires efficient embedded database techniques. These techniques are however very challenging to design due to a combination of conflicting NAND Flash constraints and scarce RAM constraint, disqualifying known state of the art solutions. To tackle this challenge, we proposes a log-only based storage organization and an appropriate indexing scheme, which (1)聽produce only sequential writes compatible with the Flash constraints and (2)聽consume a tiny amount of RAM, independent of the database size. We show the effectiveness of this approach through a comprehensive performance study.