Indexing for data having indexable and non-indexable parent nodes
US8892564B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 28, 2005 |
| Grant date | Nov 18, 2014 |
| Priority date | — |
| Expiry date | Mar 27, 2028 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/81
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A directed graph of data includes nodes 10, properties 22 attached to nodes and resources 34. The nodes 10, properties 22 and resources 34 are classified as indexable or non indexable. At least one property 30 links a pair of nodes, one node being a parent and one being a child. An indexing algorithm indexes each indexable property pointing to a resource as related to any respective indexable nodes linked to the node to which the indexable property is attached through a chain of indexable links from child to parent through intermediate nodes, all of which are non-indexable.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.