Metatomix, Inc.

Objectstore, Inc.

Other

David A Bigwood

Colin P Britton

Ashok Kumar

Howard Greenblatt

Anthony J DeFusco

Amir M Azmi

Chandra Bajpai

Noah W Kaufman

Robert F Angelo

Alan Greenblatt

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.

Methods and apparatus for querying a relational data store using schema-less queries

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.

Methods and apparatus for real-time business visibility using persistent schema-less data storage

The invention provides methods for identifying related data in a directed graph (e.g., an RDF data set). A 'first' in step&#x2014;though the steps are not necessarily executed in sequential order&#x2014;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 &#x201c;third&#x201d; 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.

Methods and apparatus for identifying related nodes in a directed graph having named arcs

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.

Methods and apparatus for statistical data analysis and reduction for an enterprise application

The invention provides methods for identifying related data in a directed graph (e.g., an RDF data set). A 'first' step&#x2014;though the steps are not necessarily executed in sequential order&#x2014;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 &#x201c;third&#x201d; 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.

Growing community of inventors

Sudbury, MA, United States of America

David A Bigwood