利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

9 条记录 (耗时 0.025 秒)

    Methods and apparatus for querying a relational data store using schema-less queries
    2.
    发明授权
    Methods and apparatus for querying a relational data store using schema-less queries 有权
    使用无模式查询来查询关系数据存储的方法和装置

    公开(公告)号：US06925457B2

    公开(公告)日：2005-08-02

    申请号：US10302764

    申请日：2002-11-21

    申请人： Colin P. Britton ,  Ashok Kumar ,  David Bigwood ,  Anthony J. DeFusco ,  Howard Greenblatt

    发明人： Colin P. Britton ,  Ashok Kumar ,  David Bigwood ,  Anthony J. DeFusco ,  Howard Greenblatt

    IPC分类号： G06F7/00 ,  G06F17/30

    CPC分类号： G06F17/30979 ,  G06F17/30448 ,  G06F17/30463 ,  G06F17/30536 ,  G06F17/30551 ,  G06F17/30893 ,  G06F17/30917 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99934 ,  Y10S707/99936

    摘要： 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.

    摘要翻译： 本发明在一个方面提供了一种搜索符合第一存储模式来保持三元组的类型的RDF三元组数据存储的方法。 该方法包括输入指定要在数据存储器中识别的RDF三元组的第一查询。 该第一个查询假设（i）三元组以无模式的方式存储（即，没有存储模式），或（ii）根据与第一存储模式不同的第二存储模式维护三元组。 该方法还包括从第一查询生成指定那些相同的RDF三元组的第二查询，但反映第一存储模式。 该第二个查询可以应用于RDF三元组数据存储，以便识别和/或检索所需的数据。

    Methods and apparatus for statistical data analysis and reduction for an enterprise application
    3.
    发明授权
    Methods and apparatus for statistical data analysis and reduction for an enterprise application 失效
    用于企业应用的统计数据分析和减少的方法和装置

    公开(公告)号：US07302440B2

    公开(公告)日：2007-11-27

    申请号：US10302727

    申请日：2002-11-21

    申请人： Colin P. Britton ,  Ashok Kumar ,  David Bigwood ,  Howard Greenblatt

    发明人： Colin P. Britton ,  Ashok Kumar ,  David Bigwood ,  Howard Greenblatt

    IPC分类号： G06F7/00 ,  G06F17/00

    CPC分类号： G06F17/30893 ,  G06F17/30536 ,  G06F17/30551 ,  Y10S707/99942

    摘要： 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.

    摘要翻译： 本发明提供了时间上数据简化的方法，包括从源输入数据的步骤; 总结根据其所属的一个或多个所选择的时期的数据; 并为每个这样选择的时期生成表征汇总数据的一个或多个RDF三元组。 数据源可以是例如数据库，数据流或其他数据。 所选择的时期可以是秒，分，小时，周，月，年等。 三元组可以以RDF文档对象的形式输出。 这些可以例如存储在例如WebDAV服务器的分层数据存储中。 从文档对象解析的三元组可以维护在例如根据具有原始方法的散列的组织的关系存储中。

    METHODS AND APPARATUS FOR QUERYING A RELATIONAL DATA STORE USING SCHEMA-LESS QUERIES
    5.
    发明申请
    METHODS AND APPARATUS FOR QUERYING A RELATIONAL DATA STORE USING SCHEMA-LESS QUERIES 有权
    使用简单的查询查询相关数据存储的方法和设备

    公开(公告)号：US20080109420A1

    公开(公告)日：2008-05-08

    申请号：US11927305

    申请日：2007-10-29

    申请人： Colin Britton ,  Ashok Kumar ,  David Bigwood ,  Anthony DeFusco ,  Howard Greenblatt

    发明人： Colin Britton ,  Ashok Kumar ,  David Bigwood ,  Anthony DeFusco ,  Howard Greenblatt

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30979 ,  G06F17/30448 ,  G06F17/30463 ,  G06F17/30536 ,  G06F17/30551 ,  G06F17/30893 ,  G06F17/30917 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99934 ,  Y10S707/99936

    摘要： 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.

    摘要翻译： 本发明在一个方面提供了一种搜索符合第一存储模式来保持三元组的类型的RDF三元组数据存储的方法。 该方法包括输入指定要在数据存储器中识别的RDF三元组的第一查询。 该第一个查询假设（i）三元组以无模式的方式存储（即，没有存储模式），或（ii）根据与第一存储模式不同的第二存储模式维护三元组。 该方法还包括从第一查询生成指定那些相同的RDF三元组的第二查询，但反映第一存储模式。 该第二个查询可以应用于RDF三元组数据存储，以便识别和/或检索所需的数据。

    Methods and apparatus for identifying related nodes in a directed graph having named arcs
    7.
    发明申请
    Methods and apparatus for identifying related nodes in a directed graph having named arcs 有权
    用于识别具有命名弧的有向图中的相关节点的方法和装置

    公开(公告)号：US20070198454A1

    公开(公告)日：2007-08-23

    申请号：US11245994

    申请日：2005-10-07

    申请人： Howard Greenblatt ,  Alan Greenblatt ,  David Bigwood ,  Colin Britton

    发明人： Howard Greenblatt ,  Alan Greenblatt ,  David Bigwood ,  Colin Britton

    IPC分类号： G06F7/00 ,  G06F17/30

    CPC分类号： G06F17/30584 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99942 ,  Y10S707/99944 ,  Y10S707/99945

    摘要： 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.

    摘要翻译： 本发明提供了用于识别有向图中的相关数据（例如，RDF数据集）的方法。 步骤中的“第一”不一定按顺序执行 - 包括将（或标记）识别为明确满足标准的相关数据。 “第二”步骤包括将例如在第一步骤中识别为相关的任何数据的相关祖先识别，除非祖先与标准冲突。 该方法的“第三”步骤是识别例如在先前步骤中识别的任何数据的后代，除非该后代与标准冲突或与其下降的祖先具有一定的关系。 该方法产生例如作为输出，在三个步骤中标识为相关的每个节点的指示。

    Methods and apparatus for visualizing relationships among triples of resource description framework (RDF) data sets
    8.
    发明申请
    Methods and apparatus for visualizing relationships among triples of resource description framework (RDF) data sets 审中-公开

    公开(公告)号：US20060036620A1

    公开(公告)日：2006-02-16

    申请号：US11199514

    申请日：2005-08-08

    申请人： David Bigwood ,  Colin Britton ,  Alan Greenblatt ,  Howard Greenblatt

    发明人： David Bigwood ,  Colin Britton ,  Alan Greenblatt ,  Howard Greenblatt

    IPC分类号： G06F7/00

    CPC分类号： G06F16/34 ,  G06F16/26

    摘要： 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. A display so generated is reminiscent of a directed graph—albeit a novel such graph that represents relationships among groups of subjects and objects, rather than directly between individual subjects and objects.