http://rdf.ncbi.nlm.nih.gov/pubchem/patent/JP-2017134554-A
Outgoing Links
| Predicate | Object |
|---|---|
| assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_e5db580deca7130dbe51805c6c608b35 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F17-30 |
| filingDate | 2016-01-27-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_140903c271b087a3af6cc8c6081c028f |
| publicationDate | 2017-08-03-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | JP-2017134554-A |
| titleOfInvention | SEARCH DEVICE, SEARCH PROGRAM, AND SEARCH METHOD |
| abstract | A method for speeding up a forward match search. A storage unit 1a includes correspondence information between a child node and a prefix included in a character string portion corresponding to the child node, and each character string portion corresponding to the node and the own node that pass through the node. The identification information indicating the character string including the concatenated character string concatenated in the order of passing through the prefix is stored for each node. When the first character string is input, the arithmetic unit 1b sequentially traces the nodes corresponding to the character string portions included in the first character string using the correspondence information. When the computing unit 1b detects a node for the last character string portion of the first character string, the computing unit 1b calculates a second character string that matches the first character string forward based on the identification information corresponding to the detected node. Output. [Selection] Figure 1 |
| priorityDate | 2016-01-27-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
| Predicate | Subject |
|---|---|
| isDiscussedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID3033151 http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID419499693 |
Total number of triples: 12.