Journal ArticleDOI
Storing a Sparse Table with 0(1) Worst Case Access Time
Reads0
Chats0
TLDR
A data structure for representing a set of n items from a universe of m items, which uses space n+o(n) and accommodates membership queries in constant time and is easy to implement.Abstract:
A data structure for representing a set of n items from a umverse of m items, which uses space n + o(n) and accommodates membership queries m constant time is described. Both the data structure and the query algorithm are easy to ~mplement.read more
Citations
More filters
Journal ArticleDOI
Secure two-party input-size reduction: Challenges, solutions and applications
TL;DR: The problem is formalized, efficient and secure (semi-honest model) solutions to it are proposed, and its use cases are discussed.
Patent
Methods, systems, and devices supporting data access in a data processing system
TL;DR: In this article, a peer-to-peer network is defined, where a first computer receives a request for a data item from a requesting computer, and the request includes a True Name of the data item.
Proceedings ArticleDOI
Framework for searchable encryption with SQL databases
TL;DR: This paper provides a complete framework that supports private search queries over encrypted SQL databases, in particular for PostgreSQL and MySQL databases, and extends the solution for searchable encryption designed by Curtmola et al., to the case of SQL databases.
Dissertation
Architecture et Services des Intergiciels Temps Réel
TL;DR: This thesis defines a middleware architecture supporting adaptability of its functions to meet user's requirements, and formal verification of the middleware configuration to deploy, and proposes a guide to support other classes of middleware.
Dissertation
An Expert System for Automatic Software Protection
TL;DR: An expert system for automating the protection of applications is presented, believed to be the first application of the expert system paradigm to this challenging problem, based on the formalization of the mental decision processes and background knowledge of software security experts involved in the ASPIRE project.
References
More filters
Journal ArticleDOI
Should Tables Be Sorted
TL;DR: It is shown that, in a rather general model including al1 the commonly-used schemes, $\lceil $ lg(n+l) $\rceil$ probes to the table are needed in the worst case, provided the key space is sufficiently large.
Journal ArticleDOI
Storing a sparse table
TL;DR: This work proposes a good worst-case method for storing a static table of n entries, each an integer between 0 and N - 1, and analysis shows why a simpler algorithm used for compressing LR parsing tables works so well.
Journal ArticleDOI
Perfect hashing functions: a single probe retrieving method for static sets
TL;DR: A refinement of hashing which allows retrieval of an item in a static table with a single probe is considered, and a rough comparison with ordinary hashing is given which shows that this method can be used conveniently in several practical applications.
Journal ArticleDOI
Reciprocal hashing: a method for generating minimal perfect hashing functions
TL;DR: A method is presented for building minimal perfect hash functions, i.e., functions which allow single probe retrieval from minimally sized tables of identifier sets, and a proof of existence for minimalperfect hash functions of a special type (reciprocal type) is given.