Method and apparatus for conducting data queries using consolidation strings and inter-node consolidation
US7840546B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jun 13, 2008 |
| Grant date | Nov 23, 2010 |
| Priority date | — |
| Expiry date | Aug 7, 2029 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/962
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Query inefficiencies are improved and entity-interrelational blindness is overcome by employing two ideas: Consolidation Strings and Inter-Node Consolidation. These ideas can be typically employed in law-enforcement records systems (such as COPLINK systems), but is certainly not limited to such an application. Consolidation Strings represent key pieces of information that are in a text/character format, and may be encrypted/hashed. A system's hierarchy of consolidation rules automatically determine if two different rows in a database actually refer to the same real-world object. These rules are NOT statistical or probabilistic in nature, thus enhancing the confidence and reliability in the results. Three general classifications of Consolidation Strings are encompassed: Those based on positive identifiers, those based on demographic information, and those based on associative information that spans multiple-entity types. Inter-Node Consolidation provides a means to facilitate the communication of updated consolidation information between data-source nodes in order to leverage the advantages of Consolidation Strings.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.