Patent Grant
7991797
This application is related to the following U.S. Applications all of which are incorporated by reference herein:
1. Field of the Invention
The disclosed embodiments relate generally to information storage. More particularly, the disclosed embodiments relate to maintaining consistent references across differing versions of a collection of data.
2. Description of Related Art
In a large collection of information about objects, it is frequently desirable to collect new information on an ongoing basis. When new information is collected, the new information sometimes supplements or supersedes information already stored in the information collection. To facilitate the effective retrieval of information, object identifiers are used to refer to particular objects in the collection of information. Ideally, an object identifier can be used to retrieve all of the information associated with an object regardless of when or how that information was originally collected.
Assigning a new object identifier to newly collected information results in an object identifier persistence problem when the newly collected information describes an object already in the collection. If the old object identifier is used to retrieve the information about an object, the newly collected information will not be retrieved, as the newly collected information is only associated with the new object identifier. Thus, the old object identifier fails to persist—that is, the old object identifier cannot be relied upon to accurately and completely retrieve all the available information related to its corresponding object.
Therefore, what is needed is a method for making identifiers persistent while incorporating new information into a collection.
The invention is a system and method for making identifiers persistent when new information is incorporated into a collection. According to one embodiment of the present invention, an object entity normalizer compares objects from a first collection to objects from a second collection. If an object from the first collection matches an object from the second collection, the first object is merged into the second object. An object matches another object, for example, if both objects have substantially similar facts, or if both objects refer to the same entity.
According to one embodiment of the present invention, a first collection of objects is compared to a second collection of objects. If an object in the first collection “matches” an object in the second collection, a reference is added to the object in the first collection referring to the object in the second collection, allowing the identifier to persist in both collections of objects. Additionally, according to one embodiment of the present invention, the data (or “facts”) associated with the object from the first collection are moved to the object from the second collection. In this way, data associated with matching objects is combined between two collections of objects and object identifiers are made persistent.
a)-2(d) are block diagrams illustrating a data structure for facts within a repository of
e) is a block diagram illustrating an alternate data structure for facts and objects in accordance with preferred embodiments of the invention.
a) is an illustration of an object ID persistence problem caused by repeated builds.
b) is an illustration of the generation of two collections of information with ID persistence maintained by a janitor, according to one embodiment of the present invention.
c) is an illustration of the generation of two collections of information with ID persistence maintained by a janitor, according to another embodiment of the present invention.
d) is an example of how ID persistence can be achieved across collections of objects by use of a janitor, according to one embodiment of the present invention.
a)-5(c) illustrate an example of maintaining persistent identifiers, according to several of the various embodiment of the present invention.
a)-8(d) show examples of different objects and how they might be classified by the heuristic comparison function, according to one embodiment of the present invention.
Embodiments of the present invention are now described with reference to the figures where like reference numbers indicate identical or functionally similar elements.
Document hosts 102 store documents and provide access to documents. A document is comprised of any machine-readable data including any combination of text, graphics, multimedia content, etc. A document may be encoded in a markup language, such as Hypertext Markup Language (HTML), i.e., a web page, in a interpreted language (e.g., JavaScript) or in any other computer readable or executable format. A document can include one or more hyperlinks to other documents. A typical document will include one or more facts within its content. A document stored in a document host 102 may be located and/or identified by a Uniform Resource Locator (URL), or Web address, or any other appropriate form of identification and/or location. A document host 102 is implemented by a computer system, and typically includes a server adapted to communicate over the network 104 via networking protocols (e.g., TCP/IP), as well as application and presentation protocols (e.g., HTTP, HTML, SOAP, D-HTML, Java). The documents stored by a host 102 are typically held in a file directory, a database, or other data repository. A host 102 can be implemented in any computing device (e.g., from a PDA or personal computer, a workstation, mini-computer, or mainframe, to a cluster or grid of computers), as well as in any processor architecture or operating system.
Janitors 110 operate to process facts extracted by importer 108. This processing can include but is not limited to, data cleansing, object merging, and fact induction. In one embodiment, there are a number of different janitors 110 that perform different types of data management operations on the facts. For example, one janitor 110 may traverse some set of facts in the repository 115 to find duplicate facts (that is, facts that convey the same factual information) and merge them. Another janitor 110 may also normalize facts into standard formats. Another janitor 110 may also remove unwanted facts from repository 115, such as facts related to pornographic content. Other types of janitors 110 may be implemented, depending on the types of data management functions desired, such as translation, compression, spelling or grammar correction, and the like.
Various janitors 110 act on facts to normalize attribute names, and values and delete duplicate and near-duplicate facts so an object does not have redundant information. For example, we might find on one page that Britney Spears' birthday is “12/2/1981” while on another page that her date of birth is “December 2, 1981.” Birthday and Date of Birth might both be rewritten as Birthdate by one janitor and then another janitor might notice that 12/2/1981 and December 2, 1981 are different forms of the same date. It would choose the preferred form, remove the other fact and combine the source lists for the two facts. As a result when you look at the source pages for this fact, on some you'll find an exact match of the fact and on others text that is considered to be synonymous with the fact.
Build engine 112 builds and manages the repository 115. Service engine 114 is an interface for querying the repository 115. Service engine 114's main function is to process queries, score matching objects, and return them to the caller but it is also used by janitor 110.
Repository 115 stores factual information extracted from a plurality of documents that are located on document hosts 102. A document from which a particular fact may be extracted is a source document (or “source”) of that particular fact. In other words, a source of a fact includes that fact (or a synonymous fact) within its contents.
Repository 115 contains one or more facts. In one embodiment, each fact is associated with exactly one object. One implementation for this association includes in each fact an object ID that uniquely identifies the object of the association. In this manner, any number of facts may be associated with an individual object, by including the object ID for that object in the facts. In one embodiment, objects themselves are not physically stored in the repository 115, but rather are defined by the set or group of facts with the same associated object ID, as described below. Further details about facts in repository 115 are described below, in relation to
It should be appreciated that in practice at least some of the components of the data processing system 106 will be distributed over multiple computers, communicating over a network. For example, repository 115 may be deployed over multiple servers. As another example, the janitors 110 may be located on any number of different computers. For convenience of explanation, however, the components of the data processing system 106 are discussed as though they were implemented on a single computer.
In another embodiment, some or all of document hosts 102 are located on data processing system 106 instead of being coupled to data processing system 106 by a network. For example, importer 108 may import facts from a database that is a part of or associated with data processing system 106.
a) shows an example format of a data structure for facts within repository 115, according to some embodiments of the invention. As described above, the repository 115 includes facts 204. Each fact 204 includes a unique identifier for that fact, such as a fact ID 210. Each fact 204 includes at least an attribute 212 and a value 214. For example, a fact associated with an object representing George Washington may include an attribute of “date of birth” and a value of “February 22, 1732.” In one embodiment, all facts are stored as alphanumeric characters since they are extracted from web pages. In another embodiment, facts also can store binary data values. Other embodiments, however, may store fact values as mixed types, or in encoded formats.
As described above, each fact is associated with an object ID 209 that identifies the object that the fact describes. Thus, each fact that is associated with a same entity (such as George Washington), will have the same object ID 209. In one embodiment, objects are not stored as separate data entities in memory. In this embodiment, the facts associated with an object contain the same object ID, but no physical object exists. In another embodiment, objects are stored as data entities in memory, and include references (for example, pointers or IDs) to the facts associated with the object. The logical data structure of a fact can take various forms; in general, a fact is represented by a tuple that includes a fact ID, an attribute, a value, and an object ID. The storage implementation of a fact can be in any underlying physical data structure.
b) shows an example of facts having respective fact IDs of 10, 20, and 30 in repository 115. Facts 10 and 20 are associated with an object identified by object ID “1.” Fact 10 has an attribute of “Name” and a value of “China.” Fact 20 has an attribute of “Category” and a value of “Country.” Thus, the object identified by object ID “1” has a name fact 205 with a value of “China” and a category fact 206 with a value of “Country.” Fact 30208 has an attribute of “Property” and a value of “Bill Clinton was the 42nd President of the United States from 1993 to 2001.” Thus, the object identified by object ID “2” has a property fact with a fact ID of 30 and a value of “Bill Clinton was the 42nd President of the United States from 1993 to 2001.” In the illustrated embodiment, each fact has one attribute and one value. The number of facts associated with an object is not limited; thus while only two facts are shown for the “China” object, in practice there may be dozens, even hundreds of facts associated with a given object. Also, the value fields of a fact need not be limited in size or content. For example, a fact about the economy of “China” with an attribute of “Economy” would have a value including several paragraphs of text, numbers, perhaps even tables of figures. This content can be formatted, for example, in a markup language. For example, a fact having an attribute “original html” might have a value of the original html text taken from the source web page.
Also, while the illustration of
c) shows an example object reference table 210 that is used in some embodiments. Not all embodiments include an object reference table. The object reference table 210 functions to efficiently maintain the associations between object IDs and fact IDs. In the absence of an object reference table 210, it is also possible to find all facts for a given object ID by querying the repository to find all facts with a particular object ID. While
d) shows an example of a data structure for facts within repository 115, according to some embodiments of the invention showing an extended format of facts. In this example, the fields include an object reference link 216 to another object. The object reference link 216 can be an object ID of another object in the repository 115, or a reference to the location (e.g., table row) for the object in the object reference table 210. The object reference link 216 allows facts to have as values other objects. For example, for an object “United States,” there may be a fact with the attribute of “president” and the value of “George W. Bush,” with “George W. Bush” being an object having its own facts in repository 115. In some embodiments, the value field 214 stores the name of the linked object and the link 216 stores the object identifier of the linked object. Thus, this “president” fact would include the value 214 of “George W. Bush”, and object reference link 216 that contains the object ID for the for “George W. Bush” object. In some other embodiments, facts 204 do not include a link field 216 because the value 214 of a fact 204 may store a link to another object.
Each fact 204 also may include one or more metrics 218. A metric provides an indication of the some quality of the fact. In some embodiments, the metrics include a confidence level and an importance level. The confidence level indicates the likelihood that the fact is correct. The importance level indicates the relevance of the fact to the object, compared to other facts for the same object. The importance level may optionally be viewed as a measure of how vital a fact is to an understanding of the entity or concept represented by the object.
Each fact 204 includes a list of one or more sources 220 that include the fact and from which the fact was extracted. Each source may be identified by a Uniform Resource Locator (URL), or Web address, or any other appropriate form of identification and/or location, such as a unique document identifier.
The facts illustrated in
Some embodiments include one or more specialized facts, such as a name fact 207 and a property fact 208. A name fact 207 is a fact that conveys a name for the entity or concept represented by the object ID. A name fact 207 includes an attribute 224 of “name” and a value, which is the name of the object. For example, for an object representing the country Spain, a name fact would have the value “Spain.” A name fact 207, being a special instance of a general fact 204, includes the same fields as any other fact 204; it has an attribute, a value, a fact ID, metrics, sources, etc. The attribute 224 of a name fact 207 indicates that the fact is a name fact, and the value is the actual name. The name may be a string of characters. An object ID may have one or more associated name facts, as many entities or concepts can have more than one name. For example, an object ID representing Spain may have associated name facts conveying the country's common name “Spain” and the official name “Kingdom of Spain.” As another example, an object ID representing the U.S. Patent and Trademark Office may have associated name facts conveying the agency's acronyms “PTO” and “USPTO” as well as the official name “United States Patent and Trademark Office.” If an object does have more than one associated name fact, one of the name facts may be designated as a primary name and other name facts may be designated as secondary names, either implicitly or explicitly.
A property fact 208 is a fact that conveys a statement about the entity or concept represented by the object ID. Property facts are generally used for summary information about an object. A property fact 208, being a special instance of a general fact 204, also includes the same parameters (such as attribute, value, fact ID, etc.) as other facts 204. The attribute field 226 of a property fact 208 indicates that the fact is a property fact (e.g., attribute is “property”) and the value is a string of text that conveys the statement of interest. For example, for the object ID representing Bill Clinton, the value of a property fact may be the text string “Bill Clinton was the 42nd President of the United States from 1993 to 2001.” Some object IDs may have one or more associated property facts while other objects may have no associated property facts. It should be appreciated that the data structures shown in
As described previously, a collection of facts is associated with an object ID of an object. An object may become a null or empty object when facts are disassociated from the object. A null object can arise in a number of different ways. One type of null object is an object that has had all of its facts (including name facts) removed, leaving no facts associated with its object ID. Another type of null object is an object that has all of its associated facts other than name facts removed, leaving only its name fact(s). Alternatively, the object may be a null object only if all of its associated name facts are removed. A null object represents an entity or concept for which the data processing system 106 has no factual information and, as far as the data processing system 106 is concerned, does not exist. In some embodiments, facts of a null object may be left in the repository 115, but have their object ID values cleared (or have their importance to a negative value). However, the facts of the null object are treated as if they were removed from the repository 115. In some other embodiments, facts of null objects are physically removed from repository 115.
e) is a block diagram illustrating an alternate data structure 290 for facts and objects in accordance with preferred embodiments of the invention. In this data structure, an object 290 contains an object ID 292 and references or points to facts 294. Each fact includes a fact ID 295, an attribute 297, and a value 299. In this embodiment, an object 290 actually exists in memory 107.
It should be understood that the following discussion mentions “objects.” In one embodiment of the invention, objects are conceptual and are physically embodied as object IDs associated with one or more facts. Thus, while the discussion below mentions “objects,” it will be understood that actually, each object includes one or more facts in repository 115, each fact having an object ID for the object. In other embodiments, objects are physically embodied and can be discussed as physical entities. The discussion below can be used in either for conceptual objects or physical objects.
a) is an illustration of an object persistence problem caused by repeated builds. Build A 301 illustrates a first build of the collection of data. The importer 302, janitor 304, build engine 306, and service engine 308 may function as previously described herein with reference to
Build B 311 illustrates a second build of the collection of data. The importer 312 may function as previously described herein with reference to
Without a mechanism for maintaining object ID persistence, subsequent builds may not be able to capitalize on the information stored in prior builds. The service engine 308 may not be able to respond to requests identified by object IDs in the object Repository B 320, and the service engine 318 may not be able to respond to requests identified by object IDs in the Repository A 310. Furthermore, in the case in which object Repository B 320 stores updated information with respect to the information stored in object Repository A 310, requests for object IDs previously stored in the object Repository A 310 may not return the most complete and accurate information possible. It is desirable for information relating to an entity to be accessible whether it exists as a result of the first build or as a result of the second build.
b) is an illustration of the generation of two collections of information with ID persistence maintained by a janitor, according to one embodiment of the present invention. Build A 301 illustrates a first build of the collection of data. The importer 302, janitor 304, build engine 306, and service engine 308 may function as previously described herein with reference to
Build C 321 illustrates a second build of the collection of data. The importer 322 may function as previously described herein with reference to
The janitor 324 includes an ID persistence janitor. The build engine 326 may function as previously described herein with reference to
According to one embodiment of the present invention, the ID persistence janitor operates on the objects that result from the importer 322 (from Build C) and the objects contained in the Repository A 310 (from Build A) to provide persistent object IDs across builds for those objects that refer to the same entity. According to one embodiment of the present invention, the ID persistence janitor may access the objects contained in Repository A 310 through the service engine 308. By providing persistent object IDs across builds for objects referring to the same entity, the ID persistence janitor allows internal or external references to object IDs in either new or preexisting collection of objects to be successfully serviced. For example, the service engine 328 may be able to respond to requests identified by object IDs previously contained in the object Repository A 310 and to requests identified by object IDs in the Repository C 330. Object IDs previously contained in either repository will retrieve the most complete and accurate information available for the entity to which that object ID corresponds. Furthermore, as one build may have operated on documents from a first source and the other build may have operated on documents from a second source, the operation of the ID persistence janitor may be beneficial for combining information from a plurality of sources. Such combination may be useful, for example, for verifying or supplementing information to gain information more accurate or exhaustive than information available from any single source.
For the purposes of illustration, the output of the first build (Repository A 310) is shown as being distinct from the output of the second build (Repository C 330). In practice, these repositories may be implemented using a shared data store, or they may be implemented as a single repository, such that the data in Repository A are stored alongside the data in Repository B. The method of the ID persistence janitor is described in greater detail herein with reference to
c) is an illustration of the generation of two collections of information with ID persistence maintained by a janitor, according to another embodiment of the present invention. The janitor 325 includes an ID persistence janitor. The ID persistence janitor receives objects from the Repository A 310 from the service engine 308 and objects from the Repository C 330 from the service engine 328. The ID persistence janitor may then make modifications to the object in the Repository C 330. According to one embodiment of the present invention, the ID janitor may store its results in a new repository, for example, a Repository D not shown.
d) is an example of how ID persistence can be achieved across collections of objects by use of a janitor, according to one embodiment of the present invention. In FIG. 3(d) objects are depicted as circles or squares, and references to objects are depicted as arrows. According to one embodiment of the present invention, references to objects may be implemented as object reference links, for example as described herein with reference to
A new collection of objects 332 is shown with member Objects A, B, and C. Object A includes a reference to Object B and Object B includes a reference to Object C. A reference from an external source (i.e., an external reference), refers to Object B and represented by an X. In the Figure, internal references are shown by solid lines, external references are shown by dashed lines, and forwarding references are shown by dotted lines.
An old collection of objects 334 has Objects D, E, F, and G. Object D includes a reference to Object E, Object E includes a reference to Object F, Object F includes a reference to Object G, and Object G includes a reference to Object D. Several external references refer to Objects D and E.
In the example shown, Object B of the new collection of objects 332 “matches” Object D of the old collection of objects 334. Herein, the term “match” means that Object B and Object D refer to the same entity. They may or may not be associated with the same set of facts. A match may exist when one object is associated with data that updates, supplements, supersedes, or replaces the data associated with a second object. In the example shown it may be desirable to combine Objects B and D, replace one with the other, or otherwise eliminate duplicate information so that the resulting collection of objects contains the most complete data available with minimal redundancy.
Neither Object B nor Object D can be eliminated entirely, as both are referred to by both internal and external references. For example, if Object B was deleted, neither the external reference to Object B nor the internal reference from Object A could be successfully used to retrieve information related to Object A or Object B, and the reference to Object C would also be lost. Similarly, Object D is intimately connected in a network of references between objects, and is referred to by several external references. Deleting Object D would break these references. Thus removing either Object B or Object D produces an undesirable result.
Ignoring the match between Object B and Object D introduces the possibility of referring to redundant or out-of date data. For example, if Object B is identical to Object D, then their associated data is replicated, resulting in an inefficient use of storage capacity. As another example, if Object B is associated with data that supersedes the data associated with Object D, then Object G and several external references will continue to refer to out-of-date data. Existing references to Object D will not lead to the latest data, which is associated with Object B. Thus ignoring matches also produces an undesirable result.
The ID persistence janitor operates on the new collection of objects 332 and the old collection of objects 334 to produce a collection of objects with object identifier persistence 336. In the collection of objects with identifier persistence 336, matching objects have been detected and processed appropriately, thereby maintaining ID persistence and creating an efficient and up-to-date collection of objects.
In the example illustrated, Object B matches Object D. In the collection of objects with identifier persistence 336, Object B (represented by a square) has been modified so that references to Object B will forward to Object D. This is sometimes called a forwarding fact or a forwarding reference. In one embodiment, the service engine 114 determines that a referenced object has a forwarding fact and also retrieves the object referenced by the forwarding fact so that it can be returned. For example, if the service engine attempts to follow the external reference to B, the service engine will find the forwarding fact to Object D. Thus the object identifier of Objects B and D persist in the data collection. According to one embodiment of the present invention, the data of Object B in the new collection of objects 332 is moved to Object D in the collection of objects with identifier persistence 336. Thus Object B in the collection of objects with identifier persistence 336 is empty, saving storage space and resulting in more efficient data storage.
The identifier for Object D is also included in the collection of objects with identifier persistence 336. Thus the object identifier of Object D persists across the new build.
Additionally, according to one embodiment of the present invention, the reference in Object A to Object B is modified so that it refers to Object D instead of Object B. Thus an attempt to follow the reference in Object A may skip the step of forwarding from Object B and go directly to Object D.
The example depicts Object B forwarding to Object D. This example was chosen for the purposes of illustration. According to another embodiment of the present invention, Object D would instead forward to Object B and the facts associated with Object D would be moved to Object B. According to another embodiment of the present invention, a new object, Object H, would be created, and all facts from both Object B and Object D would be moved to Object H, and forwarding references would be created from Object B to Object H and from Object D to Object H.
As a result of ID persistence, new and existing references to objects in the collections may be used to access all available information for an entity.
According to one embodiment of the present invention, the collection of objects 402 is analogous to the output of the importer 322 described herein with reference to
According to one embodiment of the present invention, the ID persistence janitor may compare objects within subsets as described in U.S. application Ser. No. 11/356,842, “Modular Architecture for Entity Normalization”, an application filed concurrently with this application, which is herein incorporated by reference in its entirety.
According to one embodiment of the present invention, the merge object 404 may be one of the objects contained in the collection of objects 402. Calling the ID persistence janitor for a collection of objects and an object contained in that collection objects may be useful, for example, to ensure that IDs persist consistently within a build, or to create forwarding references between the object IDs of matching objects.
The objects in the collection of objects 402, in the merged collection of objects 408 and the merge object 404 may be structured in a variety of ways. For example they may exist as a set of facts with common object IDs, or they may explicitly exist as objects in memory. Various methods for structuring objects in a collection of data are described herein with reference to
Object persistence may be useful in a number of circumstances in which two collections of objects are merged: When a new build is executed, when two disparate collections of objects from different sources are merged together, when a new object is added to an existing collection, and so on. Each case introduces the possibility that multiple objects (each having its own object ID) in the collection may correspond to the same entity. The ID persistence janitor 406 beneficially makes all available information for an entity accessible by any one of the object IDs corresponding to that entity.
The method of the ID persistence janitor is described in greater detail herein with reference to
According to one embodiment of the present invention, the merged collection of objects contains the object ID of the merge object 404 and all of the object IDs contained in the collection of objects 402. The merged collection of object with persisting references 408 may contain the same number of objects as the collection of objects 402, for example, if the object ID of the merge object 404 is already contained in the collection of objects 402. The merged collection of object with persisting references 408 may contain a different number of objects as the collection of objects 402, for example, if the object ID of the merge object 404 is not already contained in the collection of objects 402.
According to one embodiment of the present invention, the merged collection of objects with persisting references 408 contains the facts of the union of the collection of objects 402 and the merge object 404. According to one embodiment of the present invention, the facts added by the merge object 404, if any, will be accessible by the object ID of the merge object 404. Similarly, according to one embodiment of the present invention, each object in the merged collection of objects with persisting references 408 may be accessed by the same object ID as the corresponding object in the collection of objects 402. According to one embodiment of the present invention, the ID persistence janitor 406 stores objects and facts from a first repository into a second repository, while ensuring that the objects and facts originating from both repositories remain accessible by their prior object ID or associated object ID. The persistence of identifiers (such as object IDs) across builds is beneficial for the continued operation of external and internal applications making reference to the objects of the collection of data.
a)-5(c) illustrate an example of maintaining persistent identifiers, according to several of the various embodiment of the present invention. 501 depicts an object before the operation of the ID persistence janitor 406. According to one embodiment of the present invention, Object A depicted in 501 may be analogous to the merge object 404 described herein with reference to
a) depicts a collection 502 of objects before the operation of the ID persistence janitor 406. According to one embodiment of the present invention, the objects depicted in 502 may be analogous to the collection of objects 402 described herein with reference to
Object A is an object in a collection 501 of objects before the operation of the ID persistence janitor 406. According to one embodiment of the present invention, the object depicted in 501 may be analogous to the merge object 404 described herein with reference to
According to another embodiment of the present invention, Objects A, B, and C belong to the same collection of objects, and the ID persistence janitor 406 operates on a collection of objects 402 and a merge object 404, wherein the merge object 404 is a member of the collection of objects 402.
b) depicts a collection 504 of objects after the operation of the ID persistence janitor, according to one embodiment of the present invention. According to one embodiment of the present invention, the objects depicted in 504 may be analogous to the merged collection of objects with persisting references 408 as described herein with reference to
b) depicts a case in which the ID persistence janitor 406 has determined that Object A matches Object B. According to one embodiment of the present invention, this determination may be made on the basis of the facts associated with Object A and the facts associated with Object B. The facts associated with Object B—Fact 4, Fact 5, and Fact 6—are moved from Object B to Object A. The facts previously associated with Object B are now associated with Object A.
Facts can be moved from one object to another using a variety of methods. For example, a fact can be modified by copying or moving it from Object B to Object A. According to one embodiment of the present invention, an internal property of the fact can be modified to indicate that the fact describes Object A instead of Object B, for example, by storing the object ID of Object A in the fact. Thus, the record of which object a fact describes could be modified without the need to reproduce the fact.
The facts of Object A and the facts of Object B are modified so that they are associated with a single object. In this case, the facts were modified so they are associated with Object A. According to various implementations, the determination as to which object between two matching objects a group of facts should be associated with may be made in a variety of ways. According to one embodiment of the present invention, the group of facts are associated with the object having the older object ID. By associating the group of facts with the object having the older object ID, the likelihood of long forwarding reference chains can be reduced, thereby improving the efficiency of the organization of objects.
The facts previously associated with Object B are now associated with Object A. However, there may exist prior references to Object B, and internal or external applications may be depending on those references to be able to return to the prior set of facts. For example, Object C is associated with a pointer to Object B. It is desirable that the references to Object B (such as the object ID for Object B and the pointer from Object C) continue to persist. Therefore, it may be desirable to add a reference from Object B to Object A.
In the interest of having references to Object B continue to persist, the ID persistence janitor 406 stores forwarding information from Object B to Object A. In 504, Object B is associated with a pointer to Object A. According to one embodiment of the present invention, this pointer may be implemented as a special fact associated with Object B, such as a forwarding fact.
Thus an attempt to retrieve, for example, Fact 5, on the basis of a prior reference to Object B (for example, by using the object ID of object B) will be successful. Object B is no longer associated with Fact 5, but Object B is associated with a pointer to Object A, which in turn is associated with Fact 5. Similarly, an attempt to retrieve, for example, Fact 6, on the basis of a prior reference to Object C (for example, by using the object ID of Object C) will be successful. Object C is not associated with Fact 6, but Object C is associated with a pointer to Object B, which is associated with a pointer to Object A, which in turn is associated with Fact 6.
For the purposes of illustration, Object A is depicted as being associated with Facts 1-6. According to one embodiment of the present invention, all the facts of the two matching objects are modified so that they are associated with a single object. However, according to another embodiment of the present invention, redundant facts are eliminated where they exist. For example, if Fact 1 was identical to Fact 4 and Fact 2 was identical to Fact 6, after the operation of the ID persistence janitor only Facts 1-3 and Fact 5 might me associated with Object A. Additionally, Fact 4 and Fact 6 could be marked as “deleted” in the repository.
c) depicts a collection 506 of objects after the operation of the ID persistence janitor, according to one embodiment of the present invention. 506 illustrates the effect of an additional optimization step in the ID persistence janitor 406. According to one embodiment of the present invention, after performing the method as described herein with reference to 504, the ID persistence janitor 406 cleans up existing references to the merged object. For example, in 506, the pointer associated with Object C is modified to point to Object A instead of Object B. Cleaning up existing references allows for more direct access to the facts previously associated with that reference. For example, an attempt to access Fact 6 on the basis of a prior reference to Object C would be more directly fulfilled if the objects were in the state depicted in 506 than the state depicted in 504. Object C is not associated with Fact 6, but Object C is associated with a pointer to Object A, which in turn is associated with Fact 6. Thus, in the example illustrated, otherwise unnecessary accesses to Object B are eliminated by cleaning up existing references. Cleaning up existing references is beneficial for improving the performance of the resulting collection of objects. References may be cleaned up, for example, by modifying pointers, forwarding facts, and object reference links to an outdated object to refer to the same destination object as the forwarding fact of the outdated object.
According to one embodiment of the present invention, if the acquisition of facts at a later point in time or additional analysis by a janitor results in a determination that Object A and Object D do not in fact match, the object ID persistence janitor (or another janitor) takes steps to undo the merge. The object ID persistence janitor removes the pointer from Object B to Object A, and restores to Object B the facts originally associated with Object B. The object ID persistence janitor may determine which facts were originally associated with Object B, for example, by analyzing source information of the respective facts, and/or consulting records of the previous actions of the object ID persistence janitor. Facts whose original association is ambiguous may be removed. Additionally, the object ID persistence janitor may undo the cleaning up of existing references described herein with reference to
According to one embodiment of the present invention, the ID persistence janitor 406 receives 602 a list of object identifiers (object IDs) of existing objects. The list contains a number of object IDs. For the purposes of illustration, the number of objects IDs in the received 602 list of objects is referred to as M. According to one embodiment of the present invention, receiving 602 the list of object IDs may additionally include receiving facts associated with those object IDs.
The ID persistence janitor 406 receives 604 an object ID of a new object. For the purposes of illustration, this object ID is referred to as Object ID A. According to one embodiment of the present invention, receiving 604 an object ID of a new object may additionally include receiving facts associated with that object ID. According to one embodiment of the present invention, Object ID A may also be contained in the list of object IDs of existing objects received 602 by the ID persistence janitor 406.
The ID persistence janitor 406 initializes a counter variable, which for the purposes of illustration will be called n, to the value of 1.
Using the counter variable n, the ID persistence janitor 406 selects 606 the nth object ID from the received 602 list of object IDs of existing objects. For the purposes of illustration, this nth object ID is referred to as Object ID B.
The ID persistence janitor 406 performs 608 an ID persistence method on Object ID A and Object ID B. According to one embodiment of the present invention, ID persistence may be performed by an ID persistence function. A method for performing ID persistence, according to one embodiment of the present invention, will be described in greater detail herein with reference to
The ID persistence janitor 406 determines 610 if the counter variable, n, is equal to the number of object IDs in the received 602 list of existing objects, M. If the ID persistence janitor 406 determines 610 that the counter variable, n, is equal to the number of object IDs in the received 602 list of existing objects, M, ID persistence has been performed on every object ID in the received 602 list of existing objects, and the ID persistence janitor 406 is finished. The ID persistence janitor 406 returns 612.
If the ID persistence janitor 406 determines 610 that the counter variable, n, is not equal to the number of object IDs in the received 602 list of existing objects, M, the ID persistence janitor 406 increments the counter variable, n, and returns to select 606 the nth object ID from the list. Thus the ID persistence janitor 406 loops until it has performed 608 the ID persistence method on the combination of Object ID A and every ID on the received 602 list of object IDs of existing objects. By applying the ID persistence method for various combinations of objects, the ID persistence janitor 406 ensures identifier persistence across a variety of objects.
The ID persistence function receives 704 two object IDs. For the purposes of illustration, one of these object IDs will be referred to as object ID A and the other will be referred to as object ID B.
The ID persistence function retrieves 706 facts relating to object ID A. For the purposes of illustration, these facts will be referred to as Facts A.
The ID persistence function retrieves 708 facts relating to object ID B. For the purposes of illustration, these facts will be referred to as Facts B.
According to one embodiment of the present invention, Facts A and Facts B are received 704 along with object ID A and object ID B. Thus, according to one embodiment of the present invention, the steps of retrieving 706 facts relating to object ID A and retrieving 708 facts relating to object ID B are optional.
The ID persistence function performs 710 a heuristic comparison on Facts A and Facts B. According to one embodiment of the present invention, the heuristic comparison may be performed by a heuristic comparison function. An example of how a heuristic comparison function, according to one embodiment of the present invention, might classify various pairs of objects as matching or non-matching is described herein with reference to
The heuristic comparison function returns data indicating whether the object associated with Facts A matches the object associated with Facts B. The ID persistence function determines 712 if the heuristic comparison function has returned data indicating that the object associated with Facts A matches the object associated with Facts B. If the ID persistence function determines 712 that the heuristic comparison function has returned data indicating that the object associated with Facts A does not match the object associated with Facts B, the ID persistence function returns 714.
On the other hand, if the ID persistence function determines 712 that the heuristic comparison function has returned data indicating that the object associated with Facts A matches the object associated with Facts B, the ID persistence function changes 716 Facts B so that are associated with the object with Object ID A instead of the object with Object ID B. Several methods for changing the object associated with facts is described previously herein with reference to
The ID persistence function stores 718 forwarding information from the Object ID B to Object ID A. According to one embodiment of the present invention, the ID persistence function associates with Object ID B a forwarding fact to Object ID A. Several methods for forwarding references to objects are described herein with reference to
According to one embodiment of the present invention, the ID persistence function cleans up 720 existing references to Object ID B and returns 714. Cleaning up existing references is described in greater detail herein with reference to
The ID persistence returns 714.
According to one embodiment of the present invention, object ID A is defined to be the older of the two received object IDs. Therefore, according to one embodiment of the present invention, when two objects are determined to match, their facts are modified to be associated with the object having the older object ID and the object having the younger object ID is associated with a pointer to the object having the older object ID. One skilled in the art will recognize that various methods can be implemented for defining one of the received object IDs as object ID A and the other as object ID B without departing from the scope of the present invention.
a)-8(d) show examples of different pairs of objects and how they might be classified as matching or non-matching by the heuristic comparison function, according to one embodiment of the present invention. According to one embodiment of the present invention, the heuristic comparison function compares two sets of facts to determine if they describe the same object.
a) depicts two matching objects 802. The attributes and values of the facts associated with a first object, Object A, are listed on the left, and the attributes and values of the facts associated with a second object, Object B, are listed on the right. While the facts are organized in a different order, the facts associated with Object A happen to be identical to the facts associated with Object B such that it can reasonably be concluded that Object A is the same entity as Object B, that is, Object A matches Object B. In this case, according to one embodiment of the present invention the heuristic comparison function would return positively, that is, it would return data indicating that the two objects match. In one embodiment, it is accurate to say that the facts have the same attributes and values.
b) depicts two non-matching objects 804. The attributes and values of the facts associated with a first object, Object A, are listed on the left, and the attributes and values of the facts associated with a second object, Object B, are listed on the right. No fact associated with Object A is at all similar to any fact associated with Object B. In this case, according to one embodiment of the present invention the heuristic comparison function would return negatively, that is, it would return data indicating that the two objects do not match. In one embodiment, it is accurate to say that the facts do not have the same attributes or, if they do, that the values of the facts having the same attributes do not match.
c) depicts a more challenging case of two matching objects 806. The attributes and values of the facts associated with a first object, Object A, are listed on the left, and the attributes and values of the facts associated with a second object, Object B, are listed on the right. Some of the facts associated with Object A are similar to the facts associated with Object B (for example, “Title: Emperor of Russia” and “Name: Nikolai [I] Pavlovich”) but other facts associated with Object A are not similar to the facts associated with Object B (for example, “Title: Grand Duke of Finland” vs. “Title: King of Poland” and “Birth date: 7/6/1796” vs. “Birth date: 6/25/1796”). In sum, however, the objects in fact represent the same entity (in this case a person), and it may be desirable to conclude that Object A matches Object B. In this case, according to one embodiment of the present invention the heuristic comparison function would return positively, that is, it would return data indicating that the two objects match. In one embodiment, it is accurate to say that the facts have some acceptable level of match between their attributes and that the facts with matching attributes have some acceptable level of match between their values.
d) depicts a more challenging case of two non-matching objects 808. The attributes and values of the facts associated with a first object, Object A, are listed on the left, and attributes and values of the facts associated with a second object, Object B, are listed on the right. Some of the facts associated with Object A are similar to the facts associated with Object B (for example, “Title: Emperor of Russia”) but other facts associated with Object A are not similar to the facts associated with Object B (for example, “Name: Nicholas II of Russia” vs. “Name: Nikolai I Pavlovich” and “Birth date: 5/18/1868” vs. “Birth date: 5/25/1796”). In sum, the two objects in fact represent different entities (inthis case, two different people) and it may desirable to conclude that that Object A does not match Object B. In this case, according to one embodiment of the present invention the heuristic comparison function would return negatively; that is, it would return data indicating that the two objects do not match. In one embodiment, it is accurate to say that the facts lack some acceptable level of match between their attributes or, that if they have an acceptable level of match between their attributes, they lack some acceptable level of match between their values.
The objects and facts listed in
Determining if two objects match using a heuristic comparison function is beneficial, as it allows matching objects to be combined or cross-referenced for the purposes of reducing redundant data, updating data, and reliably performing ID persistence.
Reference in the specification to “one embodiment” or to “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiments is included in at least one embodiment of the invention. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment.
Some portions of the above are presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps (instructions) leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical, magnetic or optical signals capable of being stored, transferred, combined, compared and otherwise manipulated. It is convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like. Furthermore, it is also convenient at times, to refer to certain arrangements of steps requiring physical manipulations of physical quantities as modules or code devices, without loss of generality.
It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” or “determining” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system memories or registers or other such information storage, transmission or display devices.
Certain aspects of the present invention include process steps and instructions described herein in the form of an algorithm. It should be noted that the process steps and instructions of the present invention can be embodied in software, firmware or hardware, and when embodied in software, can be downloaded to reside on and be operated from different platforms used by a variety of operating systems.
The present invention also relates to an apparatus for performing the operations herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general-purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a computer readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, application specific integrated circuits (ASICs), or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus. Furthermore, the computers referred to in the specification may include a single processor or may be architectures employing multiple processor designs for increased computing capability.
The algorithms and displays presented herein are not inherently related to any particular computer or other apparatus. Various general-purpose systems may also be used with programs in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatus to perform the required method steps. The required structure for a variety of these systems will appear from the description below. In addition, the present invention is not described with reference to any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any references below to specific languages are provided for disclosure of enablement and best mode of the present invention.
While the invention has been particularly shown and described with reference to a preferred embodiment and several alternate embodiments, it will be understood by persons skilled in the relevant art that various changes in form and details can be made therein without departing from the spirit and scope of the invention.
Finally, it should be noted that the language used in the specification has been principally selected for readability and instructional purposes, and may not have been selected to delineate or circumscribe the inventive subject matter. Accordingly, the disclosure of the present invention is intended to be illustrative, but not limiting, of the scope of the invention, which is set forth in the following claims.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5010478 | Deran | Apr 1991 | A |
| 5133075 | Risch | Jul 1992 | A |
| 5347653 | Flynn et al. | Sep 1994 | A |
| 5440730 | Elmasri et al. | Aug 1995 | A |
| 5475819 | Miller et al. | Dec 1995 | A |
| 5519608 | Kupiec | May 1996 | A |
| 5560005 | Hoover et al. | Sep 1996 | A |
| 5574898 | Leblang et al. | Nov 1996 | A |
| 5680622 | Even | Oct 1997 | A |
| 5694590 | Thuraisingham et al. | Dec 1997 | A |
| 5701470 | Joy et al. | Dec 1997 | A |
| 5717911 | Madrid et al. | Feb 1998 | A |
| 5717951 | Yabumoto | Feb 1998 | A |
| 5778378 | Rubin | Jul 1998 | A |
| 5787413 | Kauffman et al. | Jul 1998 | A |
| 5793966 | Amstein et al. | Aug 1998 | A |
| 5802299 | Logan et al. | Sep 1998 | A |
| 5815415 | Bentley et al. | Sep 1998 | A |
| 5819210 | Maxwell, III et al. | Oct 1998 | A |
| 5819265 | Ravin et al. | Oct 1998 | A |
| 5822743 | Gupta et al. | Oct 1998 | A |
| 5826258 | Gupta et al. | Oct 1998 | A |
| 5909689 | Van Ryzin | Jun 1999 | A |
| 5920859 | Li | Jul 1999 | A |
| 5943670 | Prager | Aug 1999 | A |
| 5956718 | Prasad et al. | Sep 1999 | A |
| 5974254 | Hsu | Oct 1999 | A |
| 5987460 | Niwa et al. | Nov 1999 | A |
| 6018741 | Howland et al. | Jan 2000 | A |
| 6044366 | Graffe et al. | Mar 2000 | A |
| 6052693 | Smith et al. | Apr 2000 | A |
| 6078918 | Allen et al. | Jun 2000 | A |
| 6112203 | Bharat et al. | Aug 2000 | A |
| 6112210 | Nori et al. | Aug 2000 | A |
| 6122647 | Horowitz et al. | Sep 2000 | A |
| 6134555 | Chadha et al. | Oct 2000 | A |
| 6138270 | Hsu | Oct 2000 | A |
| 6212526 | Chaudhuri et al. | Apr 2001 | B1 |
| 6240546 | Lee et al. | May 2001 | B1 |
| 6263328 | Coden et al. | Jul 2001 | B1 |
| 6285999 | Page | Sep 2001 | B1 |
| 6289338 | Stoffel et al. | Sep 2001 | B1 |
| 6311194 | Sheth et al. | Oct 2001 | B1 |
| 6327574 | Kramer et al. | Dec 2001 | B1 |
| 6349275 | Schumacher et al. | Feb 2002 | B1 |
| 6377943 | Jakobsson | Apr 2002 | B1 |
| 6397228 | Lamburt et al. | May 2002 | B1 |
| 6473898 | Waugh et al. | Oct 2002 | B1 |
| 6502102 | Haswell et al. | Dec 2002 | B1 |
| 6556991 | Borkovsky | Apr 2003 | B1 |
| 6567936 | Yang et al. | May 2003 | B1 |
| 6572661 | Stern | Jun 2003 | B1 |
| 6584464 | Warthen | Jun 2003 | B1 |
| 6606625 | Muslea et al. | Aug 2003 | B1 |
| 6606659 | Hegli et al. | Aug 2003 | B1 |
| 6609123 | Cazemier et al. | Aug 2003 | B1 |
| 6656991 | Staccione et al. | Dec 2003 | B2 |
| 6665659 | Logan | Dec 2003 | B1 |
| 6665666 | Brown et al. | Dec 2003 | B1 |
| 6665837 | Dean et al. | Dec 2003 | B1 |
| 6745189 | Schreiber | Jun 2004 | B2 |
| 6754873 | Law et al. | Jun 2004 | B1 |
| 6799176 | Page | Sep 2004 | B1 |
| 6804667 | Martin | Oct 2004 | B1 |
| 6820081 | Kawai et al. | Nov 2004 | B1 |
| 6823495 | Vedula et al. | Nov 2004 | B1 |
| 6850896 | Kelman et al. | Feb 2005 | B1 |
| 6886005 | Davis | Apr 2005 | B2 |
| 6901403 | Bata et al. | May 2005 | B1 |
| 6957213 | Yuret | Oct 2005 | B1 |
| 6963880 | Pingte et al. | Nov 2005 | B1 |
| 7003522 | Reynar et al. | Feb 2006 | B1 |
| 7003719 | Rosenoff et al. | Feb 2006 | B1 |
| 7020662 | Boreham et al. | Mar 2006 | B2 |
| 7051023 | Kapur et al. | May 2006 | B2 |
| 7080073 | Jiang et al. | Jul 2006 | B1 |
| 7080085 | Choy et al. | Jul 2006 | B1 |
| 7143099 | Lecheler-Moore et al. | Nov 2006 | B2 |
| 7146536 | Bingham et al. | Dec 2006 | B2 |
| 7162499 | Lees et al. | Jan 2007 | B2 |
| 7194380 | Barrow et al. | Mar 2007 | B2 |
| 7197449 | Hu et al. | Mar 2007 | B2 |
| 7277879 | Varadarajan | Oct 2007 | B2 |
| 7305380 | Hoelzle et al. | Dec 2007 | B1 |
| 7363312 | Goldsack | Apr 2008 | B2 |
| 7472182 | Young et al. | Dec 2008 | B1 |
| 7483829 | Murakami et al. | Jan 2009 | B2 |
| 7493317 | Geva | Feb 2009 | B2 |
| 7797282 | Kirshenbaum et al. | Sep 2010 | B1 |
| 20020038307 | Obradovic et al. | Mar 2002 | A1 |
| 20020042707 | Zhao et al. | Apr 2002 | A1 |
| 20020065845 | Naito et al. | May 2002 | A1 |
| 20020073115 | Davis | Jun 2002 | A1 |
| 20020083039 | Ferrari et al. | Jun 2002 | A1 |
| 20020087567 | Spiegler et al. | Jul 2002 | A1 |
| 20020147738 | Reader | Oct 2002 | A1 |
| 20020169770 | Kim et al. | Nov 2002 | A1 |
| 20020178448 | Te Kiefte et al. | Nov 2002 | A1 |
| 20020194172 | Schreiber | Dec 2002 | A1 |
| 20030018652 | Heckerman et al. | Jan 2003 | A1 |
| 20030058706 | Okamoto et al. | Mar 2003 | A1 |
| 20030078902 | Leong et al. | Apr 2003 | A1 |
| 20030120644 | Shirota | Jun 2003 | A1 |
| 20030120675 | Stauber et al. | Jun 2003 | A1 |
| 20030126102 | Borthwick | Jul 2003 | A1 |
| 20030149567 | Schmitz et al. | Aug 2003 | A1 |
| 20030154071 | Shreve | Aug 2003 | A1 |
| 20030177110 | Okamoto et al. | Sep 2003 | A1 |
| 20030182310 | Charnock et al. | Sep 2003 | A1 |
| 20030195877 | Ford et al. | Oct 2003 | A1 |
| 20030196052 | Bolik et al. | Oct 2003 | A1 |
| 20040003067 | Ferrin | Jan 2004 | A1 |
| 20040024739 | Copperman et al. | Feb 2004 | A1 |
| 20040064447 | Simske et al. | Apr 2004 | A1 |
| 20040088292 | Dettinger et al. | May 2004 | A1 |
| 20040107125 | Guheen et al. | Jun 2004 | A1 |
| 20040122844 | Malloy et al. | Jun 2004 | A1 |
| 20040123240 | Gerstl et al. | Jun 2004 | A1 |
| 20040128624 | Arellano et al. | Jul 2004 | A1 |
| 20040143600 | Musgrove et al. | Jul 2004 | A1 |
| 20040153456 | Charnock et al. | Aug 2004 | A1 |
| 20040167870 | Wakefield et al. | Aug 2004 | A1 |
| 20040177015 | Galai et al. | Sep 2004 | A1 |
| 20040199923 | Russek | Oct 2004 | A1 |
| 20040255237 | Tong | Dec 2004 | A1 |
| 20040260979 | Kumai | Dec 2004 | A1 |
| 20040267700 | Dumais et al. | Dec 2004 | A1 |
| 20050076012 | Manber et al. | Apr 2005 | A1 |
| 20050086211 | Mayer | Apr 2005 | A1 |
| 20050086222 | Wang et al. | Apr 2005 | A1 |
| 20050097150 | McKeon et al. | May 2005 | A1 |
| 20050125311 | Chidiac et al. | Jun 2005 | A1 |
| 20050149576 | Marmaros et al. | Jul 2005 | A1 |
| 20050149851 | Mittal | Jul 2005 | A1 |
| 20050187923 | Cipollone | Aug 2005 | A1 |
| 20050240615 | Barsness et al. | Oct 2005 | A1 |
| 20050256825 | Dettinger et al. | Nov 2005 | A1 |
| 20060036504 | Allocca et al. | Feb 2006 | A1 |
| 20060041597 | Conrad et al. | Feb 2006 | A1 |
| 20060047838 | Chauhan | Mar 2006 | A1 |
| 20060053171 | Eldridge et al. | Mar 2006 | A1 |
| 20060053175 | Gardner et al. | Mar 2006 | A1 |
| 20060074824 | Li | Apr 2006 | A1 |
| 20060074910 | Yun et al. | Apr 2006 | A1 |
| 20060085465 | Nori et al. | Apr 2006 | A1 |
| 20060136585 | Mayfield et al. | Jun 2006 | A1 |
| 20060143227 | Helm et al. | Jun 2006 | A1 |
| 20060143603 | Kalthoff et al. | Jun 2006 | A1 |
| 20060152755 | Curtis et al. | Jul 2006 | A1 |
| 20060238919 | Bradley | Oct 2006 | A1 |
| 20060248045 | Toledano et al. | Nov 2006 | A1 |
| 20060248456 | Bender et al. | Nov 2006 | A1 |
| 20060253418 | Charnock et al. | Nov 2006 | A1 |
| 20060288268 | Srinivasan et al. | Dec 2006 | A1 |
| 20060293879 | Zhao et al. | Dec 2006 | A1 |
| 20070005593 | Self et al. | Jan 2007 | A1 |
| 20070005639 | Gaussier et al. | Jan 2007 | A1 |
| 20070016890 | Brunner et al. | Jan 2007 | A1 |
| 20070038610 | Omoigui | Feb 2007 | A1 |
| 20070073768 | Goradia | Mar 2007 | A1 |
| 20070094246 | Dill et al. | Apr 2007 | A1 |
| 20070130123 | Majumder | Jun 2007 | A1 |
| 20070143317 | Hogue et al. | Jun 2007 | A1 |
| 20070150800 | Betz et al. | Jun 2007 | A1 |
| 20070198480 | Hogue et al. | Aug 2007 | A1 |
| 20070203867 | Hogue et al. | Aug 2007 | A1 |
| 20070271268 | Fontoura et al. | Nov 2007 | A1 |
| 20080071739 | Kumar et al. | Mar 2008 | A1 |
| 20090006359 | Liao | Jan 2009 | A1 |
| Number | Date | Country |
|---|---|---|
| WO 0127713 | Apr 2001 | WO |
| WO 2004114163 | Dec 2004 | WO |
| WO 2006104951 | Oct 2006 | WO |
| Number | Date | Country | |
|---|---|---|---|
| 20070198577 A1 | Aug 2007 | US |
