Patents by Inventor David Bigwood
David Bigwood has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11347804Abstract: The invention provides, in one aspect, a method of searching an RDF triples data store of the type in which the triples are maintained in accord with a first storage schema. The method includes inputting a first query specifying RDF triples that are to be identified in the data store. That first query assumes either (i) that the triples are stored in a schema-less manner (i.e., with no storage schema) or (ii) that the triples are maintained in accord with a second storage schema that differs from the first. The method further includes generating, from the first query, a second query that specifies those same RDF triples, yet, that reflects the first storage schema. That second query can be applied to the RDF triples data store in order to identify and/or retrieve the desired data.Type: GrantFiled: April 29, 2019Date of Patent: May 31, 2022Assignee: ObjectStore, Inc.Inventors: Colin P. Britton, Ashok Kumar, David Bigwood, Anthony J. DeFusco, Howard Greenblatt
-
Publication number: 20190258680Abstract: The invention provides, in one aspect, a method of searching an RDF triples data store of the type in which the triples are maintained in accord with a first storage schema. The method includes inputting a first query specifying RDF triples that are to be identified in the data store. That first query assumes either (i) that the triples are stored in a schema-less manner (i.e., with no storage schema) or (ii) that the triples are maintained in accord with a second storage schema that differs from the first. The method further includes generating, from the first query, a second query that specifies those same RDF triples, yet, that reflects the first storage schema. That second query can be applied to the RDF triples data store in order to identify and/or retrieve the desired data.Type: ApplicationFiled: April 29, 2019Publication date: August 22, 2019Applicant: ObjectStore, Inc.Inventors: Colin P. Britton, Ashok Kumar, David Bigwood, Anthony J. DeFusco, Howard Greenblatt
-
Patent number: 10275540Abstract: The invention provides, in one aspect, a method of searching an RDF triples data store of the type in which the triples are maintained in accord with a first storage schema. The method includes inputting a first query specifying RDF triples that are to be identified in the data store. That first query assumes either (i) that the triples are stored in a schema-less manner (i.e., with no storage schema) or (ii) that the triples are maintained in accord with a second storage schema that differs from the first. The method further includes generating, from the first query, a second query that specifies those same RDF triples, yet, that reflects the first storage schema. That second query can be applied to the RDF triples data store in order to identify and/or retrieve the desired data.Type: GrantFiled: December 1, 2016Date of Patent: April 30, 2019Assignee: ObjectStore, Inc.Inventors: Colin P. Britton, Ashok Kumar, David Bigwood, Anthony J. DeFusco, Howard Greenblatt
-
Publication number: 20170083634Abstract: The invention provides, in one aspect, a method of searching an RDF triples data store of the type in which the triples are maintained in accord with a first storage schema. The method includes inputting a first query specifying RDF triples that are to be identified in the data store. That first query assumes either (i) that the triples are stored in a schema-less manner (i.e., with no storage schema) or (ii) that the triples are maintained in accord with a second storage schema that differs from the first. The method further includes generating, from the first query, a second query that specifies those same RDF triples, yet, that reflects the first storage schema. That second query can be applied to the RDF triples data store in order to identify and/or retrieve the desired data.Type: ApplicationFiled: December 1, 2016Publication date: March 23, 2017Applicant: ObjectStore, Inc.Inventors: Colin P. Britton, Ashok Kumar, David Bigwood, Anthony J. DeFusco, Howard Greenblatt
-
Patent number: 9529937Abstract: The invention provides, in one aspect, a method of searching an RDF triples data store of the type in which the triples are maintained in accord with a first storage schema. The method includes inputting a first query specifying RDF triples that are to be identified in the data store. That first query assumes either (i) that the triples are stored in a schema-less manner (i.e., with no storage schema) or (ii) that the triples are maintained in accord with a second storage schema that differs from the first. The method further includes generating, from the first query, a second query that specifies those same RDF triples, yet, that reflects the first storage schema. That second query can be applied to the RDF triples data store in order to identify and/or retrieve the desired data.Type: GrantFiled: March 27, 2013Date of Patent: December 27, 2016Assignee: ObjectStore, Inc.Inventors: Colin P. Britton, Ashok Kumar, David Bigwood, Anthony J. DeFusco, Howard Greenblatt
-
Patent number: 8412720Abstract: The invention provides, in one aspect, a method of searching an RDF triples data store of the type in which the triples are maintained in accord with a first storage schema. The method includes inputting a first query specifying RDF triples that are to be identified in the data store. That first query assumes either (i) that the triples are stored in a schema-less manner (i.e., with no storage schema) or (ii) that the triples are maintained in accord with a second storage schema that differs from the first. The method further includes generating, from the first query, a second query that specifies those same RDF triples, yet, that reflects the first storage schema. That second query can be applied to the RDF triples data store in order to identify and/or retrieve the desired data.Type: GrantFiled: October 29, 2007Date of Patent: April 2, 2013Inventors: Colin P. Britton, Ashok Kumar, David Bigwood, Anthony J. DeFusco, Howard Greenblatt
-
Patent number: 7640239Abstract: The invention provides methods for enterprise business visibility that transform any of marketing, e-commerce and transactional from a plurality of legacy and other databases into resource description framework (RDF) syntax. This information can be time-stamped (e.g., with expiration dates) and stored in a central data store. Answers to queries are discerned by applying genetic algorithm-based search techniques to the holographic store, with the confidence levels of those answers is based in part, for example, on the time-stamps of the triples.Type: GrantFiled: January 4, 2005Date of Patent: December 29, 2009Assignee: Metatomix, Inc.Inventors: Colin P. Britton, Amir Azmi, Ashok Kumar, Noah W. Kaufman, Chandra Bajpai, Robert F. Angelo, David A. Bigwood
-
Patent number: 7613712Abstract: The invention provides methods for identifying related data in a directed graph (e.g., an RDF data set). A “first” in step—though the steps are not necessarily executed in sequential order—includes identifying (or marking) as related data expressly satisfying the criteria. A “second” step includes identifying as related ancestors of any data identified as related, e.g., in the first step, unless that ancestor conflicts with the criteria. A “third” step of the method is identifying descendents of any data identified, e.g., in the prior steps, unless that descendent conflicts with the criteria or has a certain relationship with the ancestor from which it descends. The methods generates, e.g., as output, an indication of each of the nodes identified as related in the three steps.Type: GrantFiled: October 7, 2005Date of Patent: November 3, 2009Assignee: Metatomix, Inc.Inventors: Howard Greenblatt, Alan Greenblatt, David A. Bigwood, Colin P. Britton
-
Publication number: 20080109420Abstract: The invention provides, in one aspect, a method of searching an RDF triples data store of the type in which the triples are maintained in accord with a first storage schema. The method includes inputting a first query specifying RDF triples that are to be identified in the data store. That first query assumes either (i) that the triples are stored in a schema-less manner (i.e., with no storage schema) or (ii) that the triples are maintained in accord with a second storage schema that differs from the first. The method further includes generating, from the first query, a second query that specifies those same RDF triples, yet, that reflects the first storage schema. That second query can be applied to the RDF triples data store in order to identify and/or retrieve the desired data.Type: ApplicationFiled: October 29, 2007Publication date: May 8, 2008Applicant: METATOMIX, INC.Inventors: Colin Britton, Ashok Kumar, David Bigwood, Anthony DeFusco, Howard Greenblatt
-
Patent number: 7318055Abstract: The invention provides, in one aspect, a method of searching an RDF triples data store of the type in which the triples are maintained in accord with a first storage schema. The method includes inputting a first query specifying RDF triples that are to be identified in the data store. That first query assumes either (i) that the triples are stored in a schema-less manner (i.e., with no storage schema) or (ii) that the triples are maintained in accord with a second storage schema that differs from the first. The method further includes generating, from the first query, a second query that specifies those same RDF triples, yet, that reflects the first storage schema. That second query can be applied to the RDF triples data store in order to identify and/or retrieve the desired data.Type: GrantFiled: April 6, 2005Date of Patent: January 8, 2008Assignee: Metatomix, Inc.Inventors: Colin P. Britton, Ashok Kumar, David A. Bigwood, Anthony J. DeFusco, Howard Greenblatt
-
Patent number: 7302440Abstract: The invention provides methods of time-wise data reduction that include the steps of inputting data from a source; summarizing that data according to one or more selected epochs in which it belongs; and generating for each such selected epoch one or more RDF triples characterizing the summarized data. The data source may be, for example, a database, a data stream or otherwise. The selected epoch may be a second, minute, hour, week, month, year, or so forth. The triples may be output in the form of RDF document objects. These can be stored, for example, in a hierarchical data store such as, for example, a WebDAV server. Triples parsed from the document objects may be maintained in a relational store that is organized, for example, according to a hashed with origin approach.Type: GrantFiled: November 21, 2002Date of Patent: November 27, 2007Assignee: Metatomix, Inc.Inventors: Colin P. Britton, Ashok Kumar, David Bigwood, Howard Greenblatt
-
Publication number: 20070198454Abstract: The invention provides methods for identifying related data in a directed graph (e.g., an RDF data set). A “first” in step—though the steps are not necessarily executed in sequential order—includes identifying (or marking) as related data expressly satisfying the criteria. A “second” step includes identifying as related ancestors of any data identified as related, e.g., in the first step, unless that ancestor conflicts with the criteria. A “third” step of the method is identifying descendents of any data identified, e.g., in the prior steps, unless that descendent conflicts with the criteria or has a certain relationship with the ancestor from which it descends. The methods generates, e.g., as output, an indication of each of the nodes identified as related in the three steps.Type: ApplicationFiled: October 7, 2005Publication date: August 23, 2007Applicant: METATOMIX, INC.Inventors: Howard Greenblatt, Alan Greenblatt, David Bigwood, Colin Britton
-
Publication number: 20060036620Abstract: The invention provides, in one aspect, a method for visualizing relationships among triples of an RDF data set. The method, which can be used with a data set already in RDF form or converted thereto (e.g., from relational, hierarchical or other form), includes the steps of grouping subjects of at least selected ones of the triples based on commonality of at least portions of the identifiers of those subjects. It further includes grouping, for at least a selected subject groups, objects based on commonality of at least portions of identifiers of the predicates of those triples. Icons representing the subject and object groups can be displayed, e.g., on a computer monitor, or otherwise. A related aspect of the invention provides the additional step of displaying icons, e.g., directed arrows, indicating relationships among icons that represent subject group and icons that represent object groups.Type: ApplicationFiled: August 8, 2005Publication date: February 16, 2006Applicant: METATOMIX, INC.Inventors: David Bigwood, Colin Britton, Alan Greenblatt, Howard Greenblatt
-
Publication number: 20050228805Abstract: The invention provides methods for enterprise business visibility that transform any of marketing, e-commerce and transactional from a plurality of legacy and other databases into resource description framework (RDF) syntax. This information can be time-stamped (e.g., with expiration dates) and stored in a central data store. Answers to queries are discerned by applying genetic algorithm-based search techniques to the holographic store, with the confidence levels of those answers is based in part, for example, on the time-stamps of the triples.Type: ApplicationFiled: January 4, 2005Publication date: October 13, 2005Inventors: Colin Britton, Amir Azmi, Ashok Kumar, Noah Kaufman, Chandra Bajpai, Robert Angelo, David Bigwood
-
Patent number: 6954749Abstract: The invention provides methods for identifying related data in a directed graph (e.g., an RDF data set). A “first” step—though the steps are not necessarily executed in sequential order—includes identifying (or marking) as related data expressly satisfying the criteria. A “second” step includes identifying as related ancestors of any data identified as related, e.g., in the first step, unless that ancestor conflicts with the criteria. A “third” step of the method is identifying descendents of any data identified, e.g., in the prior steps, unless that descendent conflicts with the criteria or has a certain relationship with the ancestor from which it descends. The methods generates, e.g., as output, an indication of each of the nodes identified as related in the three steps.Type: GrantFiled: October 7, 2003Date of Patent: October 11, 2005Assignee: Metatomix, Inc.Inventors: Howard Greenblatt, Alan Greenblatt, David A. Bigwood, Colin P. Britton
-
Publication number: 20050187926Abstract: The invention provides, in one aspect, a method of searching an RDF triples data store of the type in which the triples are maintained in accord with a first storage schema. The method includes inputting a first query specifying RDF triples that are to be identified in the data store. That first query assumes either (i) that the triples are stored in a schema-less manner (i.e., with no storage schema) or (ii) that the triples are maintained in accord with a second storage schema that differs from the first. The method further includes generating, from the first query, a second query that specifies those same RDF triples, yet, that reflects the first storage schema. That second query can be applied to the RDF triples data store in order to identify and/or retrieve the desired data.Type: ApplicationFiled: April 6, 2005Publication date: August 25, 2005Inventors: Colin Britton, Ashok Kumar, David Bigwood, Anthony DeFusco, Howard Greenblatt
-
Patent number: 6925457Abstract: The invention provides, in one aspect, a method of searching an RDF triples data store of the type in which the triples are maintained in accord with a first storage schema. The method includes inputting a first query specifying RDF triples that are to be identified in the data store. That first query assumes either (i) that the triples are stored in a schema-less manner (i.e., with no storage schema) or (ii) that the triples are maintained in accord with a second storage schema that differs from the first. The method further includes generating, from the first query, a second query that specifies those same RDF triples, yet, that reflects the first storage schema. That second query can be applied to the RDF triples data store in order to identify and/or retrieve the desired data.Type: GrantFiled: November 21, 2002Date of Patent: August 2, 2005Assignee: Metatomix, Inc.Inventors: Colin P. Britton, Ashok Kumar, David Bigwood, Anthony J. DeFusco, Howard Greenblatt
-
Patent number: 6856992Abstract: The invention provides methods for enterprise business visibility that transform any of marketing, e-commerce and transactional from a plurality of legacy and other databases into resource description framework (RDF) syntax. This information can be time-stamped (e.g., with expiration dates) and stored in a central data store. Answers to queries are discerned by applying genetic algorithm-based search techniques to the holographic store, with the confidence levels of those answers is based in part, for example, on the time-stamps of the triples.Type: GrantFiled: October 29, 2001Date of Patent: February 15, 2005Assignee: Metatomix, Inc.Inventors: Colin P. Britton, Amir Azmi, Ashok Kumar, Noah W. Kaufman, Chandra Bajpai, Robert F. Angelo, David Bigwood
-
Publication number: 20040073545Abstract: The invention provides methods for identifying related data in a directed graph (e.g., an RDF data set). A “first” step—though the steps are not necessarily executed in sequential order—includes identifying (or marking) as related data expressly satisfying the criteria. A “second” step includes identifying as related ancestors of any data identified as related, e.g., in the first step, unless that ancestor conflicts with the criteria. A “third” step of the method is identifying descendents of any data identified, e.g., in the prior steps, unless that descendent conflicts with the criteria or has a certain relationship with the ancestor from which it descends. The methods generates, e.g., as output, an indication of each of the nodes identified as related in the three steps.Type: ApplicationFiled: October 7, 2003Publication date: April 15, 2004Inventors: Howard Greenblatt, Alan Greenblatt, David A. Bigwood, Colin P. Britton
-
Publication number: 20030208499Abstract: The invention provides, in one aspect, a method for visualizing relationships among triples of an RDF data set. The method, which can be used with a data set already in RDF form or converted thereto (e.g., from relational, hierarchical or other form), includes the steps of grouping subjects of at least selected ones of the triples based on commonality of at least portions of the identifiers of those subjects. It further includes grouping, for at least a selected subject groups, objects based on commonality of at least portions of identifiers of the predicates of those triples. Icons representing the subject and object groups can be displayed, e.g., on a computer monitor, or otherwise. A related aspect of the invention provides the additional step of displaying icons, e.g., directed arrows, indicating relationships among icons that represent subject group and icons that represent object groups.Type: ApplicationFiled: May 3, 2002Publication date: November 6, 2003Inventors: David Bigwood, Colin P. Britton, Alan Greenblatt, Howard Greenblatt