WO2014092105A1 - データベース検索装置、データベース検索方法及びプログラム - Google Patents
データベース検索装置、データベース検索方法及びプログラム Download PDFInfo
- Publication number
- WO2014092105A1 WO2014092105A1 PCT/JP2013/083164 JP2013083164W WO2014092105A1 WO 2014092105 A1 WO2014092105 A1 WO 2014092105A1 JP 2013083164 W JP2013083164 W JP 2013083164W WO 2014092105 A1 WO2014092105 A1 WO 2014092105A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- search
- database
- logical
- command
- logical expression
- Prior art date
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24564—Applying rules; Deductive queries
- G06F16/24566—Recursive queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/242—Query formulation
- G06F16/2425—Iterative querying; Query formulation based on the results of a preceding query
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2452—Query translation
- G06F16/24528—Standardisation; Simplification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2453—Query optimisation
- G06F16/24534—Query rewriting; Transformation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2457—Query processing with adaptation to user needs
- G06F16/24575—Query processing with adaptation to user needs using context
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/25—Integrating or interfacing systems involving database management systems
- G06F16/252—Integrating or interfacing systems involving database management systems between a Database Management System and a front-end application
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
- G06F21/6227—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database where protection concerns the structure of data, e.g. records, types, queries
Definitions
- the present invention is based on a Japanese patent application: Japanese Patent Application No. 2012-271545 (filed on December 12, 2012), and the entire contents of this application are incorporated in the present specification by reference.
- the present invention relates to a database search device, a database search method, and a program.
- the present invention relates to a database search apparatus, a database search method, and a program for searching an external database.
- data used by users is stored in an external database.
- a user who uses the database lending service has a mechanism for searching the data stored in the external database in order to retrieve the data stored in the external database as necessary.
- the external database executes the search command and sends the search result to the user.
- Non-Patent Documents 1 and 2 disclose technologies related to an encrypted database in which data is encrypted.
- an encrypted database there are cases where there are limitations on the types of search commands that can be transmitted by the user for various reasons (for example, security reasons).
- searchable encryption is a technique that enables data search without decrypting ciphertext (encrypted data).
- the encrypted database enables retrieval of stored data while ensuring the confidentiality of the data.
- Non-Patent Document 3 discloses a searchable cipher called “match search cipher”. In the match search cipher, it is possible to determine whether or not the data stored in the database is equal to a predetermined value without decrypting the ciphertext. Further, Non-Patent Document 4 discloses a searchable cipher called “order-preserving cipher”. In the order storage cipher, it is possible to determine whether or not the data stored in the database is equal to or more than a predetermined value without decrypting the ciphertext.
- a secure encryption database realized by searchable encryption the user searches for data using searchable encryption.
- searchable encryption there are limitations on the types of search commands that can be used by the user. For example, when only the coincidence search cipher is used and an encrypted database is realized, only an instruction for searching for “whether or not the data is equal to a predetermined value” can be executed. Similarly, when only an order storage cipher is used and an encrypted database is realized, only an instruction for searching for “whether or not the data is equal to or greater than a predetermined value” can be executed.
- the input search command is separated into a first search command that can be executed in a predetermined database and a second search command that cannot be executed in the predetermined database.
- a search command separating unit and a search result obtained by executing the second search command with respect to a search result acquired by executing the first search command in the predetermined database, the input There is provided a database search device including a search command execution unit that obtains a search result for a search command that has been executed.
- the input search command is separated into a first search command that can be executed in a predetermined database and a second search command that cannot be executed in the predetermined database.
- a search command separation step and a search result obtained by executing the second search command with respect to a search result obtained by executing the first search command in the predetermined database is input as the search result.
- a search command execution step as a search result for the search command. Note that this method is linked to a specific machine called a database.
- the input search command is separated into a first search command that can be executed in a predetermined database and a second search command that cannot be executed in the predetermined database.
- the search result obtained by executing the second search command is input to the search command separating process and the search result acquired by executing the first search command in the predetermined database.
- This program can be recorded on a computer-readable storage medium.
- the storage medium may be non-transient such as a semiconductor memory, a hard disk, a magnetic recording medium, an optical recording medium, or the like.
- the present invention can also be embodied as a computer program product.
- a database search when searching an external database, a database search that contributes to efficient execution of an arbitrary search command even if the search commands that can be used are limited.
- An apparatus, a database search method, and a program are provided.
- the database search device 100 shown in FIG. 1 is provided as an example.
- the database search device 100 separates an input search command into a first search command that can be executed in a predetermined database and a second search command that cannot be executed in the predetermined database;
- the search result obtained by executing the second search command for the search result obtained by executing the first search command in the predetermined database is used as the search result for the input search command.
- a search command execution unit 102 A search command execution unit 102.
- the database search device 100 appropriately separates a search command input by a user or the like into “commands that can be executed in an external database” and “commands that cannot be executed in an external database”. Furthermore, a search result for a search command input by a user or the like is generated by executing a command executable in the database search device 100 for a search result of a command executable in an external database. As a result, an arbitrary search command can be executed efficiently.
- FIG. 2 is a diagram showing an example of the configuration of the database search system according to the present embodiment.
- the database search system includes a database search device 1 and an external database 2.
- the database search device 1 and the external database 2 are connected by a network such as the Internet, and a search command is output from the database search device 1, and the external database 2 responds with the search result.
- the external database 2 includes a communication unit 21, a storage unit 22, and a control unit 23.
- the communication unit 21 realizes communication with the database search device 1 and delivers the input search command to the control unit 23.
- the control unit 23 searches the storage unit 22 according to the search command.
- Some data is stored in the storage unit 22 of the external database 2. It does not matter whether the data stored in the storage unit 22 is encrypted. Further, the main body storing the data held by the external database 2 and the method for storing the data are not limited.
- the control unit 23 returns the search result to the database search device 1 via the communication unit 21.
- FIG. 3 is a diagram showing an example of the internal configuration of the database search device 1.
- the database search device 1 includes a communication unit 11, a storage unit 12, and a control unit 13. Further, the control unit 13 includes a search command separation unit 131 and a search command execution unit 132.
- the database search device 1 accepts a search command via the communication unit 11. It is assumed that the user who uses the external database 2 or another communication device included in the network inputs the search command. Alternatively, an application or the like installed in the database search device 1 may output a search command.
- the communication unit 11 outputs the accepted search command to the control unit 13.
- the control unit 13 separates the input search command into two search commands of “externally executable search command” and “externally inexecutable search command”. Details of these two search instructions will be described later.
- the control unit 13 outputs an externally executable search command to the external database 2 via the communication unit 11. On the other hand, the externally inexecutable search command is not output to the external database 2.
- the external database 2 that has received the external executable search command executes the external executable search command for the data stored in the storage unit 12 and returns the search result to the database search device 1.
- the control unit 13 executes the search command input by the user or the like based on the search result received from the external database 2 and the externally inexecutable search command, and returns the result to the user or the like.
- the search command separating unit 131 is a means for separating the input search command into two commands.
- the search command execution unit 132 is a means for executing the input search command based on the search result obtained from the external database 2 and the external non-executable search command.
- the control unit 13 (the search command separation unit 131 and the search command execution unit 132) is realized by a computer program that causes a computer mounted in the database search device 1 to execute processing that will be described in detail later using the hardware. You can also
- the search command executable in the external database 2 is the above-described external executable search command.
- the search instruction that cannot be executed in the external database 2 is the above-described external execution disable search instruction.
- search instruction separating unit 131 separates the search instruction P into an externally executable instruction that is an instruction that can be executed in the external database 2 and an externally impossible instruction.
- the method for separating the search instruction P will be described as a search instruction separation procedure and will be described below.
- the search instruction separation procedure accepts the search instruction P as an input, and converts the search instruction P into a divisional product standard logical expression.
- the division-and-product standard logical expression is a logical expression composed of an externally executable instruction and an externally impossible instruction. Details of the divisional product standard logical expression will be described later.
- the control unit 13 queries the external database 2 for an external executable instruction via the communication unit 11 and obtains a search result.
- the control unit 13 stores the search result in the storage unit 12.
- the search command execution unit 132 calculates (selects) data satisfying the externally inexecutable command from the search result obtained from the external database 2.
- the control unit 13 responds to the user or the like as the search result for the search command P input by the user or the like, with the result output by the search command executing unit 132 being output.
- the database search device 1 operates as outlined above. That is, the database search apparatus 1 expands executable search commands by appropriately separating search commands input by a user or the like.
- a search command input by a user or the like can be expressed as a logical expression constituted by a combination of negation, logical product or logical sum of atomic logical expressions.
- the negative operation is expressed as “ ⁇ ”
- the logical product operation as “ ⁇ ”
- the logical sum operation as “ ⁇ ”.
- An atomic logical formula that can be executed inside the database search device 1 and that cannot be executed in the external database 2 is defined as an “internal atomic logical formula”.
- the atomic logical formula can be arbitrarily determined. That is, no matter what logical expression is determined as the atomic logical expression, the operation of the database search apparatus 1 is not affected.
- the logical expression K is expressed as a literal.
- the logical expression K is an external atomic logical expression or the negation of the external atomic logical expression
- the logical expression K is expressed as an external literal.
- the logical expression K is an internal atomic logical expression or the negation of the internal atomic logical expression
- the logical expression K is expressed as an internal literal.
- the logical expression K is the logical expression L or the negative of the logical expression L
- the logical expression K is expressed as ⁇ L.
- a logical expression obtained by combining a finite number of different external literals using a logical product ( ⁇ ) is defined as an external conjunction.
- a logical expression obtained by a combination of negation ( ⁇ ), logical product ( ⁇ ), or logical sum ( ⁇ ) of an internal atomic logical formula is defined as an internal logical formula.
- the external database 2 satisfies the following conditions.
- ⁇ M can also be executed in the external database 2.
- M1 ⁇ M2 and M1 ⁇ M2 can also be executed in the external database 2.
- a search command “acquire all data in the external database 2” can be executed in the external database 2.
- the search instruction separation procedure is a process executed by the search instruction separation unit 131. Further, the search instruction separation procedure is recursively defined.
- the search command separation procedure takes a search command P and bit b as inputs.
- the search instruction separation procedure is regarded as a kind of function, and the execution of the search instruction separation procedure is expressed as SCNF (P, b), and the following description will be given.
- the input bit b is introduced to handle the negation of the logical expression in the search instruction separation procedure.
- ⁇ (A ⁇ B) ⁇ A ⁇ B
- SCNF (P, b) SCNF (Q, 1-b).
- the search instruction separation procedure outputs a divided sum-product standard logical expression Po and a set S of external atomic logical expressions.
- the set S of external atomic logic formulas is an auxiliary output used for recursively executing the search instruction separation procedure. More specifically, the set S is a set of external atomic logical formulas included in the divided sum product logical formula Po.
- Po ((external conjunction 1) ⁇ (internal logical formula 1)) ⁇ ... ⁇ ((external conjunction n) ⁇ (internal logical formula n)).
- FIG. 4 is a flowchart showing an example of a search command separation procedure.
- step S01 the search command separation unit 131 receives the search command P and the input bit b.
- the search instruction separation unit 131 starts execution of the search instruction separation procedure (starts the calculation of SCNF (P, b)).
- step S02 the search command separation unit 131 determines whether or not the input search command P is an atomic logical expression.
- step S02 If the search instruction P is an atomic logical expression (step S02, Yes branch), the process of step S03 is executed.
- Step S03 is a process executed when the search instruction P is an atomic logical expression.
- FIG. 5 is a flowchart showing an example of the operation when the search instruction P is an atomic logical expression.
- step S101 the search command separation unit 131 determines whether or not the search command P is an internal atomic logical expression. If the search instruction P is an internal atomic logical expression (step S101, Yes branch), it is further determined whether or not the input bit b is 0 (step S102).
- the search instruction separating unit 131 outputs the following as a divided-sum product standard logical expression Po for the search instruction P (step S103).
- Po (external conjunction)
- the set S is an empty set.
- the search instruction separating unit 131 outputs the following as the division-sum-product standard logical expression Po of the search instruction P (step S104).
- Po (external conjunction)
- the set S is an empty set.
- step S101 If the search instruction P is not an internal atomic logical formula (step S101, No branch), the process of step S105 is executed.
- step S105 the search instruction separation unit 131 confirms that the search instruction P is an external atomic logical expression. If it can be confirmed that the search instruction P is an external atomic logical expression (step S105, Yes branch), it is determined whether or not the input bit b is 0 (step S106).
- the search instruction separating unit 131 outputs the following as the divided-and-product standard logical expression Po of the search instruction P (step S107).
- Po (external conjunction)
- the search instruction separating unit 131 outputs the following as the division-sum-product standard logical expression Po of the search instruction P (step S108).
- Po (external conjunction)
- the union set ⁇ P ⁇ is output.
- the retrieval instruction separation procedure generates the divided-sum-product standard logical expression Po from the retrieval instruction P.
- step S02 If the search instruction P is not an atomic logical expression (step S02, No branch), the process of step S04 is executed.
- step S05 If the search instruction P can be expressed by negation of the logical expression Q (step S04, Yes branch), the process of step S05 is executed.
- step S05 SCNF (P, b) is rewritten to SCNF (Q, 1-b) from the definition of the input bit b described above, and the search instruction separation procedure is executed again. That is, Q is input to SCNF and the search instruction separation procedure is recursively executed.
- step S04 When the search instruction P cannot be expressed by negation of the logical expression Q (step S04, No branch), the process of step S06 is executed.
- step S06 If the search instruction P can be expressed as a logical sum of the logical expressions Q and R (step S06, Yes branch), the process of step S07 is executed.
- step S06, No branch When the search instruction P cannot be expressed as a logical sum of the logical expressions Q and R (step S06, No branch), the process of step S08 is executed.
- step S08, Yes branch If the search instruction P can be expressed as a logical product of the logical expressions Q and R (step S08, Yes branch), the process of step S09 is executed. If the search instruction P cannot be expressed as a logical product of the logical expressions Q and R (step S08, No branch), the processing shown in FIG.
- the processing after step S07 is executed when P Q ⁇ R can be expressed.
- step S201 the search instruction separation unit 131 recursively executes a search instruction separation procedure for each of the logical expressions Q and R. More specifically, by executing SCNF (Q, b), the output (Qo, Sq) is obtained. Further, by executing SCNF (R, b), the output (Ro, Sr) is obtained.
- the logical expressions Qo and Ro are divided-and-product standard logical expressions of the logical expressions Q and R, respectively.
- the sets Sq and Sr are sets of external atomic logical formulas included in the divided-sum standard logical formulas Qo and Ro, respectively. Since the logical expressions Qo and Ro are divided-and-product standard logical expressions of the logical expressions Q and R, respectively, the logical expressions Qo and Ro are equivalent to the logical expressions Q and R, respectively.
- the logical expression (Qo ⁇ Ro) can be said to be a divided-and-product logical expression for the search instruction P.
- the logical expression (Qo ⁇ Ro) is not necessarily the divisional sum standard logical expression for the search instruction P.
- the processing in step S202 is referred to as logical expression transformation processing, and the following description will be given.
- the logical expression transformation process is a process for assuring that the logical expression obtained by the search instruction separation procedure is a divided-sum-product standard logical expression.
- the logical expression Qo is transformed using the external atomic logical formula B that exists in the logical formula Ro but does not exist in the logical formula Qo, and outputs the logical formula Q1. More specifically, in the logical formula Qo, the external atomic logical formula B and its negation B are modified so as to be included in the logical formula Qo. For example, the logical expression Qo is modified to obtain the following logical expression Q1.
- Q1 ((A ⁇ B) ⁇ X) ⁇ ((A ⁇ B) ⁇ X) ⁇ .
- Such a conversion operation is a logical expression transformation process.
- a set of external atomic formulas that exist in the logical formula Ro but do not exist in the logical formula Qo can be obtained. More specifically, the set of external atomic formulas that exist in the logical formula Ro but do not exist in the logical formula Qo matches the difference set (Sr ⁇ Sq) between the set Sr and the set Sq.
- the logical expression transformation process accepts the difference set Sr ⁇ Sq as an input, grasps all external atomic logical expressions that exist in the logical expression Ro but do not exist in the logical expression Qo, and repeat the above operation.
- the logical expression transformation process is performed on the logical expression Ro. More specifically, the logical expression Ro is modified to obtain the following logical expression R1.
- R1 ((A ⁇ B) ⁇ Y) ⁇ (( ⁇ A ⁇ B) ⁇ Y) ⁇ .
- the search instruction P can be expressed as the following expression (1) by the above modification.
- the processing in step S203 is referred to as logical expression integration processing, and the following description will be given.
- the logical expression integration process is a process that makes it possible to efficiently execute the search instruction separation procedure by reducing the number of internal logical expressions existing in the divided-and-product logical expression.
- the logical expression integration process is a process for simplifying the expression by enclosing the external conjunction existing on the right side of the expression (1).
- the external conjunction (A ⁇ B) is described twice. Therefore, by formulating this external conjunction (A ⁇ B), equation (1) is transformed into equation (2) below.
- P ((A ⁇ B) ⁇ (X ⁇ Y)) ⁇ ((A ⁇ B) ⁇ X) ⁇ ... ⁇ (( ⁇ A ⁇ B) ⁇ Y) (2)
- Equation (2) The three external conjunctions (A ⁇ B), (A ⁇ B), and ( ⁇ A ⁇ B) present on the right side of Equation (2) are mutually exclusive, and any two of these have a common part. do not do. Therefore, the right side of the above equation (2) can be said to be a divisional product standard logical equation for the search instruction P.
- step S204 the search instruction separation unit 131 outputs the divided sum product logical expression calculated in the previous step as an output for the search instruction P.
- step S301 the search instruction separation unit 131 recursively executes the search instruction separation procedure for each of the logical expressions Q and R, as in step S201. By executing this step, logical expressions Qo and Ro and sets Sq and Sr are obtained.
- the logical expressions Qo and Ro are divided-and-product standard logical expressions of the logical expressions Q and R, respectively.
- step S302 the search instruction separation unit 131 converts such a logical expression (Qo ⁇ Ro) into a divided sum product logical expression. Note that the processing in this step is referred to as logical expression expansion processing and will be described below.
- the search command P can be expressed by the following equation (3).
- Such processing is logical expression expansion processing. Note that a logical expression of the expression (4) obtained as a result of performing the logical expression expansion process on the logical expression (Qo ⁇ Ro) is expressed as a logical expression P2.
- step S303 the search instruction separating unit 131 performs the above-described logical expression integration process on the logical expression P2 that has been subjected to the logical expression expansion process, thereby obtaining the divided sum product logical expression Po. Since the division-sum-product standard logical expression Po is obtained, the search instruction separation unit 131 ends the process.
- the search instruction separation unit 131 executes the search instruction separation procedure, thereby generating the divided sum standard logical expression Po from the search instruction P input from the user or the like.
- the division-and-product standard logical expression Po is an internal combination of an external conjunction indicated by a logical product ( ⁇ ) of external atomic logical expressions that can be executed in the external database 2 and an internal atomic logical expression that cannot be executed in the external database 2. It is shown as a logical sum of basic logical expressions obtained by combining logical expressions with a logical product ( ⁇ ).
- the control unit 13 outputs the external conjunction contained in each basic logical expression to the external database 2 and obtains a search result from the external database 2.
- the search command execution unit 132 calculates a logical product of the search result obtained from the external database 2 and the internal logical expression, and obtains a search result corresponding to each basic logical expression.
- the search instruction P is executed by executing such processing for each basic logical expression.
- an arbitrary search command can be efficiently executed even if the search commands that can be used are limited, for example, when searching an encrypted database.
- the set S is given as an output when the search instruction separation procedure is executed.
- the set S can also be obtained from the divided sum product standard logical expression Po
- the output of SCNF (P, b) is limited to the divided sum product standard logical expression Po
- the set S is derived from the divided sum product standard logical expression Po. May be obtained.
- the search instruction separation procedure when the search instruction separation procedure is realized by causing a processing device such as a computer to execute a program, it may be easier to implement it in a set expression than a logical expression. That is, the search instruction separation procedure can be implemented by calculating the search instruction P as a logical expression or by calculating it as a set expression.
- K (external conjunction 1) ⁇ (internal logical formula 1)) ⁇ ... ⁇ ((external conjunction n) ⁇ (internal logical formula n).
- SCNFToSET (K) ⁇ (external conjunction 1, internal logical formula 1), ..., (external conjunction n, internal logical formula n) ⁇ .
- the already described logical expression transformation process is regarded as a function and expressed as Conv (V1, V2).
- the logical expression integration process is regarded as a function and expressed as Unif (W).
- the logical expression expansion process is regarded as a function and expressed as Expand (U1, U2).
- Conv (V1, V2) ⁇ (L ⁇ C1 ⁇ ... ⁇ Cn, X)
- the database search apparatus 1 generates the divided sum product logical formula Po from the search command P by the search command separation procedure.
- the divided sum product standard logical expression Po is indicated as a logical sum of basic logical expressions expressed as a logical product of external conjunctions executable in the external database 2 and internal logical expressions executable in the database search apparatus 1.
- the database search device 1 arbitrarily searches the search command P input by a user or the like into “parts that can be executed in the external database 2” and “parts that cannot be executed in the external database 2”. Allows instructions to be executed efficiently.
- Non-patent documents 1 to 4 do not disclose the concept of decomposing a search command.
- the database search apparatus 1 prevents such miss-out by generating the divided sum product logical expression Po from the search instruction P by the search instruction separation procedure.
- the search command P is subdivided into an external atomic formula and an internal atomic formula, and then an external conjunction that can be executed in the external database 2 and an internal logical formula that can be executed only in the database search device 1 This is to reconstruct the logical product.
- the database search apparatus 1 does not acquire the duplicate data as described above because the external conjunctions are mutually exclusive. That is, the external database 2 can be accessed efficiently.
- the database search system uses an encrypted database.
- FIG. 8 is a diagram showing an example of the configuration of the database search system according to the present embodiment.
- the same components as those in FIG. 2 are denoted by the same reference numerals, and the description thereof is omitted.
- the database search system includes a database search device 1a and an encrypted database 2a.
- the encryption database 2a stores the encrypted data by using the searchable encryption for the encryption method.
- Realization of searchable encryption requires four procedures (processes): key generation procedure, encryption procedure, encryption search procedure, and decryption procedure.
- the key generation procedure generates a secret key necessary for encryption.
- the encryption procedure receives a secret key and some data as input and outputs ciphertext using the data.
- searchable cipher is an order-preserving cipher
- a search in the form of “data ⁇ constant”, “data> constant”, “data ⁇ constant”, “data ⁇ constant”, while the data is encrypted can be executed while maintaining a constant confidentiality.
- the decryption procedure receives the private key and ciphertext and outputs the decryption result of the input ciphertext.
- the cipher search unit 24 implements a cipher search procedure for one or more searchable ciphers.
- the case where the matching search cipher and the order storage cipher are implemented will be described. However, other ciphers can be similarly handled.
- FIG. 9 is a diagram showing an example of the internal configuration of the database search apparatus 1a. 9, the same components as those in FIG. 3 are denoted by the same reference numerals, and the description thereof is omitted.
- the difference between the database search device 1 and the database search device 1a is that an encryption management unit 14 is provided. Further, the encryption management unit 14 includes an encryption embedding unit 141 and an encryption / decryption unit 142.
- the encryption embedding unit 141 replaces the external atomic logical expression existing in the input logical expression with a cryptographic search procedure.
- the cipher search procedure corresponding to the atomic logical expression “data ⁇ constant” is “data ciphertext ⁇ Enc (K, constant)”. Therefore, the encryption embedding unit 141 replaces the atomic logical expression “data ⁇ constant” with “data ciphertext ⁇ Enc (Sk, constant)”.
- Enc is an encryption procedure for order-preserving encryption
- Sk is a secret key for order-preserving encryption.
- the encryption / decryption unit 142 decrypts the ciphertext using a searchable encryption decryption procedure.
- the encryption management unit 14 randomly selects the coincidence search encryption secret key KCon and the order storage encryption secret key KOPE, and stores these keys in the storage unit 12. Further, from each data held by the database search device 1a, a ciphertext encrypted with the match search cipher using the secret key KCon and a ciphertext encrypted with the order storage cipher using the secret key KOPE are generated. These ciphertexts are stored in the encrypted database 2a.
- the communication unit 11 receives a search command from a user or the like and delivers it to the control unit 13.
- the search command separating unit 131 of the control unit 13 separates the input search command into “externally executable search command” and “externally executable search command”.
- the control unit 13 outputs an externally executable search command to the encryption management unit 14.
- the encryption embedding unit 141 of the encryption management unit 14 replaces the external atomic logical expression existing in the external executable search command with a cryptographic search procedure.
- the encryption management unit 14 transmits the externally executable search command whose replacement has been completed to the encrypted database 2a via the communication unit 11.
- the encrypted database 2a executes processing corresponding to the received search command in the cryptographic search unit 24, and transmits the result to the database search device 1a.
- the database search device 1a decrypts the received search result by the encryption / decryption unit 142, executes an externally inexecutable search command for the obtained decryption result, and outputs the execution result.
- an arbitrary search command can be executed in an encrypted database in which the types of search commands that can be transmitted by the user are limited.
- the convenience of the user can be enhanced while ensuring the safety of the database.
- the search instruction separating unit converts the input search instruction into a plurality of basic logical expressions including a first atomic logical expression that can be executed in the database and a second atomic logical expression that cannot be executed in the database.
- the basic logical expression is a combination of an external conjunction indicated by a logical product of each of the plurality of first atomic logical expressions and a negation, logical product, or logical sum of each of the plurality of second atomic logical expressions.
- a database retrieval apparatus indicated by a logical product of the internal logical expression indicated by [Form 4]
- the database search device according to mode 3, wherein the search instruction separating unit converts the input search instruction into a divided-sum-product standard logical expression indicated by a logical sum of each of the plurality of basic logical expressions.
- the search command separation unit separates the input search command into the first and second atomic logical expressions by executing a search command separation procedure for separating the input search command, and
- the external conjunction is generated from a first atomic logical formula
- the internal logical formula is generated from the second atomic logical formula
- the external conjunction and the internal logical formula are converted into the divided sum product logical formula.
- the database search device of form 4 reconfigured to [Form 6] The database search device according to the fifth aspect, wherein the search instruction separation unit recursively executes the search instruction separation procedure to generate the divided sum product logical expression.
- [Form 7] The database search device according to any one of Embodiments 3 to 6, wherein the external conjunctions are mutually exclusive.
- [Form 8] The database search device according to any one of embodiments 1 to 7, wherein the predetermined database stores data encrypted by a searchable encryption.
- the search instruction separation procedure is a procedure executed recursively, When the input search instruction is indicated by a logical sum of the first and second logical expressions, each of the first and second logical expressions is recursively executed as the input search instruction.
- the database search device according to any one of Embodiments 5 to 8, wherein the deformation process is executed.
- the search instruction separation procedure is: A logical expression integration process for concatenating the external conjunctions common to the basic logical expressions included in the logical expressions obtained by the logical sums of the third and fourth logical expressions that have undergone the logical expression transformation processing;
- the search instruction separation procedure is: When the input search instruction is indicated by the logical product of the fifth and sixth logical expressions, each of the fifth and sixth logical expressions is recursively executed as the input search instruction. Thus, the seventh logical expression corresponding to the fifth logical expression and the eighth logical expression corresponding to the sixth logical expression are output, The database search device according to mode 10 for executing a logical expression expansion process for expanding a logical expression indicated by a logical product of the seventh logical expression and the eighth logical expression.
- the search instruction separation procedure is: The database search device according to an eleventh aspect, wherein the logical expression integration process is executed on the logical expression obtained by the logical expression expansion process.
- the search instruction separating step converts the input search instruction into a plurality of basic logical expressions including a first atomic logical expression that can be executed in the database and a second atomic logical expression that cannot be executed in the database.
- the basic logical expression is a combination of an external conjunction indicated by a logical product of each of the plurality of first atomic logical expressions and a negation, logical product, or logical sum of each of the plurality of second atomic logical expressions.
- the search command separation step separates the input search command into the first and second atomic logical expressions by executing a search command separation procedure for separating the search command, and The external conjunction is generated from an atomic logical expression, and the internal logical expression is generated from the second atomic logical expression, and the external conjunction and the internal logical expression are reconstructed into the split-sum standard logical expression.
- the search instruction separation procedure is a procedure executed recursively, When the input search instruction is indicated by a logical sum of the first and second logical expressions, each of the first and second logical expressions is recursively executed as the input search instruction.
- the database search method is: A logical expression integration process for concatenating the external conjunctions common to the basic logical expressions included in the logical expressions obtained by the logical sums of the third and fourth logical expressions that have undergone the logical expression transformation processing; The database search method of the form 21 to perform.
- the search instruction separation procedure is: When the input search instruction is indicated by the logical product of the fifth and sixth logical expressions, each of the fifth and sixth logical expressions is recursively executed as the input search instruction. Thus, the seventh logical expression corresponding to the fifth logical expression and the eighth logical expression corresponding to the sixth logical expression are output, The database search method according to mode 22 for executing a logical expression expansion process for expanding a logical expression indicated by a logical product of the seventh logical expression and the eighth logical expression.
- the search instruction separation procedure is: A database search method according to a twenty-third aspect, wherein the logical expression integration process is executed on a logical expression obtained by the logical expression expansion process.
- the program is related to the third viewpoint.
- the search instruction separation process converts the input search instruction into a plurality of basic logical expressions including a first atomic logical expression that can be executed in the database and a second atomic logical expression that cannot be executed in the database.
- the basic logical expression is a combination of an external conjunction indicated by a logical product of each of the plurality of first atomic logical expressions and a negation, logical product, or logical sum of each of the plurality of second atomic logical expressions.
- the program of the form 26 shown by the logical product of the internal logical formula shown by this.
- the search instruction separation processing is a program according to mode 27, wherein the input search instruction is converted into a divided-sum-product standard logical expression represented by a logical sum of each of the plurality of basic logical expressions.
- the search command separation process separates the input search command into the first and second atomic logical expressions by executing a search command separation procedure for separating the search command, and The external conjunction is generated from an atomic logical expression, and the internal logical expression is generated from the second atomic logical expression, and the external conjunction and the internal logical expression are reconstructed into the split-sum standard logical expression.
- the program of form 28 to do.
- the search instruction separating process is a program according to mode 29, which generates the divided sum-product standard logical expression by recursively executing the search instruction separation procedure.
- the search instruction separation procedure is a procedure executed recursively, When the input search instruction is indicated by a logical sum of the first and second logical expressions, each of the first and second logical expressions is recursively executed as the input search instruction.
- the search instruction separation procedure is: A logical expression integration process for concatenating the external conjunctions common to the basic logical expressions included in the logical expressions obtained by the logical sums of the third and fourth logical expressions that have undergone the logical expression transformation processing; The program of the form 33 to perform.
- the search instruction separation procedure is: When the input search instruction is indicated by the logical product of the fifth and sixth logical expressions, each of the fifth and sixth logical expressions is recursively executed as the input search instruction. Thus, the seventh logical expression corresponding to the fifth logical expression and the eighth logical expression corresponding to the sixth logical expression are output, The program of the form 34 which performs the logical expression expansion
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Computational Linguistics (AREA)
- Mathematical Physics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- Bioethics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Description
本発明は、日本国特許出願:特願2012-271545号(2012年12月12日出願)に基づくものであり、同出願の全記載内容は引用をもって本書に組み込み記載されているものとする。
本発明は、データベース検索装置、データベース検索方法及びプログラムに関する。特に、外部のデータベースを検索するデータベース検索装置、データベース検索方法及びプログラムに関する。
なお、本方法は、データベースという、特定の機械に結びつけられている。
なお、このプログラムは、コンピュータが読み取り可能な記憶媒体に記録することができる。記憶媒体は、半導体メモリ、ハードディスク、磁気記録媒体、光記録媒体等の非トランジェント(non-transient)なものとすることができる。本発明は、コンピュータプログラム製品として具現することも可能である。
第1の実施形態について、図面を用いてより詳細に説明する。
・a=constを満たすデータを検索する。
・a≧constを満たすデータを検索する。
・外部連言=±L1∧・・・∧±Ln(nは正の整数、以下同じ)。
・分割和積論理式=((外部連言1)∧(内部論理式1))∨・・・∨((外部連言n)∧(内部論理式n))。
・検索命令Mが、外部データベース2で実行可能な場合には、¬Mも外部データベース2で実行可能である。
・検索命令M1及びM2が外部データベース2で実行可能な場合には、M1∨M2及びM1∧M2も外部データベース2で実行可能である。
・「外部データベース2内の全データを取得する」という検索命令が、外部データベース2で実行できる。
・Po=((外部連言1)∧(内部論理式1))∨・・・∨((外部連言n)∧(内部論理式n))。
この場合、外部連言iは、集合Sの要素L1、・・・、Lmを用いて、外部連言i=±L1∧・・・∧±Lmと表記できる。
・Po=(外部連言)∧(内部論理式)=True∧P。
・集合Sは、空集合である。
・Po=(外部連言)∧(内部論理式)=True∧¬P。
・集合Sは、空集合である。
・Po=(外部連言)∧(内部論理式)=P∧True。
・集合Sとして、一元集合{P}を出力する。
・Po=(外部連言)∧(内部論理式)=¬P∧True。
・集合Sとして、一元集合{P}を出力する。
・Qo=(A∧X)∨・・・。
・Ro=(B∧Y)∨・・・。
・Q1=((A∧B)∧X)∨((A∧¬B)∧X)∨・・・。
このような変換操作が、論理式変形処理である。
・R1=((A∧B)∧Y)∨((¬A∧B)∧Y)∨・・・。
・P=Q∨R=Qo∨Ro=Q1∨R1=((A∧B)∧X)∨((A∧¬B)∧X)∨・・・∨((A∧B)∧Y)∨((¬A∧B)∧Y)・・・(1)
・P=((A∧B)∧(X∨Y))∨((A∧¬B)∧X)∨・・・∨((¬A∧B)∧Y) ・・・(2)
・Qo=(A1∧X1)∨(A2∧X2)∨・・・。
・Ro3=(B1∧Y1)∨(B2∧Y2)∨・・・。
・P=Qo∧Ro=((A1∧X1)∨(A2∧X2)∨・・・)∧((B1∧Y1)∨(B2∧Y2)∨・・・) ・・・(3)
・P=P2=Qo∧Ro=((A1∧B1)∧(X1∧Y1))∨((A1∧B2)∧(X1∧Y2))∨・・・(4)
・K=(外部連言1)∧(内部論理式1))∨・・・∨((外部連言n)∧(内部論理式n)。
・SCNFToSET(K)={(外部連言1、内部論理式1)、・・・、(外部連言n、内部論理式n)}。
・U={(A1、X1)、・・・、(An、Xn)}。
その上で、SETToSCNF(U)を以下のとおりとする。
・SETToSCNF(U)=(A1∧X1)∨・・・∨(An∧Xn)。
・Conv(V1、V2)={(L∧C1∧・・・∧Cn、X)|(L、X)∈U1、C1∈{B1、¬B1}、・・・、Cn∈{Bn、¬Bn}}。
・Wの要素(L、X)、(M、Y)においてL=Mとなる要素が存在すれば、Wから(L、X)、(M、Y)を取り除き、(L、X∨Y)をWに追加する。
・L=Mとなる組がWからなくなるまで、上記の操作を繰り返す。
・Expand(U1、U2)={(L∧M、X∧Y)|(X、L)∈U1、(Y、M)∈U2}。
・「検索命令V1」を満たすデータを外部データベース2から取得する。
・「検索命令V2」を満たすデータを外部データベース2から取得する。
・P=(V1∨W1)∧(V2∨W2)をデータベース検索装置1で実行する。
という手順が考えられる。
しかし、このような手順では、「検索命令V1とV2の両方を満たすデータ」を取得しているため、非効率的な外部データベース2へのアクセスを行っている。
続いて、第2の実施形態について図面を参照して詳細に説明する。
上記第1の視点に係るデータベース検索装置のとおりである。
[形態2]
前記検索命令分離部は、前記入力された検索命令を、前記データベースにおいて実行可能な第1の原子論理式と前記データベースにおいて実行不能な第2の原子論理式と、を含む複数の基本論理式に分離する形態1のデータベース検索装置。
[形態3]
前記基本論理式は、複数の前記第1の原子論理式のそれぞれの論理積で示される外部連言と、複数の前記第2の原子論理式のそれぞれの、否定、論理積又は論理和の組み合わせで示される内部論理式と、の論理積により示される形態2のデータベース検索装置。
[形態4]
前記検索命令分離部は、前記入力された検索命令を、前記複数の基本論理式のそれぞれの論理和で示される分割和積標準論理式に変換する形態3のデータベース検索装置。
[形態5]
前記検索命令分離部は、前記入力された検索命令を分離する検索命令分離手順を実行することで、前記入力された検索命令を、前記第1及び第2の原子論理式に分離すると共に、前記第1の原子論理式から前記外部連言を生成し、且つ、前記第2の原子論理式から前記内部論理式を生成し、前記外部連言及び前記内部論理式を前記分割和積標準論理式に再構成する形態4のデータベース検索装置。
[形態6]
前記検索命令分離部は、前記検索命令分離手順を再帰的に実行することで、前記分割和積標準論理式を生成する形態5のデータベース検索装置。
[形態7]
前記外部連言は、互いに排他的である形態3乃至6のいずれか一に記載のデータベース検索装置。
[形態8]
前記所定のデータベースは、検索可能暗号により暗号化されたデータを格納する形態1乃至7のいずれか一に記載のデータベース検索装置。
[形態9]
前記検索命令分離手順は、再帰的に実行される手順であって、
前記入力された検索命令が、第1及び第2の論理式の論理和により示される場合には、前記第1及び第2の論理式のそれぞれを前記入力された検索命令として再帰的に実行することで、前記第1の論理式に対応する第3の論理式と、前記第2の論理式に対応する第4の論理式を出力し、
前記第3及び第4の論理式のそれぞれにおいて、前記第3及び第4の論理式の互いに含まれない前記第1の原子論理式を、前記第3及び第4の論理式に含ませる論理式変形処理を実行する形態5乃至8のいずれか一に記載のデータベース検索装置。
[形態10]
前記検索命令分離手順は、
前記論理式変形処理が実行された前記第3及び第4の論理式のそれぞれの論理和により得られる論理式に含まれる前記基本論理式に共通する前記外部連言を括り出す論理式統合処理を実行する形態9のデータベース検索装置。
[形態11]
前記検索命令分離手順は、
前記入力された検索命令が、第5及び第6の論理式の論理積により示される場合には、前記第5及び第6の論理式のそれぞれを前記入力された検索命令として再帰的に実行することで、前記第5の論理式に対応する第7の論理式と、前記第6の論理式に対応する第8の論理式を出力し、
前記第7の論理式と前記第8の論理式の論理積により示される論理式を展開する論理式展開処理を実行する形態10のデータベース検索装置。
[形態12]
前記検索命令分離手順は、
前記論理式展開処理により得られた論理式に対して、前記論理式統合処理を実行する形態11のデータベース検索装置。
[形態13]
上記第2の視点に係るデータベースの検索方法のとおりである。
[形態14]
前記検索命令分離工程は、前記入力された検索命令を、前記データベースにおいて実行可能な第1の原子論理式と前記データベースにおいて実行不能な第2の原子論理式と、を含む複数の基本論理式に分離する形態13のデータベースの検索方法。
[形態15]
前記基本論理式は、複数の前記第1の原子論理式のそれぞれの論理積で示される外部連言と、複数の前記第2の原子論理式のそれぞれの、否定、論理積又は論理和の組み合わせで示される内部論理式と、の論理積により示される形態14のデータベースの検索方法。
[形態16]
前記検索命令分離工程は、前記入力された検索命令を、前記複数の基本論理式のそれぞれの論理和で示される分割和積標準論理式に変換する形態15のデータベースの検索方法。
[形態17]
前記検索命令分離工程は、前記検索命令を分離する検索命令分離手順を実行することで、前記入力された検索命令を、前記第1及び第2の原子論理式に分離すると共に、前記第1の原子論理式から前記外部連言を生成し、且つ、前記第2の原子論理式から前記内部論理式を生成し、前記外部連言及び前記内部論理式を前記分割和積標準論理式に再構成する形態16のデータベースの検索方法。
[形態18]
前記検索命令分離工程は、前記検索命令分離手順を再帰的に実行することで、前記分割和積標準論理式を生成する形態17のデータベースの検索方法。
[形態19]
前記外部連言は、互いに排他的である形態15乃至18のいずれか一に記載のデータベースの検索方法。
[形態20]
前記所定のデータベースは、検索可能暗号により暗号化されたデータを格納する形態13乃至19のいずれか一に記載のデータベースの検索方法。
[形態21]
前記検索命令分離手順は、再帰的に実行される手順であって、
前記入力された検索命令が、第1及び第2の論理式の論理和により示される場合には、前記第1及び第2の論理式のそれぞれを前記入力された検索命令として再帰的に実行することで、前記第1の論理式に対応する第3の論理式と、前記第2の論理式に対応する第4の論理式を出力し、
前記第3及び第4の論理式のそれぞれにおいて、前記第3及び第4の論理式の互いに含まれない前記第1の原子論理式を、前記第3及び第4の論理式に含ませる論理式変形処理を実行する形態17乃至20のいずれか一に記載のデータベースの検索方法。
[形態22]
前記検索命令分離手順は、
前記論理式変形処理が実行された前記第3及び第4の論理式のそれぞれの論理和により得られる論理式に含まれる前記基本論理式に共通する前記外部連言を括り出す論理式統合処理を実行する形態21のデータベースの検索方法。
[形態23]
前記検索命令分離手順は、
前記入力された検索命令が、第5及び第6の論理式の論理積により示される場合には、前記第5及び第6の論理式のそれぞれを前記入力された検索命令として再帰的に実行することで、前記第5の論理式に対応する第7の論理式と、前記第6の論理式に対応する第8の論理式を出力し、
前記第7の論理式と前記第8の論理式の論理積により示される論理式を展開する論理式展開処理を実行する形態22のデータベースの検索方法。
[形態24]
前記検索命令分離手順は、
前記論理式展開処理により得られた論理式に対して、前記論理式統合処理を実行する形態23のデータベースの検索方法。
[形態25]
上記第3の視点に係るプログラムのとおりである。
[形態26]
前記検索命令分離処理は、前記入力された検索命令を、前記データベースにおいて実行可能な第1の原子論理式と前記データベースにおいて実行不能な第2の原子論理式と、を含む複数の基本論理式に分離する形態25のプログラム。
[形態27]
前記基本論理式は、複数の前記第1の原子論理式のそれぞれの論理積で示される外部連言と、複数の前記第2の原子論理式のそれぞれの、否定、論理積又は論理和の組み合わせで示される内部論理式と、の論理積により示される形態26のプログラム。
[形態28]
前記検索命令分離処理は、前記入力された検索命令を、前記複数の基本論理式のそれぞれの論理和で示される分割和積標準論理式に変換する形態27のプログラム。
[形態29]
前記検索命令分離処理は、前記検索命令を分離する検索命令分離手順を実行することで、前記入力された検索命令を、前記第1及び第2の原子論理式に分離すると共に、前記第1の原子論理式から前記外部連言を生成し、且つ、前記第2の原子論理式から前記内部論理式を生成し、前記外部連言及び前記内部論理式を前記分割和積標準論理式に再構成する形態28のプログラム。
[形態30]
前記検索命令分離処理は、前記検索命令分離手順を再帰的に実行することで、前記分割和積標準論理式を生成する形態29のプログラム。
[形態31]
前記外部連言は、互いに排他的である形態27乃至30のいずれか一に記載のプログラム。
[形態32]
前記所定のデータベースは、検索可能暗号により暗号化されたデータを格納する形態25乃至31のいずれか一に記載のプログラム。
[形態33]
前記検索命令分離手順は、再帰的に実行される手順であって、
前記入力された検索命令が、第1及び第2の論理式の論理和により示される場合には、前記第1及び第2の論理式のそれぞれを前記入力された検索命令として再帰的に実行することで、前記第1の論理式に対応する第3の論理式と、前記第2の論理式に対応する第4の論理式を出力し、
前記第3及び第4の論理式のそれぞれにおいて、前記第3及び第4の論理式の互いに含まれない前記第1の原子論理式を、前記第3及び第4の論理式に含ませる論理式変形処理を実行する形態29乃至32のいずれか一に記載のプログラム。
[形態34]
前記検索命令分離手順は、
前記論理式変形処理が実行された前記第3及び第4の論理式のそれぞれの論理和により得られる論理式に含まれる前記基本論理式に共通する前記外部連言を括り出す論理式統合処理を実行する形態33のプログラム。
[形態35]
前記検索命令分離手順は、
前記入力された検索命令が、第5及び第6の論理式の論理積により示される場合には、前記第5及び第6の論理式のそれぞれを前記入力された検索命令として再帰的に実行することで、前記第5の論理式に対応する第7の論理式と、前記第6の論理式に対応する第8の論理式を出力し、
前記第7の論理式と前記第8の論理式の論理積により示される論理式を展開する論理式展開処理を実行する形態34のプログラム。
[形態36]
前記検索命令分離手順は、
前記論理式展開処理により得られた論理式に対して、前記論理式統合処理を実行する形態35のプログラム。
2 外部データベース
2a 暗号化データベース
11、21 通信部
12、22 記憶部
13、23 制御部
14 暗号化管理部
24 暗号検索部
101、131 検索命令分離部
102、132 検索命令実行部
141 暗号埋込部
142 暗号復号部
Claims (10)
- 入力された検索命令を、所定のデータベースにおいて実行可能な第1の検索命令と、前記所定のデータベースにおいて実行不能な第2の検索命令と、に分離する検索命令分離部と、
前記所定のデータベースにおいて前記第1の検索命令を実行することにより取得した検索結果に対して、前記第2の検索命令を実行することで得られた検索結果を、前記入力された検索命令に対する検索結果とする検索命令実行部と、
を備えるデータベース検索装置。 - 前記検索命令分離部は、前記入力された検索命令を、前記データベースにおいて実行可能な第1の原子論理式と前記データベースにおいて実行不能な第2の原子論理式と、を含む複数の基本論理式に分離する請求項1のデータベース検索装置。
- 前記基本論理式は、複数の前記第1の原子論理式のそれぞれの論理積で示される外部連言と、複数の前記第2の原子論理式のそれぞれの、否定、論理積又は論理和の組み合わせで示される内部論理式と、の論理積により示される請求項2のデータベース検索装置。
- 前記検索命令分離部は、前記入力された検索命令を、前記複数の基本論理式のそれぞれの論理和で示される分割和積標準論理式に変換する請求項3のデータベース検索装置。
- 前記検索命令分離部は、前記入力された検索命令を分離する検索命令分離手順を実行することで、前記入力された検索命令を、前記第1及び第2の原子論理式に分離すると共に、前記第1の原子論理式から前記外部連言を生成し、且つ、前記第2の原子論理式から前記内部論理式を生成し、前記外部連言及び前記内部論理式を前記分割和積標準論理式に再構成する請求項4のデータベース検索装置。
- 前記検索命令分離部は、前記検索命令分離手順を再帰的に実行することで、前記分割和積標準論理式を生成する請求項5のデータベース検索装置。
- 前記外部連言は、互いに排他的である請求項3乃至6のいずれか一項に記載のデータベース検索装置。
- 前記所定のデータベースは、検索可能暗号により暗号化されたデータを格納する請求項1乃至7のいずれか一項に記載のデータベース検索装置。
- 入力された検索命令を、所定のデータベースにおいて実行可能な第1の検索命令と、前記所定のデータベースにおいて実行不能な第2の検索命令と、に分離する検索命令分離工程と、
前記所定のデータベースにおいて第1の検索命令を実行することにより取得した検索結果に対して、前記第2の検索命令を実行することで得られた検索結果を、前記入力された検索命令に対する検索結果とする検索命令実行工程と、
を含むデータベースの検索方法。 - 入力された検索命令を、所定のデータベースにおいて実行可能な第1の検索命令と、前記所定のデータベースにおいて実行不能な第2の検索命令と、に分離する検索命令分離処理と、
前記所定のデータベースにおいて第1の検索命令を実行することにより取得した検索結果に対して、前記第2の検索命令を実行することで得られた検索結果を、前記入力された検索命令に対する検索結果とする検索命令実行処理と、
をデータベース検索装置を制御するコンピュータに実行させるプログラム。
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP13862321.0A EP2933732A4 (en) | 2012-12-12 | 2013-12-11 | DATABASE SEARCH, DATABASE SEARCH AND PROGRAM |
JP2014552061A JP6225918B2 (ja) | 2012-12-12 | 2013-12-11 | データベース検索装置、データベース検索方法及びプログラム |
US14/651,154 US10339140B2 (en) | 2012-12-12 | 2013-12-11 | Database search device, database search method, and program |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2012271545 | 2012-12-12 | ||
JP2012-271545 | 2012-12-12 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2014092105A1 true WO2014092105A1 (ja) | 2014-06-19 |
Family
ID=50934393
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2013/083164 WO2014092105A1 (ja) | 2012-12-12 | 2013-12-11 | データベース検索装置、データベース検索方法及びプログラム |
Country Status (4)
Country | Link |
---|---|
US (1) | US10339140B2 (ja) |
EP (1) | EP2933732A4 (ja) |
JP (1) | JP6225918B2 (ja) |
WO (1) | WO2014092105A1 (ja) |
Families Citing this family (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10635669B1 (en) | 2014-01-27 | 2020-04-28 | Microstrategy Incorporated | Data engine integration and data refinement |
US11921715B2 (en) | 2014-01-27 | 2024-03-05 | Microstrategy Incorporated | Search integration |
US11386085B2 (en) | 2014-01-27 | 2022-07-12 | Microstrategy Incorporated | Deriving metrics from queries |
US10255320B1 (en) | 2014-01-27 | 2019-04-09 | Microstrategy Incorporated | Search integration |
US9952894B1 (en) | 2014-01-27 | 2018-04-24 | Microstrategy Incorporated | Parallel query processing |
US10846318B1 (en) | 2017-04-18 | 2020-11-24 | Microstrategy Incorporated | Natural language visualizations |
US11195050B2 (en) | 2019-02-05 | 2021-12-07 | Microstrategy Incorporated | Machine learning to generate and evaluate visualizations |
US11614970B2 (en) | 2019-12-06 | 2023-03-28 | Microstrategy Incorporated | High-throughput parallel data transmission |
US11567965B2 (en) | 2020-01-23 | 2023-01-31 | Microstrategy Incorporated | Enhanced preparation and integration of data sets |
CN113111356A (zh) * | 2021-03-09 | 2021-07-13 | 深圳市教育信息技术中心(深圳市教育装备中心) | 数据加密方法、装置、设备和介质 |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2000076295A (ja) * | 1998-09-02 | 2000-03-14 | Nippon Telegr & Teleph Corp <Ntt> | 情報検索方法および情報検索プログラムを記録した記録媒体 |
JP2009271584A (ja) * | 2008-04-30 | 2009-11-19 | Tokyo Metropolitan Univ | 類似情報検索システムおよび類似情報検索プログラム |
WO2010041516A1 (ja) * | 2008-10-08 | 2010-04-15 | インターナショナル・ビジネス・マシーンズ・コーポレーション | 情報処理装置、文書検索システム、文書検索方法およびプログラム |
Family Cites Families (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5757983A (en) * | 1990-08-09 | 1998-05-26 | Hitachi, Ltd. | Document retrieval method and system |
JPH05313965A (ja) | 1992-03-10 | 1993-11-26 | Hitachi Ltd | データベース管理システム |
JPH09114851A (ja) * | 1995-10-20 | 1997-05-02 | Fuji Xerox Co Ltd | 情報管理装置 |
EP1128323A3 (en) * | 1999-12-27 | 2002-05-29 | Seiko Epson Corporation | Printer, printing method, and data storage medium |
US20020078020A1 (en) * | 2000-10-02 | 2002-06-20 | Lawton Scott S. | Method and system of entering search criteria using multiple entry fields per data element |
JP2002236682A (ja) * | 2001-02-13 | 2002-08-23 | Fuji Photo Film Co Ltd | データベース・システム |
US6889225B2 (en) * | 2001-08-09 | 2005-05-03 | Integrated Silicon Solution, Inc. | Large database search using content addressable memory and hash |
JP4129819B2 (ja) * | 2003-10-06 | 2008-08-06 | インターナショナル・ビジネス・マシーンズ・コーポレーション | データベース検索システム及びその検索方法並びにプログラム |
JP4575064B2 (ja) * | 2004-07-29 | 2010-11-04 | 三菱電機株式会社 | 情報検索装置 |
JP4165546B2 (ja) * | 2005-09-30 | 2008-10-15 | ブラザー工業株式会社 | 検索システム及びプログラム |
US8078593B1 (en) * | 2008-08-28 | 2011-12-13 | Infineta Systems, Inc. | Dictionary architecture and methodology for revision-tolerant data de-duplication |
US9338139B2 (en) * | 2008-09-15 | 2016-05-10 | Vaultive Ltd. | System, apparatus and method for encryption and decryption of data transmitted over a network |
WO2011016401A1 (ja) * | 2009-08-03 | 2011-02-10 | 日本電信電話株式会社 | 関数暗号応用システム及び方法 |
JP5432736B2 (ja) | 2010-01-18 | 2014-03-05 | 日本電信電話株式会社 | 暗号化された情報のためのキーワード検索システム、キーワード検索方法、検索要求装置、検索代行装置、プログラム、記録媒体 |
JP5412414B2 (ja) * | 2010-12-08 | 2014-02-12 | 株式会社日立製作所 | 検索可能暗号処理システム |
US9600677B2 (en) * | 2011-11-11 | 2017-03-21 | Nec Corporation | Database apparatus, method, and program |
JP6056850B2 (ja) * | 2012-03-29 | 2017-01-11 | 日本電気株式会社 | 暗号化データベースシステム、クライアント端末、データベースサーバ、データ結合方法、および、プログラム |
US9263053B2 (en) * | 2012-04-04 | 2016-02-16 | Google Technology Holdings LLC | Method and apparatus for generating a candidate code-vector to code an informational signal |
-
2013
- 2013-12-11 US US14/651,154 patent/US10339140B2/en active Active
- 2013-12-11 WO PCT/JP2013/083164 patent/WO2014092105A1/ja active Application Filing
- 2013-12-11 JP JP2014552061A patent/JP6225918B2/ja active Active
- 2013-12-11 EP EP13862321.0A patent/EP2933732A4/en not_active Withdrawn
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2000076295A (ja) * | 1998-09-02 | 2000-03-14 | Nippon Telegr & Teleph Corp <Ntt> | 情報検索方法および情報検索プログラムを記録した記録媒体 |
JP2009271584A (ja) * | 2008-04-30 | 2009-11-19 | Tokyo Metropolitan Univ | 類似情報検索システムおよび類似情報検索プログラム |
WO2010041516A1 (ja) * | 2008-10-08 | 2010-04-15 | インターナショナル・ビジネス・マシーンズ・コーポレーション | 情報処理装置、文書検索システム、文書検索方法およびプログラム |
Non-Patent Citations (5)
Title |
---|
ALEXANDRA BOLDYREVA; NATHAN CHENETTE; YOUNHO LEE; ADAM O'NEILL: "Order-Preserving Symmetric Encryption", EUROCRYPT, 26 April 2009 (2009-04-26), Retrieved from the Internet <URL:http://link.springer.com/chapter/10.1007%2F978-3-642-01001-9_13> |
CRAIG GENTRY: "Fully Homomorphic Encryption Using Ideal Lattices", STOC'09, 31 May 2009 (2009-05-31), Retrieved from the Internet <URL:http://domino.research.ibm.com/comm/research_projects.nsf/pages/securit y.homoenc.html/$FILE/stocdhe.pdf> |
D. SONG; D. WAGNER; A. PERRIG: "Practical Techniques for Searches on Encrypted Data", IEEE SYMPOSIUM, 2000 |
RALUCA ADA POPA; CATHERINE M. S. REDFIELD; NICKOLAI ZELDOVICH; HARI BALAKRISHNAN: "CryptDB: Protecting Confidentiality with Encrypted Query Processing", SOSP' 11 PROCEEDINGS OF THE TWENTY-THIRD ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES, 30 November 2012 (2012-11-30), Retrieved from the Internet <URL:http://dI.acm.org/citation.cfm?doid=2043556.2043566> |
See also references of EP2933732A4 |
Also Published As
Publication number | Publication date |
---|---|
JP6225918B2 (ja) | 2017-11-08 |
EP2933732A1 (en) | 2015-10-21 |
JPWO2014092105A1 (ja) | 2017-01-12 |
EP2933732A4 (en) | 2016-07-27 |
US20150317362A1 (en) | 2015-11-05 |
US10339140B2 (en) | 2019-07-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP6225918B2 (ja) | データベース検索装置、データベース検索方法及びプログラム | |
Cui et al. | Efficient and expressive keyword search over encrypted data in cloud | |
Wang et al. | Inverted index based multi-keyword public-key searchable encryption with strong privacy guarantee | |
JP6934963B2 (ja) | データを暗号化する方法およびシステム | |
EP3058678B1 (en) | System and method for dynamic, non-interactive, and parallelizable searchable symmetric encryption | |
Agrawal et al. | Simplifying design and analysis of complex predicate encryption schemes | |
US20160335450A1 (en) | Searchable encryption processing system and searchable encryption processing method | |
JP5348337B2 (ja) | 暗号化データベース管理システム、クライアントおよびサーバ、自然結合方法およびプログラム | |
JP5951122B2 (ja) | 暗号システム、暗号方法及び暗号プログラム | |
JP6119766B2 (ja) | 中間サーバ、データベース問い合わせ処理方法およびプログラム | |
WO2014041066A1 (en) | Method and system to perform secure boolean search over encrypted documents | |
WO2016072022A1 (ja) | 暗号化グラフの検索方法、暗号化グラフの検索システム及び計算機 | |
Kasten et al. | Towards search on encrypted graph data | |
JP2017044779A (ja) | 検索可能暗号処理システム | |
Agrawal et al. | Multi-input attribute based encryption and predicate encryption | |
Poh et al. | Searchable symmetric encryption over multiple servers | |
Kuzu et al. | Distributed search over encrypted big data | |
Francati et al. | Registered (inner-product) functional encryption | |
Falk et al. | Durasift: A robust, decentralized, encrypted database supporting private searches with complex policy controls | |
Strizhov et al. | Secure Multi-keyword Similarity Search Over Encrypted Cloud Data Supporting Efficient Multi-user Setup. | |
JP6672451B2 (ja) | 暗号化検索インデックスマージサーバ、暗号化検索インデックスマージシステム、及び暗号化検索インデックスマージ方法 | |
Bouscatié et al. | Pattern matching in encrypted stream from inner product encryption | |
JP6642425B2 (ja) | 条件生成装置、条件生成方法、条件生成プログラム、データベース検索システム、及び、データベース検索プログラム | |
Zhao et al. | An efficient symmetric searchable encryption scheme for dynamic dataset in cloud computing paradigms | |
JP6493402B2 (ja) | 追加装置、削除装置、追加依頼装置、データ検索システム、データ検索方法、および、コンピュータプログラム |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 13862321 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 14651154 Country of ref document: US |
|
REEP | Request for entry into the european phase |
Ref document number: 2013862321 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2013862321 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 2014552061 Country of ref document: JP Kind code of ref document: A |
|
NENP | Non-entry into the national phase |
Ref country code: DE |