US 9,286,373 B2Grant

Computer-implemented systems and methods for comparing and associating objects

Issue Date:2016-03-15

•20 Claims

•5 Drawing Sheets

Abstract

Computer-implemented systems and methods are disclosed for comparing and associating objects. In some embodiments, a method is provided for associating a first object with one or more objects within a plurality of objects, each object comprising a first plurality of properties, each property comprising data reflecting a characteristic of an entity represented by the object, the associated objects comprising matching data in corresponding properties for a second plurality of properties. The method may include executing, for each object within the plurality of objects and for the first object, the following: creating a slug for the object, the slug comprising the second plurality of properties from the object; and inputting the slug for the object into a Bloom filter. Further, the method may include creating for a bin within the Bloom filter corresponding to the slug for the first object, an association between objects whose slugs correspond to the bin if the slugs for those objects match.

Metadata

Assignee

Palantir Technologies Inc.

Inventors

Mark Elliot
Allen Chang

Application Information

Application Number:US 14/552,336

Filing Date:2014-11-24

Priority Date:2013-03-15

Art Unit:2157

Classifications

IPC:

G06F7/00G06F17/30

Patent Drawings (5 sheets)

Description

Reference to Related Applications

[0001] This application is a continuation of U.S. Non-Provisional application Ser. No. 14/099,661, filed on Dec. 6, 2013, which claims the benefit of priority to U.S. Provisional Patent Application No. 61/801,297, filed on Mar. 15, 2013, the disclosures of which are expressly incorporated herein by reference in their entireties.

Background

[0002] Numerous organizations, including industry and government entities, recognize that important conclusions can be drawn if massive data sets can be analyzed to identify patterns of behavior that suggest dangers to public safety or evidence illegality. These analyses often involve matching data associated with a person or thing of interest with other data associated with the same person or thing to determine that the same person or thing has been involved in multiple acts that raise safety or criminal concerns.

[0003] Yet, the quality of the analytical result arising from use of sophisticated analytical tools can be limited by the quality of data the tool utilizes. For certain types of analyses, an acceptable error rate must be literally or nearly zero for an analytical conclusion drawn from the data to be sound. Achieving this zero or near-zero error rate for datasets comprising tens or hundreds of millions of records can be problematic. Present data comparison tools are not well suited to solve these issues.

[0004] The issues discussed above are particularly acute for analyses involving data related to identifying persons or things for inquiries relating to public safety. For example, analytical tools for identifying potential safety threats generally do not have an acceptable error rate greater than zero because the cost of mistakenly identifying the presence of a safety threat (i.e., a “false positive”) or allowing a safety threat to go undetected (i.e., a “false negative”) is unacceptably high. Therefore, tools supporting public safety must correctly relate data associated with persons or things of interest with other data related to the same person or thing.

[0005] Some tools exist for accurately comparing data, but they are computationally impractical to use with datasets containing millions of records. For example, one solution to determining whether two particular objects are associated with the same person or thing of interest is to compare each element of one object to a corresponding element in the second object. For example, for objects containing M elements, a first element in the first object may be compared to a corresponding first element in the second object, and corresponding comparisons may be made for each of the remaining M−1 elements common to the first and second objects. If the elements within each object are collectively adequate to uniquely identify the represented person or thing with certainty, and corresponding elements within the first and second objects match, a conclusion may reasonably be drawn that the objects reflect the same person or thing. As an alternative, each object could be converted (serialized) into a single string reflecting the contents of each element to be compared. Thereafter, a string generated from one object could be compared to a string generated from another object as a form of object comparison.

[0006] For certain datasets, the above approaches may consume little memory or system resources, because the objects or their serialized strings can be stored on disk rather than in main memory. However, the above approaches may quickly become impractical with large or non-trivial datasets. As the number of objects to compare increases, the number of comparisons and thus the processing time of the comparisons increases exponentially; i.e., proportional to n²/2, where n represents the number of objects to be compared. Thus, a comparison of 500 objects using a serialized approach, whose processing time may be approximated as the time to perform 125,000 string comparisons, may be computationally tractable. However, a comparison of 100 million (100M) records using that approach, whose processing time may be approximated as the time to perform 5 quadrillion (5e15) string comparisons, may be computationally intractable. Additionally, reading strings from disk rather than reading them from memory may add additional processing time.

[0007] Another solution for identifying matching objects within a corpus of objects is to store each object in a multimap. This multimap is an associative array that stores multiple values for each key. Importing the objects into the multimap leads to objects with the same element data being stored in a single entry of the multimap. Thus, use of a multimap associates identical objects.

[0008] One drawback to using a multimap for object comparisons is that the multimap is typically stored in main memory, due to algorithmic considerations related to key organization within the multimap, so an object comparator must have sufficient main memory to hold a multimap comprising the entire corpus in memory. Therefore, a multimap solution can be impractical for datasets at or above 100M objects. Similar drawbacks exist to each approach as applied to other object comparison problems, such as efficiently identifying unique objects within a corpus of objects and efficiently comparing a single object to all objects within a corpus of object.

[0009] Neither solution is viable for datasets approaching or exceeding 100M objects. Yet, object datasets comprising 100M or more objects are not uncommon today. Therefore, the problems described above are quite real and a need exists for improved object comparators.

Brief Description of the Drawings

[0010] Reference will now be made to the accompanying drawings showing example embodiments of the present application, and in which:

[0011] FIG. 1 illustrates a flowchart of an exemplary process for comparing a target object to at least some objects in a corpus, consistent with some embodiments of the present disclosure.

[0012] FIG. 2 illustrates a flowchart of an exemplary process for comparing all objects in a corpus to all other objects in the corpus, to determine matches within the corpus, consistent with some embodiments of the present disclosure.

[0013] FIG. 3 illustrates a flowchart of an exemplary process for comparing all objects in a corpus to all other objects in the corpus, to determine unique objects within the corpus, consistent with some embodiments of the present disclosure.

[0014] FIG. 4 illustrates an exemplary computing environment within which embodiments of the present disclosure can be implemented.

Detailed Description of Exemplary Embodiments

[0015] Reference will now be made in detail to the embodiments, examples of which are illustrated in the accompanying drawings. Whenever possible, consistent reference numbers will be used throughout the drawings to refer to the same or like parts.

[0016] Embodiments of the present disclosure can avoid the shortcomings of traditional object comparators by providing computer-implemented systems and methods for comparing objects in a way that allows for greater computational throughput and acceptable memory consumption without a reduction in comparison accuracy and for dataset sizes that were previously impractical or impossible at acceptable levels of computational throughput.

[0017] Embodiments of the present disclosure address a class of computational problems related to object comparison. One member of this class involves efficient object comparison of a particular object to a corpus of objects. Another member of this class involves efficient comparison of each object in a corpus to all other objects in the corpus. An additional member of this class involves efficient identification of unique objects within a corpus of objects.

[0018] The following detailed description begins with a general overview of object comparison. Some examples of objects to be compared or analyzed are provided. The description then explains an exemplary embodiment that addresses the first class of problem discussed above (i.e., efficiently comparing one object to all objects in a corpus). The description then expands the solution to the first class of problem to address the second class of problem discussed above (i.e., efficient comparison of each object in a corpus to all other objects in the corpus). The detailed description then discloses a solution to the third class of problem (i.e., efficient identification of unique objects within a corpus of objects). An introduction to objects and an overview of object comparison follows.

[0019] Several types of objects exist within the field of computer science. One type of object that is well known within the field of computer science is an object in the object-oriented sense. Wikipedia describes an object of this type as a set of elements (i.e., data structures) and methods, which are similar to functions. Without necessarily endorsing that rather simplistic description, embodiments implementing the object comparison solutions discussed herein are compatible with comparing objects of this type.

[0020] Another type of object within the field of computer science field is a data structure that reflects the properties of a person or thing relevant to a particular task or data processing environment. In some embodiments, these properties are reflected by strings. In other embodiments, properties may be reflected by strings, integers, real numbers, times or dates, binary values, structures in the C programming sense, enumerated variables, and/or other forms of data. In some embodiments, properties within either type of object may be converted to strings prior to comparison. In other embodiments, some properties may be strings or may be converted to strings while other properties may not be strings and may not be converted to strings. The embodiments of the present disclosure may operate on string or non-string properties.

[0021] Moreover, the notion of a “data structure” is very flexible in this context. The term “data structure” can reflect any type of structured data, from information stored in a database (with table columns reflecting elements within an object or data structure and table rows reflecting instances of the object or data structure) to formatted text in a text file (such as data within an XML structure) to data stored within an executing computer program. Accordingly, because a data structure broadly encompasses the types of structured data described above, objects also broadly encompass these types of structured data. Moreover, the object comparison solutions discussed herein are also compatible with comparing objects of these types.

[0022] In some embodiments, effective object comparison involves considering which properties of the objects to be compared are relevant to performing the comparison because the entities (e.g., persons or things) reflected by those objects may have different relevant properties in different environments. For example, an object can store properties of an automobile that may be relevant to a state's motor vehicle department by storing the following information: vehicle identification number (VIN), year of manufacture, make, model, expiration date of the vehicle's registration, and a direct or indirect indication of the person that owns the vehicle.

[0023] For automobiles being sold on an auction website such as eBay, however, the relevant properties of an automobile may differ from those relevant to the state's motor vehicle department. For example, a data structure for storing properties of an automobile listed for sale on eBay may include: VIN, year, make, model, odometer reading, condition of the automobile, minimum auction bid, and a direct or indirect indication of the person listing the vehicle for sale. Thus, properties of an entity (e.g., a person or thing) relevant to one environment may differ from properties of the entity relevant to another environment. Accordingly, an object's properties considered during object comparison in one environment may differ from those considered during object comparison in a second environment.

[0024] In some embodiments, effective data comparison may also involve considering which properties tend to distinguish an entity (e.g., a person or thing) from other instances of the entity. For example, a VIN for an automobile should by design be unique to that automobile. However, occasional situations may arise where a VIN is not unique to a particular automobile. Such situations may arise from intentional errors or accidental errors. An example of an intentional error is attempting fraudulent registration of a stolen vehicle under an assumed VIN. An example of an accidental error occurs when a smog check worker incorrectly enters a VIN into a computer at a smog check station, which leads to a smog check record with an incorrect VIN subsequently being communicated to a state database. Data errors exist in real world data processing environments, so some embodiments of the present disclosure minimize or eliminate errors by identifying objects through a combination of several object properties rather than identifying objects through use of a single object property.

[0025] In some embodiments, one or more identifying properties of an object are extracted from the object and stored in a data structure. This data structure is referred to as a “slug”; it contains information that may be sufficient to uniquely identify an entity (e.g., a person or thing) with some degree of information redundancy to allow for detecting errors in the properties within the slug. In some embodiments, the slug comprises a concatenation of strings separated by a delimiter character. In some embodiments, the delimiter character is a NULL character while in other embodiments the delimiter character may be a character not otherwise present in the concatenated string. In some embodiments, the concatenated strings may be delimited by a delimiter string (e.g., “--”) rather than a delimiter character. In embodiments employing a delimiter string, the delimiter string may be any string that is not otherwise present in the strings that were concatenated. In other embodiments, the slug comprises a data structure such as an object, array, structure, or associative array.

[0026] For example, in one embodiment, slug for an automobile may contain properties reflecting a VIN, make, model, and year for the automobile. Inclusion of make, model, and year properties for the automobile within the slug provides a capability for detecting errors in the VIN property because the VIN property is not the only object property being compared. For slugs associated with two automobiles to match in the presence of an error in the VIN property of one automobile object, an automobile object with the same VIN property as the erroneous VIN must also have the same make, model, and year properties.

[0027] The odds of this coincidental match of multiple properties between two or more objects may be fleetingly low. Therefore, inclusion of some degree of information redundancy should avoid or at least substantially reduce erroneous object comparison matches relative to object comparisons only comparing a single property between objects notwithstanding that the single property was intended to uniquely identify its corresponding entity (e.g., person or thing).

[0028] Exemplary embodiments will now be described that solve the first problem discussed above, i.e., efficiently comparing a particular object (hereinafter a “target object”) to all objects in a corpus. The disclosed embodiments utilize a Bloom filter to identify slugs associated with objects in the corpus that do not match the slug for the target object. This quick recognition is performed by discarding slugs that are associated with a different bin in the Bloom filter than the bin associated with the slug for the target object.

[0029] Bloom filters have the property that two slugs falling into different bins within the Bloom filter are certain to have different properties and thus reflect different objects. Therefore, if the slug for the target object does not fall into the same bin as the slug for a particular object in the corpus, the target object does not match the particular object in the corpus and may thus be removed from future consideration in such embodiments.

[0030] FIG. 1 illustrates a flowchart of an exemplary process 100 for comparing a target object to at least some objects in a corpus, consistent with some embodiments of the present disclosure. In some embodiments, the target object to be compared to at least some objects in the corpus is a member of the corpus. In these embodiments, a comparison between the target object and all other objects in the corpus is performed. In other embodiments, the object to be compared to at least some objects in the corpus is not a member of the corpus. In these other embodiments, a comparison between the target object and all objects in the corpus is performed.

[0031] As illustrated, in step 102, a Bloom filter is sized and created with consideration for the error rate that will result for the corpus size that is being processed. For example, increasing the number of bins in a Bloom filter may tend to decrease the error rate for a specific corpus size while reducing the number of bins in a Bloom filter may tend to increase the error rate for a specific corpus size. Techniques for sizing a Bloom filter to achieve a target error rate for a specific corpus size are well known in the art, so these techniques are not discussed herein.

[0032] In step 104, a slug for the target object (i.e., the object against which all objects in the corpus will be compared) is generated. Considerations for selecting which properties of an object to include in a slug were discussed above. In step 106, a Bloom filter bin corresponding to the slug for the target object is determined. In some embodiments, a Bloom filter bin for a slug may be determined by inputting the slug to a Bloom filter and directing the Bloom filter to disclose the bin into which the slug was added.

[0033] In other embodiments, a Bloom filter bin for a slug may be determined by presenting the slug as a input to a software function associated with the Bloom filter without storing the slug in the Bloom filter. In additional embodiments, a bin for a slug may be determined by inputting the slug into a software function reflecting a bin selection algorithm for a Bloom filter in the absence of using an actual and/or complete Bloom filter and receiving the Bloom filter bin as an output of that software function. In other embodiments, other approaches to yielding a Bloom filter bin from a slug may be utilized. These approaches for identifying a Bloom filter bin for a slug, consistent with the embodiments discussed above, are collectively referred to in steps 106, 108. The determined Bloom filter bin will be utilized to identify slug comparison matches, some of which may be “false positives”, using the Bloom filter as discussed below.

[0034] In step 108, a slug for each object in the corpus is generated. In step 110, a Bloom filter bin for each object in the corpus is determined. In some embodiments, a Bloom filter bin for an object may be determined by inputting the object's slug into the Bloom filter and directing the Bloom filter to disclose the bin into which the slug was added.

[0035] After completion of step 110, slugs corresponding to the bin identified in step 108 reflect matches with the slug for the target object. Some of these matches, however, may be false positive matches rather than true matches. Therefore, steps 112 and 114 filter out the false positive matches through use of a multimap.

[0036] In step 112, for each slug corresponding to an object in the corpus whose bin in the Bloom filter is the same bin as the slug for the target object, the slug corresponding to an object in the corpus and its corresponding object in the corpus is added to a multimap. When adding the slug and its corresponding object to the multimap, the slug represents the key to the multimap and the object in the corpus represents the value to the multimap. This multimap will be utilized to remove false positives from processing. In step 114, the process concludes by selecting the true positive matches identified in the multimap. These non-false positive matches can be retrieved from the multimap by reading data from the multimap with the slug for the target object as a key.

[0037] In some embodiments, process 100 may be distributed across multiple processors. For example, a Bloom filter may exist on each of several processors and steps 102 through 114 can be executed on each of the several processors. The corpus of objects may be distributed among the various processors so that all objects are processed by one processor, but no object is processed by more than one processor. In such embodiments, each of the multiple processors outputs a portion of the objects in the corpus that match the target object.

[0038] Exemplary embodiments will now be described that solve the second problem discussed above, i.e., efficiently comparing all objects to all objects in a corpus. These embodiments utilize a counting Bloom filter to quickly identify slugs associated with objects in the corpus that do not match the slug for the target object. Counting Bloom filters are well known in the art, so their structure and construction are not discussed herein.

[0039] In particular, if a bin in the counting Bloom filter has a value of zero or one after slugs for all of the objects in the corpus have been input to the Bloom filter, no object whose slug is associated with that bin could match another slug, so these slugs are removed from further consideration. These slugs can be removed because those skilled in the art will recognize that Bloom filters can have false positives but they cannot have false negatives. Therefore, a counting Bloom filter bin whose count is less than two reflects an accurate determination that no match exists between slugs associated with that bin because any match would create a count of at least two. However, false positive may exist among objects whose slugs are associated with the same Bloom filter bin, so false positives may be removed through additional processing, as discussed below.

[0040] FIG. 2 illustrates a flowchart of an exemplary process 200 for comparing all objects in a corpus to all other objects in the corpus, to determine matches within the corpus, consistent with some embodiments of the present disclosure. As illustrated, in step 202, a counting Bloom filter is sized and created with consideration for the error rate that will result for the corpus size that is being processed. For example, increasing the number of bins in a counting Bloom filter may tend to decrease the error rate for a specific corpus size while reducing the number of bins in a counting Bloom filter may tend to increase the error rate for a specific corpus size. Techniques for sizing a counting Bloom filter to achieve a target error rate for a specific corpus size are well known in the art, so these techniques are not discussed herein.

[0041] In some embodiments, the counting Bloom filter may comprise an N-bit counter and these counters may be implemented as two-bit counters (i.e., N=2). In other embodiments, these counters may be one-bit counters or counters of more than two bits. In additional embodiments, these counters are saturation counters; i.e., these counters will count up to a maximum value and then not exceed that value.

[0042] In step 204, a slug for each object in the corpus is generated. In step 206, each slug is input to the counting Bloom filter, which causes a counter in a bin corresponding to a slug to be incremented. After completion of step 206, bins whose counters have a value greater than one reflect one or more matching slugs. Some of these matches, however, may be false positive matches rather than true matches. Therefore, steps 208 and 210 filter out the false positive matches through use of a multimap.

[0043] In step 208, for slugs associated with bins in the counting Bloom filter whose counters have a value greater than 1, the slug and its associated object are added to a multimap. When adding the slug and its corresponding object to the multimap, the slug represents the key to the multimap and the object in the corpus represents the value to the multimap. This multimap will be utilized to remove false positives from processing. In step 210, the process 200 concludes by outputting a value for any key in the multimap that has two or more values. The outputted values reflect objects whose slugs matched slugs of at least one other object in the corpus. Thus, the objects outputted identify objects whose selected properties, as reflected in an object's slug, unambiguously match at least one other object in the corpus.

[0044] In some embodiments, process 200 may be distributed across multiple processors. For example, a counting Bloom filter may exist on each of several processors and steps 202, 204, and 206 can be executed on each of the several processors. The corpus of objects may be distributed among the various processors so that all objects are processed by one processor, but no object is processed by more than one processor. In such embodiments, prior to executing step 208, counters for each bin in the counting Bloom filter are summed together with counters for the same bin in counting Bloom filters on other processors. Thereafter, process 200 continues by executing steps 208 and 210 on a single processor.

[0045] Exemplary embodiments will now be described that solve the third problem discussed above, i.e., efficiently identifying unique objects in a corpus. These embodiments utilize a counting Bloom filter and a multimap to quickly identify unique objects. Upon inputting slugs for all objects in the corpus into the counting Bloom filter, any bin with a count value of one reflects a unique object because Bloom filters do not generate false negatives. Additionally, to the extent that bins have count values of two or more, those count values could reflect false positives. Therefore, a multimap allows a determination of whether the matches reflected in the count values were false or true positives.

[0046] FIG. 3 illustrates a flowchart of an exemplary process 300 for comparing all objects in a corpus to all other objects in the corpus, to determine unique objects within the corpus, consistent with some embodiments of the present disclosure. As illustrated, in step 302, a counting Bloom filter is sized and created with consideration for the error rate that will result for the corpus size that is being processed. For example, increasing the number of bins in a counting Bloom filter may tend to decrease the error rate for a specific corpus size while reducing the number of bins in a counting Bloom filter may tend to increase the error rate for a specific corpus size. Techniques for sizing a counting Bloom filter to achieve a target error rate for a specific corpus size are well known so these techniques are not discussed herein.

[0047] In some embodiments, the counting Bloom filter may comprise an N-bit counter and these counters may be implemented as two-bit counters (i.e., N=2). In other embodiments, these counters may be one-bit counters or counters of more than two bits. In additional embodiments, these counters are saturation counters; i.e., these counters will count up to a maximum value and then not exceed that value.

[0048] In step 304, a slug for each object in the corpus is generated. In step 306, each slug is input to the counting Bloom filter, which causes a counter in a bin corresponding to the slug to be incremented. As previously discussed, after slugs for all objects in the corpus have been input to the counting Bloom filter, any bin with a count value of one reflects a unique object within the corpus because the counting Bloom filter does not generate false negatives. Therefore, in step 308, for each slug whose counter in the counting Bloom filter is one, the slug's corresponding object is output as a unique object within the corpus.

[0049] After completion of step 308, bins whose counters have a value greater than one reflect one or more matching slugs; i.e., slugs that are not unique. Some of these matches, however, may be false positive matches rather than true matches due to the nature of Bloom filters, as discussed above. Therefore, steps 310 and 312 filter out the false positive matches through use of a multimap.

[0050] Steps 310 and 312 determine whether the counting Bloom filter is masking the existence of other unique objects because the Bloom filter allows for false positives. In step 310, for each slug whose associated bin has a counter value greater than one, the slug is input as a key to a multimap and the object corresponding to the slug is input as a value for that key. In step 312, the process terminates after outputting each value in the multimap for keys that have only one value. Unique objects within the corpus are reflected by the collection of objects output from step 308 and the collection of objects output by step 312 because the former reflects objects whose slugs were the only slug in a counting Bloom filter's bin and were therefore unique among slugs associated with objects in the corpus while the latter reflects slugs that were false positives within the counting Bloom filter but were disambiguated by the multimap.

[0051] In some embodiments, process 300 may be distributed across multiple processors. For example, a counting Bloom filter may exist on each of several processors and steps 302, 304, and 306 can be executed on each of several processors. The corpus of objects may be distributed among the various processors so that all objects are processed by one processor, but no object is processed by more than one processor. In such embodiments, prior to executing step 308, counters for each bin in the counting Bloom filter are summed together with counters for the same bin in counting Bloom filters on other processors. Thereafter, process 300 continues by executing steps 308, 310, and 312 on a single processor.

[0052] FIG. 4 illustrates an exemplary computing environment within which the embodiments of the present disclosure can be implemented.

[0053] Computer system 400 includes a bus 402 or other communication mechanism for communicating information, and a hardware processor 404 coupled with bus 402 for processing information. In some embodiments, hardware processor 404 can be, for example, a general-purpose microprocessor or it can be a reduced instruction set microprocessor.

[0054] Computer system 400 also includes a main memory 406, such as a random access memory (RAM) or other dynamic storage device, coupled to bus 402 for storing information and instructions to be executed by processor 404. Main memory 406 also can be used for storing temporary variables or other intermediate information during execution of instructions by processor 404. Such instructions, when stored in non-transitory storage media accessible to processor 404, render computer system 400 into a special-purpose machine that is customized to perform the operations specified in the instructions.

[0055] In some embodiments, computer system 400 further includes a read only memory (ROM) 408 or other static storage device coupled to bus 402 for storing static information and instructions for processor 404. A storage device 410, such as a magnetic disk or optical disk, is provided and coupled to bus 402 for storing information and instructions.

[0056] Computer system 400 can be coupled via bus 402 to a display 412, such as a cathode ray tube (CRT) or LCD panel, for displaying information to a computer user. An input device 414, including alphanumeric and other keys, is coupled to bus 402 for communicating information and command selections to processor 404. Another type of user input device is cursor control 416, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 404 and for controlling cursor movement on display 412. The input device typically has degrees of freedom in two axes, a first axis (for example, x) and a second axis (for example, y), that allows the device to specify positions in a plane.

[0057] Computer system 400 can implement the processes and techniques described herein using customized hard-wired logic, one or more ASICs or FPGAs, firmware and/or program logic which in combination with the computer system causes or programs computer system 400 to be a special-purpose machine. In some embodiments, the processes and techniques herein are performed by computer system 400 in response to processor 404 executing one or more sequences of one or more instructions contained in main memory 406. Such instructions can be read into main memory 406 from another storage medium, such as storage device 410. Execution of the sequences of instructions contained in main memory 406 causes processor 404 to perform the process steps described herein. In other embodiments, hard-wired circuitry can be used in place of or in combination with software instructions.

[0058] The term “storage media” as used herein refers to any non-transitory media that store data and/or instructions that cause a machine to operate in a specific manner. Such storage media can comprise non-volatile media and/or volatile media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 410. Volatile media includes dynamic memory, such as main memory 406. Common forms of storage media include, for example, a floppy disk, a flexible disk, hard disk, solid state drive, magnetic tape, or any other magnetic data storage medium, a CD-ROM, any other optical data storage medium, any physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, NVRAM, any other memory chip or cartridge.

[0059] Storage media is distinct from but can be used in conjunction with transmission media. Transmission media participates in transferring information between storage media. For example, transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 402. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.

[0060] Various forms of media can be involved in carrying one or more sequences of one or more instructions to processor 404 for execution. For example, the instructions can initially be carried on a magnetic disk or solid state drive of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 400 can receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 402. Bus 402 carries the data to main memory 406, from which processor 404 retrieves and executes the instructions. The instructions received by main memory 406 can optionally be stored on storage device 410 either before or after execution by processor 404.

[0061] Computer system 400 also includes a communication interface 418 coupled to bus 402. Communication interface 418 provides a two-way data communication coupling to a network link 420 that is connected to a local network 422. For example, communication interface 418 can be an integrated services digital network (ISDN) card, cable modem, satellite modem, or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 418 can be a local area network (LAN) card to provide a data communication connection to a compatible LAN. Wireless links can also be implemented. In any such implementation, communication interface 418 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.

[0062] Network link 420 typically provides data communication through one or more networks to other data devices. For example, network link 420 can provide a connection through local network 422 to a host computer 424 or to data equipment operated by an Internet Service Provider (ISP) 426. ISP 426 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 428. Local network 422 and Internet 428 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 420 and through communication interface 418, which carry the digital data to and from computer system 400, are example forms of transmission media.

[0063] Computer system 400 can send messages and receive data, including program code, through the network(s), network link 420 and communication interface 418. In the Internet example, a server 430 might transmit a requested code for an application program through Internet 428, ISP 426, local network 422 and communication interface 418. The received code can be executed by processor 404 as it is received, and/or stored in storage device 410, or other non-volatile storage for later execution.

Claims

What is claimed is:

1. An electronic device comprising:

one or more computer-readable storage media configured to store instructions; and

one or more processors configured to execute the instructions to cause the electronic device to:

execute, using the one or more processors, for each object within a plurality of objects, the following steps:

create a data structure of a first type comprising information for identifying one or more objects comprising a set of properties, wherein the data structure of a first type is created based at least in part on one or more properties associated with the object; and

input the data structure of a first type into a data structure of a second type configured to determine objects associated with the data structure of a first type; and

create, using the one or more processors, an association between a first object and a second object based at least in part on adding a data structure of a first type for the first object and a data structure of a first type for the second object into a same bin in the data structure of a second type, wherein the first object comprises a first set of properties, and wherein the second object comprises a second set of properties that include at least a portion of the first set of properties.

2. The electronic device of claim 1, wherein the one or more processors are further configured to execute the instructions to cause the electronic device to:

size the data structure of a second type based at least on an amount of objects within the plurality of objects.

3. The electronic device of claim 1, wherein the one or more processors are further configured to execute the instructions to cause the electronic device to:

cause the data structure of a second type to add each data structure of a first type into a bin in the data structure of a second type, the bin being one of a plurality of bins in the data structure of a second type; and

for each bin comprising two or more data structures of a first type:

add the two or more data structures of a first type to a multimap.

4. The electronic device of claim 3, wherein the one or more processors are further configured to execute the instructions to cause the electronic device to:

add two or more objects that correspond to the two or more data structures of a first type added to the multimap to the multimap; and

in response to the added two or more objects being different from each other, remove at least one of the two or more data structures of a first type from their respective bin of the plurality of bins.

5. The electronic device of claim 1, wherein the data structure of a first type structure is a slug, and the data structure of a second type is a bloom filter.

6. The electronic device of claim 1, wherein the one or more properties associated with the object are based at least in part on an environment associated with the object.

7. The electronic device of claim 1, wherein the one or more properties associated with the object are based at least in part on information that uniquely identifies the object.

8. The electronic device of claim 1, wherein the data structure of a second type exists on each of the one or more processors; and

the data structure of a second type is executed on each of the one or more processors.

9. A method performed by at least one electronic device comprising one or more processors, the method comprising:

executing, using at least one processor, for each object within a plurality of objects, the following steps:

creating a data structure of a first type for the object, wherein the data structure of a first type is created based at least in part on one or more properties associated with the object; and

inputting the data structure of a first type for the object into a data structure of a second type; and

creating, using at least one processor, an association between a first object and a second object based at least in part on a data structure of a first type for the first object and a data structure of a first type for the second object corresponding to a same bin in the data structure of a second type, wherein the first object comprises a first set of properties, and wherein the second object comprises a second set of properties that include at least a portion of the first set of properties.

10. The method of claim 9, further comprising:

sizing the data structure of a second type based at least on an amount of objects within the plurality of objects.

11. The method of claim 9, further comprising:

causing the data structure of a second type to add each data structure of a first type into a bin in the data structure of a second type, the bin being one of a plurality of bins in the data structure of a second type; and

for each bin comprising two or more data structures of a first type:

adding the two or more data structures of a first type to a multimap.

12. The method of claim 11, further comprising:

adding two or more objects that correspond to the two or more data structures of a first type added to the multimap to the multimap; and

in response to the added two or more objects being different from each other, removing at least one of the two or more data structures of a first type from their respective bin of the plurality of bins.

13. The method of claim 9, wherein the data structure of a first type is a slug, and the data structure of a second type is a bloom filter.

14. The method of claim 9, wherein the one or more properties associated with the object are based at least in part on an environment associated with the object.

15. A non-transitory computer readable medium that stores a set of instructions that are executable by at least one processor of an electronic device to cause the electronic device to perform a method for associating objects, the method comprising:

executing, using at least one processor, for each object within a plurality of objects, the following steps:

creating a data structure of a first type for the object, wherein the data structure of a first type is created based at least in part on one or more properties associated with the object; and

inputting the data structure of a first type for the object into a data structure of a second type; and

16. The non-transitory computer readable medium of claim 15, wherein the set of instructions that are executable by the at least one processor of the electronic device to cause the electronic device to further perform:

sizing the data structure of a second type based at least on an amount of objects within the plurality of objects.

17. The non-transitory computer readable medium of claim 15, wherein the set of instructions that are executable by the at least one processor of the electronic device to cause the electronic device to further perform:

causing the data structure of a first type to add each of the data structures of a first type into a bin in the data structure of a second type, the bin being one of a plurality of bins in the data structure of a second type; and

for each bin comprising two or more data structures of a first type:

adding the two or more data structures of a first type to a multimap.

18. The non-transitory computer readable medium of claim 17, wherein the set of instructions that are executable by the at least one processor of the electronic device to cause the electronic device to further perform:

adding two or more objects that correspond to the two or more data structures of a first type added to the multimap to the multimap; and

19. The non-transitory computer readable medium of claim 5, wherein the data structure of a first type is a slug, and the data structure of a second type is a bloom filter.

20. The non-transitory computer readable medium of claim 5, wherein the one or more properties associated with the object are based at least in part on an environment associated with the object.

Patent Citations (272)

Patent	Date	Inventor	Cited By
US5241625(A)	1993-08-01	Epard et al.	Applicant
US5826021(A)	1998-10-01	Mastors et al.	Applicant
US5832218(A)	1998-11-01	Gibbs et al.	Applicant
US5845300(A)	1998-12-01	Comer et al.	Applicant
US5878434(A)	1999-03-01	Draper et al.	Applicant
US5897636(A)	1999-04-01	Kaeser	Applicant
US5966706(A)	1999-10-01	Biliris et al.	Applicant
US6006242(A)	1999-12-01	Poole et al.	Applicant
US6057757(A)	2000-05-01	Arrowsmith et al.	Applicant
US6065026(A)	2000-05-01	Cornelia et al.	Applicant
US6134582(A)	2000-10-01	Kennedy	Applicant
US6237138(B1)	2001-05-01	Hameluck et al.	Applicant
US6243706(B1)	2001-06-01	Moreau et al.	Applicant
US6243717(B1)	2001-06-01	Gordon et al.	Applicant
US6430305(B1)	2002-08-01	Decker	Applicant
US6463404(B1)	2002-10-01	Appleby	Applicant
US6519627(B1)	2003-02-01	Dan et al.	Applicant
US6523019(B1)	2003-02-01	Borthwick	Applicant
US6820135(B1)	2004-11-01	Dingman	Applicant
US6944821(B1)	2005-09-01	Bates et al.	Applicant
US6978419(B1)	2005-12-01	Kantrowitz	Applicant
US7058648(B1)	2006-06-01	Lightfoot et al.	Applicant
US7089541(B2)	2006-08-01	Ungar	Applicant
US7168039(B2)	2007-01-01	Bertram	Applicant
US7174377(B2)	2007-02-01	Bernard et al.	Applicant
US7392254(B1)	2008-06-01	Jenkins	Applicant
US7403942(B1)	2008-07-01	Bayliss	Applicant
US7461158(B2)	2008-12-01	Rider et al.	Applicant
US7617232(B2)	2009-11-01	Gabbert et al.	Applicant
US7627489(B2)	2009-12-01	Schaeffer et al.	Applicant
US7757220(B2)	2010-07-01	Griffith et al.	Applicant
US7877421(B2)	2011-01-01	Berger et al.	Applicant
US7880921(B2)	2011-02-01	Dattilo et al.	Applicant
US7912842(B1)	2011-03-01	Bayliss	Applicant
US7917376(B2)	2011-03-01	Bellin et al.	Applicant
US7941321(B2)	2011-05-01	Greenstein et al.	Applicant
US7958147(B1)	2011-06-01	Turner et al.	Applicant
US7962495(B2)	2011-06-01	Jain et al.	Applicant
US8036971(B2)	2011-10-01	Aymeloglu et al.	Applicant
US8046283(B2)	2011-10-01	Burns	Applicant
US8054756(B2)	2011-11-01	Chand et al.	Applicant
US8073857(B2)	2011-12-01	Sreekanth	Applicant
US8117022(B2)	2012-02-01	Linker	Applicant
US8126848(B2)	2012-02-01	Wagner	Applicant
US8229902(B2)	2012-07-01	Vishniac et al.	Applicant
US8290838(B1)	2012-10-01	Thakur et al.	Applicant
US8302855(B2)	2012-11-01	Ma et al.	Applicant
US8364642(B1)	2013-01-01	Garrod	Applicant
US8417715(B1)	2013-04-01	Bruckhaus et al.	Applicant
US8429527(B1)	2013-04-01	Arbogast	Applicant
US8473454(B2)	2013-06-01	Evanitsky et al.	Applicant
US8484115(B2)	2013-07-01	Aymeloglu et al.	Applicant
US8554719(B2)	2013-10-01	McGrew	Applicant
US8589273(B2)	2013-11-01	Creeden et al.	Applicant
US8601326(B1)	2013-12-01	Kim	Applicant
US8639552(B1)	2014-01-01	Chen et al.	Applicant
US8688573(B1)	2014-04-01	Rukonic et al.	Applicant
US8732574(B2)	2014-05-01	Burr et al.	Applicant
US8812960(B1)	2014-08-01	Sun et al.	Applicant
US8903717(B2)	2014-12-01	Elliot	Applicant
US8924388(B2)	2014-12-01	Elliot et al.	Applicant
US8924389(B2)	2014-12-01	Elliot et al.	Applicant
US8949164(B1)	2015-02-01	Mohler	Applicant
US8984390(B2)	2015-03-01	Aymeloglu et al.	Applicant
US9058315(B2)	2015-06-01	Burr et al.	Applicant
US9100428(B1)	2015-08-01	Visbal	Applicant
US9105000(B1)	2015-08-01	White et al.	Applicant
US2002/0032677(A1)	2002-03-01	Morgenthaler et al.	Applicant
US2002/0035590(A1)	2002-03-01	Eibach et al.	Applicant
US2002/0065708(A1)	2002-05-01	Senay et al.	Applicant
US2002/0095360(A1)	2002-07-01	Joao	Applicant
US2002/0095658(A1)	2002-07-01	Shulman	Applicant
US2002/0103705(A1)	2002-08-01	Brady	Applicant
US2002/0147805(A1)	2002-10-01	Leshem et al.	Applicant
US2003/0093401(A1)	2003-05-01	Czahowski et al.	Applicant
US2003/0105759(A1)	2003-06-01	Bess et al.	Applicant
US2003/0115481(A1)	2003-06-01	Baird et al.	Applicant
US2003/0126102(A1)	2003-07-01	Borthwick	Applicant
US2003/0177112(A1)	2003-09-01	Gardner	Applicant
US2003/0182313(A1)	2003-09-01	Federwisch et al.	Applicant
US2003/0212718(A1)	2003-11-01	Tester	Applicant
US2004/0003009(A1)	2004-01-01	Wilmot	Applicant
US2004/0006523(A1)	2004-01-01	Coker	Applicant
US2004/0034570(A1)	2004-02-01	Davis	Applicant
US2004/0044648(A1)	2004-03-01	Anfindsen et al.	Applicant
US2004/0083466(A1)	2004-04-01	Dapp et al.	Applicant
US2004/0088177(A1)	2004-05-01	Travis et al.	Applicant
US2004/0117387(A1)	2004-06-01	Civetta et al.	Applicant
US2004/0153418(A1)	2004-08-01	Hanweck	Applicant
US2004/0153451(A1)	2004-08-01	Philips et al.	Applicant
US2004/0205492(A1)	2004-10-01	Newsome	Applicant
US2004/0210763(A1)	2004-10-01	Jonas	Applicant
US2004/0236688(A1)	2004-11-01	Bozeman	Applicant
US2005/0010472(A1)	2005-01-01	Quatse et al.	Applicant
US2005/0039116(A1)	2005-02-01	Slack-Smith	Applicant
US2005/0086207(A1)	2005-04-01	Heuer et al.	Applicant
US2005/0091186(A1)	2005-04-01	Elish	Applicant
US2005/0097441(A1)	2005-05-01	Herbach et al.	Applicant
US2005/0131935(A1)	2005-06-01	O'Leary et al.	Applicant
US2005/0262512(A1)	2005-11-01	Schmidt et al.	Applicant
US2006/0010130(A1)	2006-01-01	Leff et al.	Applicant
US2006/0026120(A1)	2006-02-01	Carolan et al.	Applicant
US2006/0026561(A1)	2006-02-01	Bauman et al.	Applicant
US2006/0031779(A1)	2006-02-01	Theurer et al.	Applicant
US2006/0053170(A1)	2006-03-01	Hill et al.	Applicant
US2006/0080316(A1)	2006-04-01	Gilmore et al.	Applicant
US2006/0136513(A1)	2006-06-01	Ngo et al.	Applicant
US2006/0143075(A1)	2006-06-01	Carr et al.	Applicant
US2006/0143079(A1)	2006-06-01	Basak et al.	Applicant
US2006/0218206(A1)	2006-09-01	Bourbonnais et al.	Applicant
US2006/0218491(A1)	2006-09-01	Grossman et al.	Applicant
US2006/0253502(A1)	2006-11-01	Raman et al.	Applicant
US2006/0265417(A1)	2006-11-01	Amato et al.	Applicant
US2006/0277460(A1)	2006-12-01	Forstall et al.	Applicant
US2007/0000999(A1)	2007-01-01	Kubo et al.	Applicant
US2007/0011304(A1)	2007-01-01	Error	Applicant
US2007/0038646(A1)	2007-02-01	Thota	Applicant
US2007/0043686(A1)	2007-02-01	Teng et al.	Applicant
US2007/0061752(A1)	2007-03-01	Cory	Applicant
US2007/0067285(A1)	2007-03-01	Blume	Applicant
US2007/0178501(A1)	2007-08-01	Rabinowitz et al.	Applicant
US2007/0233756(A1)	2007-10-01	D'Souza et al.	Applicant
US2007/0245339(A1)	2007-10-01	Bauman et al.	Applicant
US2007/0271317(A1)	2007-11-01	Carmel	Applicant
US2007/0284433(A1)	2007-12-01	Domenica et al.	Applicant
US2007/0295797(A1)	2007-12-01	Herman et al.	Applicant
US2007/0299697(A1)	2007-12-01	Friedlander et al.	Applicant
US2008/0005063(A1)	2008-01-01	Seeds	Applicant
US2008/0016155(A1)	2008-01-01	Khalatian	Applicant
US2008/0109714(A1)	2008-05-01	Kumar et al.	Applicant
US2008/0126344(A1)	2008-05-01	Hoffman et al.	Applicant
US2008/0126951(A1)	2008-05-01	Sood et al.	Applicant
US2008/0140387(A1)	2008-06-01	Linker	Applicant
US2008/0195672(A1)	2008-08-01	Hamel et al.	Applicant
US2008/0222295(A1)	2008-09-01	Robinson et al.	Applicant
US2008/0228467(A1)	2008-09-01	Womack et al.	Applicant
US2008/0255973(A1)	2008-10-01	El Wade et al.	Applicant
US2008/0267386(A1)	2008-10-01	Cooper	Applicant
US2008/0270316(A1)	2008-10-01	Guidotti et al.	Applicant
US2008/0281580(A1)	2008-11-01	Zabokritski	Applicant
US2008/0313132(A1)	2008-12-01	Hao et al.	Applicant
US2009/0055487(A1)	2009-02-01	Moraes et al.	Applicant
US2009/0089651(A1)	2009-04-01	Herberger et al.	Applicant
US2009/0106178(A1)	2009-04-01	Chu	Applicant
US2009/0112745(A1)	2009-04-01	Stefanescu	Applicant
US2009/0125459(A1)	2009-05-01	Norton et al.	Applicant
US2009/0150868(A1)	2009-06-01	Chakra et al.	Applicant
US2009/0164387(A1)	2009-06-01	Armstrong et al.	Applicant
US2009/0187546(A1)	2009-07-01	Whyte et al.	Applicant
US2009/0187548(A1)	2009-07-01	Ji et al.	Applicant
US2009/0199106(A1)	2009-08-01	Jonsson et al.	Applicant
US2009/0248757(A1)	2009-10-01	Havewala et al.	Applicant
US2009/0249244(A1)	2009-10-01	Robinson et al.	Applicant
US2009/0271343(A1)	2009-10-01	Vaiciulis et al.	Applicant
US2009/0282068(A1)	2009-11-01	Shockro et al.	Applicant
US2009/0299830(A1)	2009-12-01	West et al.	Applicant
US2009/0307049(A1)	2009-12-01	Elliott et al.	Applicant
US2009/0313311(A1)	2009-12-01	Hoffmann et al.	Applicant
US2009/0313463(A1)	2009-12-01	Pang et al.	Applicant
US2009/0319418(A1)	2009-12-01	Herz	Applicant
US2010/0042922(A1)	2010-02-01	Bradeteanu et al.	Applicant
US2010/0057622(A1)	2010-03-01	Faith et al.	Applicant
US2010/0070531(A1)	2010-03-01	Aymeloglu et al.	Applicant
US2010/0070842(A1)	2010-03-01	Aymeloglu et al.	Applicant
US2010/0082541(A1)	2010-04-01	Kottomtharayil	Applicant
US2010/0082671(A1)	2010-04-01	Li et al.	Applicant
US2010/0098318(A1)	2010-04-01	Anderson	Applicant
US2010/0114817(A1)	2010-05-01	Gilbert et al.	Applicant
US2010/0145909(A1)	2010-06-01	Ngo	Applicant
US2010/0161735(A1)	2010-06-01	Sharma	Applicant
US2010/0191563(A1)	2010-07-01	Schlaifer et al.	Applicant
US2010/0204983(A1)	2010-08-01	Chung et al.	Applicant
US2010/0223260(A1)	2010-09-01	Wu	Applicant
US2010/0262688(A1)	2010-10-01	Hussain et al.	Applicant
US2010/0306285(A1)	2010-12-01	Shah et al.	Applicant
US2010/0313239(A1)	2010-12-01	Chakra et al.	Applicant
US2011/0061013(A1)	2011-03-01	Billicki et al.	Applicant
US2011/0066497(A1)	2011-03-01	Gopinath et al.	Applicant
US2011/0078173(A1)	2011-03-01	Seligmann et al.	Applicant
US2011/0093327(A1)	2011-04-01	Fordyce et al.	Applicant
US2011/0099133(A1)	2011-04-01	Chang et al.	Applicant
US2011/0153384(A1)	2011-06-01	Horne et al.	Applicant
US2011/0173093(A1)	2011-07-01	Psota et al.	Applicant
US2011/0208822(A1)	2011-08-01	Rathod	Applicant
US2011/0213655(A1)	2011-09-01	Henkin	Applicant
US2011/0225482(A1)	2011-09-01	Chan et al.	Applicant
US2011/0252282(A1)	2011-10-01	Meek et al.	Applicant
US2011/0258216(A1)	2011-10-01	Supakkul et al.	Applicant
US2011/0270604(A1)	2011-11-01	Qi et al.	Applicant
US2011/0289397(A1)	2011-11-01	Eastmond et al.	Applicant
US2011/0314007(A1)	2011-12-01	Dassa et al.	Applicant
US2012/0011238(A1)	2012-01-01	Rathod	Applicant
US2012/0013684(A1)	2012-01-01	Lucia	Applicant
US2012/0022945(A1)	2012-01-01	Falkenborg et al.	Applicant
US2012/0054284(A1)	2012-03-01	Rakshit	Applicant
US2012/0059853(A1)	2012-03-01	Jagota	Applicant
US2012/0066166(A1)	2012-03-01	Curbera et al.	Applicant
US2012/0078595(A1)	2012-03-01	Balandin et al.	Applicant
US2012/0079363(A1)	2012-03-01	Folting et al.	Applicant
US2012/0131512(A1)	2012-05-01	Takeuchi et al.	Applicant
US2012/0159362(A1)	2012-06-01	Brown et al.	Applicant
US2012/0173381(A1)	2012-07-01	Smith	Applicant
US2012/0188252(A1)	2012-07-01	Law	Applicant
US2012/0191446(A1)	2012-07-01	Binsztok et al.	Applicant
US2012/0221553(A1)	2012-08-01	Wittmer et al.	Applicant
US2012/0323888(A1)	2012-12-01	Osann, Jr.	Applicant
US2013/0057551(A1)	2013-03-01	Ebert et al.	Applicant
US2013/0096968(A1)	2013-04-01	Van Pelt et al.	Applicant
US2013/0096988(A1)	2013-04-01	Grossman et al.	Applicant
US2013/0097130(A1)	2013-04-01	Bingol et al.	Applicant
US2013/0124193(A1)	2013-05-01	Holmberg	Applicant
US2013/0132348(A1)	2013-05-01	Garrod	Applicant
US2013/0151453(A1)	2013-06-01	Bhanot et al.	Applicant
US2013/0166480(A1)	2013-06-01	Popescu et al.	Applicant
US2013/0185307(A1)	2013-07-01	El-Yaniv et al.	Applicant
US2013/0226944(A1)	2013-08-01	Baid et al.	Applicant
US2013/0238616(A1)	2013-09-01	Rose et al.	Applicant
US2013/0246170(A1)	2013-09-01	Gross et al.	Applicant
US2013/0246537(A1)	2013-09-01	Gaddala	Applicant
US2013/0263019(A1)	2013-10-01	Castellanos et al.	Applicant
US2013/0282696(A1)	2013-10-01	John et al.	Applicant
US2013/0290825(A1)	2013-10-01	Arndt et al.	Applicant
US2013/0297619(A1)	2013-11-01	Chandrasekaran et al.	Applicant
US2014/0006404(A1)	2014-01-01	McGrew et al.	Applicant
US2014/0012796(A1)	2014-01-01	Petersen et al.	Applicant
US2014/0040371(A1)	2014-02-01	Gurevich et al.	Applicant
US2014/0068487(A1)	2014-03-01	Steiger et al.	Applicant
US2014/0095509(A1)	2014-04-01	Patton	Applicant
US2014/0108074(A1)	2014-04-01	Miller et al.	Applicant
US2014/0108380(A1)	2014-04-01	Gotz et al.	Applicant
US2014/0108985(A1)	2014-04-01	Scott et al.	Applicant
US2014/0123279(A1)	2014-05-01	Bishop et al.	Applicant
US2014/0129936(A1)	2014-05-01	Richards	Applicant
US2014/0136285(A1)	2014-05-01	Carvalho	Applicant
US2014/0143009(A1)	2014-05-01	Brice et al.	Applicant
US2014/0157172(A1)	2014-06-01	Peery et al.	Applicant
US2014/0164502(A1)	2014-06-01	Khodorenko et al.	Applicant
US2014/0189536(A1)	2014-07-01	Lange et al.	Applicant
US2014/0195515(A1)	2014-07-01	Baker et al.	Applicant
US2014/0222793(A1)	2014-08-01	Sadkin et al.	Applicant
US2014/0344230(A1)	2014-11-01	Krause et al.	Applicant
US2014/0358829(A1)	2014-12-01	Hurwitz	Applicant
US2014/0366132(A1)	2014-12-01	Stiansen et al.	Applicant
US2015/0012509(A1)	2015-01-01	Kirn	Applicant
US2015/0046481(A1)	2015-02-01	Elliot	Applicant
US2015/0100897(A1)	2015-04-01	Sun et al.	Applicant
US2015/0106379(A1)	2015-04-01	Elliot et al.	Applicant
US2015/0188872(A1)	2015-07-01	White	Applicant
CN102546446	2012-07-01		Applicant
CN103167093	2013-06-01		Applicant
CN102054015	2014-05-01		Applicant
DE102014204827	2014-09-01		Applicant
DE102014204830	2014-09-01		Applicant
DE102014204834	2014-09-01		Applicant
DE102014213036	2015-01-01		Applicant
EP1672527	2006-06-01		Applicant
EP2778913	2014-09-01		Applicant
EP2778914	2014-09-01		Applicant
EP2858018	2015-04-01		Applicant
EP2869211	2015-05-01		Applicant
EP2889814	2015-07-01		Applicant
EP2892197	2015-07-01		Applicant
GB2366498	2002-03-01		Applicant
GB2513472	2014-10-01		Applicant
GB2513721	2014-11-01		Applicant
GB2517582	2015-02-01		Applicant
NL2013134	2015-01-01		Applicant
WO1/25906	2001-04-01		Applicant
WO2009/051987	2009-04-01		Applicant
WO2010/030914	2010-03-01		Applicant
WO2010/030919	2010-03-01		Applicant
WO2012/119008	2012-09-01		Applicant

Non-Patent Literature (134)

Wang et al, “Research on a clustering data de-duplication mechanism based on Bloom filter”, IEEE 2010, 5 pages.Examiner
Abbey, Kristen, “Review of Google Docs,” May 1, 2007, pp. 2.Applicant
APPACTS, “Smart Thinking for Super Apps,” <http://www.appacts.com> Printed Jul. 18, 2013 in 4 pages.Applicant
APSALAR, “Data Powered Mobile Advertising,” “Free Mobile App Analytics” and various analytics related screen shots <http://apsalar.com> Printed Jul. 18, 2013 in 8 pages.Applicant
“A Real-World Problem of Matching Records,” Nov. 2006, <http://grupoweb.upf.es/bd-web/slides/ullman.pdf> pp. 1-16.Applicant
“A Tour of Pinboard,” <http://pinboard.in/tour> as printed May 15, 2014 in 6 pages.Applicant
Brandel, Mary, “Data Loss Prevention Dos and Don'ts,” <http://web.archive.org/web/20080724024847/http://www.csoonline.com/article/221272/ Dos—and—Don—ts—for—Data—Loss—Prevention>, Oct. 10, 2007, pp. 5.Applicant
Bluttman et al., “Excel Formulas and Functions for Dummies,” 2005, Wiley Publishing, Inc., pp. 280, 284-286.Applicant
Capptain—Pilot Your Apps, <http://www.capptain.com> Printed Jul. 18, 2013 in 6 pages.Applicant
Conner, Nancy, Google Apps: The Missing Manual, “Remove a Published Document or Blog Post,” Sharing and Collaborating on Blog Post, May 1, 2008 (15 pages).Applicant
Countly Mobile Analytics, <http://count.ly/> Printed Jul. 18, 2013 in 9 pages.Applicant
Delicious, <http://delicious.com/> as printed May 15, 2014 in 1 page.Applicant
DISTIMO—App Analytics, <http://www.distimo.com/app-analytics> Printed Jul. 18, 2013 in 5 pages.Applicant
“E-MailRelay,” <http://web.archive.org/web/20080821175021/http://emailrelay.sourceforge.net/> Aug. 21, 2008, pp. 2.Applicant
Flurry Analytics, <http://www.flurry.com/> Printed Jul. 18, 2013 in 14 pages.Applicant
Galliford, Miles, “Snag It Versus Free Screen Capture Software: Critical Tools for Website Owners,” <http://www.subhub.com/articles/free-screen-capture-software>, Mar. 27, 2008, pp. 11.Applicant
Google Analytics Official Website—Web Analytics & Reporting, <http://www.google.com/analytics.index.html> Printed Jul. 18, 2013 in 22 pages.Applicant
“GrabUp—What a Timesaver!” <http://atlchris.com/191/grabup/>, Aug. 11, 2008, pp. 3.Applicant
Gu et al., “Record Linkage: Current Practice and Future Directions,” Jan. 15, 2004, pp. 32.Applicant
Hansen et al. “Analyzing Social Media Networks with NodeXL: Insights from a Connected World”, Chapter 4, pp. 53-67 and Chapter 10, pp. 143-164, published Sep. 2010.Applicant
Hua et al., “A Multi-attribute Data Structure with Parallel Bloom Filters for Network Services” HiPC 2006, LNCS 4297, pp. 277-288, 2006.Applicant
JetScreenshot.com, “Share Screenshots via Internet in Seconds,” <http://web.archive.org/web/20130807164204/http://www.jetscreenshot.com/>, Aug. 7, 2013, pp. 1.Applicant
Johnson, Maggie “Introduction to YACC and Bison”, Handout 13, Jul. 8, 2005 (11 pages).Applicant
Keylines.com, “An Introduction to KeyLines and Network Visualization,” Mar. 2014, <http://keylines.com/wp-content/uploads/2014/03/KeyLines-White-Paper.pdf> downloaded May 12, 2014 in 8 pages.Applicant
Keylines.com, “KeyLines Datasheet,” Mar. 2014, <http://keylines.com/wp-content/uploads/2014/03/KeyLines-datasheet.pdf> downloaded May 12, 2014 in 2 pages.Applicant
Keylines.com, “Visualizing Threats: Improved Cyber Security Through Network Visualization,” Apr. 2014, <http://keylines.com/wp-content/uploads/2014/04/Visualizing-Threats1.pdf> downloaded May 12, 2014 in 10 pages.Applicant
Kontagent Mobile Analytics, <http://www.kontagent.com/> Printed Jul. 18, 2013 in 9 pages.Applicant
Kwout, <http://web.archive.org/web/20080905132448/http://www.kwout.com/> Sep. 5, 2008, pp. 2.Applicant
Lim et al., “Resolving Attribute Incompatibility in Database Integration: An Evidential Reasoning Approach,” Department of Computer Science, University of Minnesota, 1994, <http://reference.kfupm.edu.sa/content/r/e/resolving—attribute—incompatibility—in—d—531691.pdf> pp. 1-10.Applicant
Litwin et al., “Multidatabase Interoperability,” IEEE Computer, Dec. 1986, vol. 19, No. 12, http://www.lamsade.dauphine.fr/˜litwin/mdb-interoperability.pdf, pp. 10-18.Applicant
Localytics—Mobile App Marketing & Analytics, <http://www.localytics.com/> Printed Jul. 18, 2013 in 12 pages.Applicant
Manno et al., “Introducing Collaboration in Single-user Applications through the Centralized Control Architecture,” 2010, pp. 10.Applicant
Microsoft, “Registering an Application to a URI Scheme,” <http://msdn.microsoft.com/en-us/library/aa767914.aspx>, printed Apr. 4, 2009 in 4 pages.Applicant
Microsoft, “Using the Clipboard,” <http://msdn.microsoft.com/en-us/library/ms649016.aspx>, printed Jun. 8, 2009 in 20 pages.Applicant
Microsoft Windows, “Microsoft Windows Version 2002 Print Out 2,” 2002, pp. 1-6.Applicant
Mixpanel—Mobile Analytics, <https://mixpanel.com/> Printed Jul. 18, 2013 in 13 pages.Applicant
Nadeau et al., “A Survey of Named Entity Recognition and Classification,” Jan. 15, 2004, pp. 20.Applicant
Nin et al., “On the Use of Semantic Blocking Techniques for Data Cleansing and Integration,” 11th International Database Engineering and Applications Symposium, 2007, pp. 9.Applicant
Nitro, “Trick: How to Capture a Screenshot as PDF, Annotate, Then Share It,” <http://blog.nitropdf.com/2008/03/04/trick-how-to-capture-a-screenshot-as-pdf-annotate-it-then-share/>, Mar. 4, 2008, pp. 2.Applicant
Online Tech Tips, “Clip2Net—Share files, folders and screenshots easily,” <http://www.online-tech-tips.com/free-software-downloads/share-files-folders-screenshots/>, Apr. 2, 2008, pp. 5.Applicant
Open Web Analytics (OWA), <http://www.openwebanalytics.com/> Printed Jul. 19, 2013 in 5 pages.Applicant
O'Reilly.com, <http://oreilly.com/digitalmedia/2006/01/01/mac-os-x-screenshot-secrets.html> published Jan. 1, 2006 in 10 pages.Applicant
Piwik—Free Web Analytics Software. <http://piwik.org/> Printed Jul. 19, 2013 in18 pages.Applicant
Qiang et al., “A Mutual-Information-Based Approach to Entity Reconciliation in Heterogeneous Databases,” Proceedings of 2008 International Conference on Computer Science & Software Engineering, IEEE Computer Society, New York, NY, Dec. 12-14, 2008, pp. 666-669.Applicant
Schroder, Stan, “15 Ways to Create Website Screenshots,” <http://mashable.com/2007/08/24/web-screenshots/>, Aug. 24, 2007, pp. 2.Applicant
Sekine et al., “Definition, Dictionaries and Tagger for Extended Named Entity Hierarchy,” May 2004, pp. 1977-1980.Applicant
Snag It, “SnagIt Online Help Guide,” <http://download.techsmith.com/snagit/docs/onlinehelp/enu/snagit—help.pdf>, TechSmith Corp., Version 8.1, printed Feb. 7, 2007, pp. 284.Applicant
SnagIt, “SnagIt 8.1.0 Print Out,” Software release date Jun. 15, 2006, pp. 6.Applicant
SnagIt, “SnagIt 8.1.0 Print Out 2,” Software release date Jun. 15, 2006, pp. 1-3.Applicant
StatCounter—Free Invisible Web Tracker, Hit Counter and Web Stats, <http://statcounter.com/> Printed Jul. 19, 2013 in 17 pages.Applicant
TestFlight—Beta Testing on the Fly, <http://testflightapp.com/> Printed Jul. 18, 2013 in 3 pages.Applicant
trak.io, <http://trak.io/> printed Jul. 18, 2013 in 3 pages.Applicant
UserMetrix, <http://usermetrix.com/android-analytics> printed Jul. 18, 2013 in 3 pages.Applicant
Vose et al., “Help File for ModelRisk Version 5,” 2007, Vose Software, pp. 349-353. [Uploaded in 2 Parts].Applicant
Warren, Christina, “TUAW Faceoff: Screenshot apps on the firing line,” <http://www.tuaw.com/2008/05/05/tuaw-faceoff-screenshot-apps-on-the-firing-line/>, May 5, 2008, pp. 11.Applicant
Zhao et al., “Entity Matching Across Heterogeneous Data Sources: An Approach Based on Constrained Cascade Generalization,” Data & Knowledge Engineering, vol. 66, No. 3, Sep. 2008, pp. 368-381.Applicant
Official Communication for New Zealand Patent Application No. 622389 dated Mar. 20, 2014.Applicant
Official Communication for New Zealand Patent Application No. 622404 dated Mar. 20, 2014.Applicant
Extended European Search Report for European Patent Application No. 14158958.0 dated Jun. 3, 2014.Applicant
Extended European Search Report for European Patent Application No. 14158977.0 dated Jun. 10, 2014.Applicant
European Search Report for European Patent Application No. 09813700.3 dated Apr. 3, 2014.Applicant
Official Communication for New Zealand Patent Application No. 622439 dated Mar. 24, 2014.Applicant
Official Communication for New Zealand Patent Application No. 622439 dated Jun. 6, 2014.Applicant
Official Communication for New Zealand Patent Application No. 622473 dated Mar. 27, 2014.Applicant
Official Communication for New Zealand Patent Application No. 622473 dated Jun. 19, 2014.Applicant
Official Communication for New Zealand Patent Application No. 628161 dated Aug. 25, 2014.Applicant
Official Communication for United Kingdom Patent Application No. 1404499.4 dated Aug. 20, 2014.Applicant
Official Communication for United Kingdom Patent Application No. 1404499.4 dated Sep. 29, 2014.Applicant
Official Communication for United Kingdom Patent Application No. 1404486.1 dated Aug. 27, 2014.Applicant
Official Communication for United Kingdom Patent Application No. 1404489.5 dated Aug. 27, 2014.Applicant
Official Communication for United Kingdom Patent Application No. 1404489.5 dated Oct. 6, 2014.Applicant
Official Communication for U.S. Appl. No. 14/304,741 dated Aug. 6, 2014.Applicant
Official Communication for U.S. Appl. No. 14/225,160 dated Jul. 29, 2014.Applicant
Official Communication for U.S. Appl. No. 14/225,084 dated Sep. 2, 2014.Applicant
Official Communication for U.S. Appl. No. 14/225,006 dated Sep. 10, 2014.Applicant
Official Communication for U.S. Appl. No. 14/451,221 dated Oct. 21, 2014.Applicant
Official Communication for U.S. Appl. No. 14/463,615 dated Nov. 13, 2014.Applicant
Adams et al., “Worklets: A Service-Oriented Implementation of Dynamic Flexibility in Workflows,” R. Meersman, Z. Tari et al. (Eds.): OTM 2006, LNCS, 4275, pp. 291-308, 2006.Applicant
AMNET, “5 Great Tools for Visualizing Your Twitter Followers,” posted Aug. 4, 2010, http://www.amnetblog.com/component/content/article/115-5-grate-tools-for-visualizing-your-twitter-followers.html.Applicant
Celik, Tantek, “CSS Basic User Interface Module Level 3 (CSS3 UI),” Section 8 Resizing and Overflow, Jan. 17, 2012, retrieved from internet http://www.w3.org/TR/2012/WD-css3-ui-20120117/#resizing-amp-overflow retrieved on May 18, 2015.Applicant
Cohn et al., “Semi-supervised Clustering with User Feedback,” Constrained Clustering: Advances in Algorithms, Theory, and Applications 4.1, 2003, pp. 17-32.Applicant
Gorr et al., “Crime Hot Spot Forecasting: Modeling and Comparative Evaluation,” Grant 98-IJ-CX-K005, May 6, 2002, 37 pages.Applicant
“HunchLab: Heat Map and Kernel Density Calculation for Crime Analysis,” Azavea Journal, printed from www.azavea.com/blogs/newsletter/v4i4/kernel-density-capabilities-added-to-hunchlab/ on Sep. 9, 2014, 2 pages.Applicant
Johnson, Steve, “Access 2013 on demand,” Access 2013 on Demand, May 9, 2013, Que Publishing.Applicant
Pythagoras Communications Ltd., “Microsoft CRM Duplicate Detection,” Sep. 13, 2011, https://www.youtube.com/watch?v=j-7Qis0D0Kc.Applicant
“Refresh CSS Ellipsis When Resizing Container—Stack Overflow,” Jul. 31, 2013, retrieved from internet http://stackoverflow.com/questions/17964681/refresh-css-ellipsis-when-resizing-container, retrieved on May 18, 2015.Applicant
Sigrist et al., “Prosite, a Protein Domain Database for Functional Characterization and Annotation,” Nucleic Acids Research 38.Suppl 1, 2010, pp. D161-D166.Applicant
Valentini et al., “Ensembles of Learning Machines,” M. Marinaro and R. Tagliaferri (Eds.): WIRN VIETRI 2002, LNCS 2486, pp. 3-20.Applicant
Notice of Allowance for U.S. Appl. No. 14/265,637 dated Feb. 13, 2015.Applicant
Notice of Allowance for U.S. Appl. No. 14/479,863 dated Mar. 31, 2015.Applicant
Notice of Allowance for U.S. Appl. No. 14/304,741 dated Apr. 7, 2015.Applicant
Notice of Allowance for U.S. Appl. No. 14/225,084 dated May 4, 2015.Applicant
Notice of Allowance for U.S. Appl. No. 14/319,161 dated May 4, 2015.Applicant
Official Communication for U.S. Appl. No. 14/225,160 dated Oct. 22, 2014.Applicant
Official Communication for U.S. Appl. No. 13/827,491 dated Dec. 1, 2014.Applicant
Official Communication for U.S. Appl. No. 14/479,863 dated Dec. 26, 2014.Applicant
Official Communication for U.S. Appl. No. 14/319,161 dated Jan. 23, 2015.Applicant
Official Communication for U.S. Appl. No. 14/483,527 dated Jan. 28, 2015.Applicant
Official Communication for U.S. Appl. No. 14/463,615 dated Jan. 28, 2015.Applicant
Official Communication for U.S. Appl. No. 14/225,160 dated Feb. 11, 2015.Applicant
Official Communication for U.S. Appl. No. 14/225,084 dated Feb. 20, 2015.Applicant
Official Communication for U.S. Appl. No. 14/225,006 dated Feb. 27, 2015.Applicant
Official Communication for U.S. Appl. No. 14/304,741 dated Mar. 3, 2015.Applicant
Official Communication for U.S. Appl. No. 14/571,098 dated Mar. 11, 2015.Applicant
Official Communication for U.S. Appl. No. 13/669,274 dated May 6, 2015.Applicant
Official Communication for U.S. Appl. No. 14/225,160 dated May 20, 2015.Applicant
Official Communication for U.S. Appl. No. 14/463,615 dated May 21, 2015.Applicant
Official Communication for U.S. Appl. No. 12/556,307 dated Jun. 9, 2015.Applicant
Official Communication for U.S. Appl. No. 14/014,313 dated Jun. 18, 2015.Applicant
Official Communication for U.S. Appl. No. 13/827,491 dated Jun. 22, 2015.Applicant
Official Communication for U.S. Appl. No. 14/483,527 dated Jun. 22, 2015.Applicant
Official Communication for U.S. Appl. No. 12/556,321 dated Jul. 7, 2015.Applicant
Official Communication for U.S. Appl. No. 14/552,336 dated Jul. 20, 2015.Applicant
Official Communication for U.S. Appl. No. 14/676,621 dated Jul. 30, 2015.Applicant
Official Communication for U.S. Appl. No. 14/571,098 dated Aug. 5, 2015.Applicant
Official Communication for U.S. Appl. No. 14/225,160 dated Aug. 12, 2015.Applicant
Official Communication for U.S. Appl. No. 13/669,274 dated Aug. 26, 2015.Applicant
Official Communication for U.S. Appl. No. 14/225,006 dated Sep. 2, 2015.Applicant
Official Communication for U.S. Appl. No. 14/631,633 dated Sep. 10, 2015.Applicant
Official Communication for U.S. Appl. No. 14/463,615 dated Sep. 10, 2015.Applicant
Official Communication for Australian Patent Application No. 2014201506 dated Feb. 27, 2015.Applicant
Official Communication for Australian Patent Application No. 2014201507 dated Feb. 27, 2015.Applicant
Official Communication for Australian Patent Application No. 2014203669 dated May 29, 2015.Applicant
Official Communication for European Patent Application No. 14187996.5 dated Feb. 12, 2015.Applicant
Official Communication for European Patent Application No. 14158977.0 dated Apr. 16, 2015.Applicant
Official Communication for European Patent Application No. 14158958.0 dated Apr. 16, 2015.Applicant
Official Communication for European Patent Application No. 14200298.9 dated May 13, 2015.Applicant
Official Communication for European Patent Application No. 14191540.5 dated May 27, 2015.Applicant
Official Communication for Great Britain Patent Application No. 1411984.6 dated Dec. 22, 2014.Applicant
Official Communication for Great Britain Patent Application No. 1404486.1 dated May 21, 2015.Applicant
Official Communication for Great Britain Patent Application No. 1404489.5 dated May 21, 2015.Applicant
Official Communication for Great Britain Patent Application No. 1404499.4 dated Jun. 11, 2015.Applicant
Official Communication for Netherlands Patent Application No. 2013134 dated Apr. 20, 2015.Applicant
Official Communication for New Zealand Patent Application No. 622513 dated Apr. 3, 2014.Applicant

Abstract