Patent ID: 8566030

Claim:
A method comprising: finding, by at least one computer system in response to a query having an associated location in a network of nodes and edges, a specified number of data objects of interest that are nearest to the location; wherein each of the edges has an associated time-dependent weight and the finding comprises: filtering out objects of a set of candidate nearest neighbors based on first sub-networks around the data objects of interest, the first sub-networks comprising a sub-network generated by expanding from a corresponding one of the data objects using a lower-bound for edge weights between nodes, wherein the expansion of the sub-network was limited by other sub-networks expanded from remaining ones of the data objects using an upper-bound for edge weights between nodes, and filtering in objects of the set of candidate nearest neighbors based on the first sub-networks and second sub-networks around the data objects of interest, the second sub-networks comprising a second sub-network expanded from a corresponding one of the data objects using an upper-bound for edge weights between nodes, wherein the expansion of the second sub-network was limited by other sub-networks expanded from remaining ones of the data objects using a lower-bound for edge weights between nodes.