System and method for schema evolution in an E-commerce network
    2.
    发明授权
    System and method for schema evolution in an E-commerce network 有权
    电子商务网络中模式演化的系统和方法

    公开(公告)号:US09037966B2

    公开(公告)日:2015-05-19

    申请号:US13610706

    申请日:2012-09-11

    摘要: A method and computer system are described for conducting commercial transactions. An enhanced type of XML schema may be used which supports integrity constraints and polymorphism. Schemas are identified by the use of Uniform Resource Names. XML processors residing on transaction servers or trading partner servers parse document instances by retrieving the URNs corresponding to the schemas used to interpret the document. The URNs are converted to location-dependent URIs in order to locate the schemas. URNs are resolved to location-dependent URIs by use of the LDAP protocol. URNs may be converted to LDAP URLs which are used to search LDAP compliant directories. The directories serve as registries for the URI values corresponding to the URNs.

    摘要翻译: 描述了进行商业交易的方法和计算机系统。 可以使用支持完整性约束和多态的增强型XML模式。 通过使用统一资源名称来标识模式。 驻留在事务服务器或交易伙伴服务器上的XML处理器通过检索与用于解释文档的模式相对应的URN来解析文档实例。 URN被转换为位置相关的URI,以便定位模式。 使用LDAP协议将URN解析为与位置相关的URI。 URN可以转换为用于搜索LDAP兼容目录的LDAP URL。 这些目录用作与URN对应的URI值的注册表。

    Methods and systems for processing graphs using distributed memory and set operations
    3.
    发明授权
    Methods and systems for processing graphs using distributed memory and set operations 有权
    使用分布式内存和设置操作处理图形的方法和系统

    公开(公告)号:US08620901B2

    公开(公告)日:2013-12-31

    申请号:US13347917

    申请日:2012-01-11

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30584 G06F17/30958

    摘要: Systems and methods for operating a database using distributed memory and set operations, and for evaluating graphs stored in the database. Any system may be represented as a graph structure having nodes and edges. The graph structure is stored in a distributed memory system using a key/value schema wherein each node is stored as a key and a set of neighbor nodes is stored as the corresponding value. A short path from one node to another may be determined by traversing the graph in stages, moving outward from each node in stages until common midpoint nodes are found indicating connections between the nodes. When the midpoint nodes are found, the paths connecting the nodes may be reconstructed

    摘要翻译: 使用分布式内存和设置操作操作数据库以及评估数据库中存储的图形的系统和方法。 任何系统可以表示为具有节点和边缘的图形结构。 图形结构使用键/值模式存储在分布式存储器系统中,其中每个节点被存储为密钥,并且一组相邻节点被存储为相应的值。 从一个节点到另一个节点的短路径可以通过分阶段遍历图来确定,分阶段从每个节点向外移动,直到发现共同的中点节点指示节点之间的连接。 当找到中点节点时,可以重建连接节点的路径

    SYSTEM AND METHOD FOR SCHEMA EVOLUTION IN AN E-COMMERCE NETWORK

    公开(公告)号:US20130007595A1

    公开(公告)日:2013-01-03

    申请号:US13610706

    申请日:2012-09-11

    IPC分类号: G06F17/00

    摘要: A method and computer system are described for conducting commercial transactions. An enhanced type of XML schema may be used which supports integrity constraints and polymorphism. Schemas are identified by the use of Uniform Resource Names. XML processors residing on transaction servers or trading partner servers parse document instances by retrieving the URNs corresponding to the schemas used to interpret the document. The URNs are converted to location-dependent URIs in order to locate the schemas. URNs are resolved to location-dependent URIs by use of the LDAP protocol. URNs may be converted to LDAP URLs which are used to search LDAP compliant directories. The directories serve as registries for the URI values corresponding to the URNs.

    System and method for schema evolution in an e-commerce network
    5.
    发明授权
    System and method for schema evolution in an e-commerce network 有权
    电子商务网络中模式演进的系统和方法

    公开(公告)号:US07594167B1

    公开(公告)日:2009-09-22

    申请号:US09493517

    申请日:2000-01-28

    摘要: A method and computer system are described for conducting commercial transactions. An enhanced type of XML schema may be used which supports integrity constraints and polymorphism. Schemas are identified by the use of Uniform Resource Names. XML processors residing on transaction servers or trading partner servers parse document instances by retrieving the URNs corresponding to the schemas used to interpret the document. The URNs are converted to location-dependent URIs in order to locate the schemas. URNs are resolved to location-dependent URIs by use of the LDAP protocol. URNs may be converted to LDAP URLs which are used to search LDAP compliant directories. The directories serve as registries for the URI values corresponding to the URNs.

    摘要翻译: 描述了进行商业交易的方法和计算机系统。 可以使用支持完整性约束和多态的增强型XML模式。 通过使用统一资源名称来标识模式。 驻留在交易服务器或交易伙伴服务器上的XML处理器通过检索与用于解释文档的模式相对应的URN来解析文档实例。 URN被转换为位置相关的URI,以便定位模式。 使用LDAP协议将URN解析为与位置相关的URI。 URN可以转换为用于搜索LDAP兼容目录的LDAP URL。 这些目录用作与URN对应的URI值的注册表。

    METHODS AND SYSTEMS FOR PROCESSING GRAPHS USING DISTRIBUTED MEMORY AND SET OPERATIONS
    6.
    发明申请
    METHODS AND SYSTEMS FOR PROCESSING GRAPHS USING DISTRIBUTED MEMORY AND SET OPERATIONS 有权
    使用分布式存储器和集合操作处理图形的方法和系统

    公开(公告)号:US20120317149A1

    公开(公告)日:2012-12-13

    申请号:US13347917

    申请日:2012-01-11

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30584 G06F17/30958

    摘要: Systems and methods for operating a database using distributed memory and set operations, and for evaluating graphs stored in the database. Any system may be represented as a graph structure having nodes and edges. The graph structure is stored in a distributed memory system using a key/value schema wherein each node is stored as a key and a set of neighbor nodes is stored as the corresponding value. A short path from one node to another may be determined by traversing the graph in stages, moving outward from each node in stages until common midpoint nodes are found indicating connections between the nodes. When the midpoint nodes are found, the paths connecting the nodes may be reconstructed.

    摘要翻译: 使用分布式内存和设置操作操作数据库以及评估数据库中存储的图形的系统和方法。 任何系统可以表示为具有节点和边缘的图形结构。 图形结构使用键/值模式存储在分布式存储器系统中,其中每个节点被存储为密钥,并且一组相邻节点被存储为相应的值。 从一个节点到另一个节点的短路径可以通过分阶段遍历图来确定,分阶段从每个节点向外移动,直到发现共同的中点节点指示节点之间的连接。 当找到中点节点时,可以重建连接节点的路径。

    Facilitating distributed data processing for dynamic and efficient generation of search results in an on-demand services environment
    8.
    发明授权
    Facilitating distributed data processing for dynamic and efficient generation of search results in an on-demand services environment 有权
    促进分布式数据处理,以便在按需服务环境中动态高效地生成搜索结果

    公开(公告)号:US09424336B2

    公开(公告)日:2016-08-23

    申请号:US13963840

    申请日:2013-08-09

    IPC分类号: G06F7/00 G06F17/30

    CPC分类号: G06F17/30598

    摘要: In accordance with embodiments, there are provided mechanisms and methods for facilitating distributed data processing for dynamic and efficient generation of search results in a multi-tenant environment according to one embodiment. In one embodiment and by way of example, a method includes receiving, at a data processing platform, extracted data occurrences from a database coupled to a server computing device, where each data occurrence may be assigned a classification according to a category. The method may further include mapping values to the data occurrences based on classifications of the data occurrences, mapping prefixes to the data occurrences based on identifying names of the data occurrences, and generating search data based on the mapped values and mapped prefixes, where the search data may represent autosuggestions.

    摘要翻译: 根据实施例,根据一个实施例,提供了用于促进分布式数据处理以在多租户环境中动态和有效地生成搜索结果的机制和方法。 在一个实施例中并且作为示例,一种方法包括在数据处理平台处从耦合到服务器计算设备的数据库中接收提取的数据出现,其中每个数据发生可以根据类别被分配分类。 该方法还可以包括基于数据出现的分类将值映射到数据出现,基于识别数据出现的名称来映射前缀到数据出现,以及基于映射的值和映射的前缀生成搜索数据,其中搜索 数据可能表示自动提示。

    Methods and systems for using distributed memory and set operations to process social networks
    10.
    发明授权
    Methods and systems for using distributed memory and set operations to process social networks 有权
    使用分布式内存和设置操作来处理社交网络的方法和系统

    公开(公告)号:US08667012B2

    公开(公告)日:2014-03-04

    申请号:US13347970

    申请日:2012-01-11

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30584 G06F17/30958

    摘要: Systems and methods for managing and evaluating a social network. The social network is represented as a graph structure and stored in distributed memory. A viable path from one node that is not directly connected to another node in the graph structure may be determined by traversing the graph in stages, moving outward from each node in stages until common midpoint nodes are found providing a connection between the nodes. When midpoint nodes are found, the paths connecting the one node to the other node may be reconstructed.

    摘要翻译: 用于管理和评估社交网络的系统和方法。 社交网络被表示为图形结构并存储在分布式存储器中。 来自一个不直接连接到图结构中另一个节点的节点的可行路径可以通过遍历该图表来确定,分阶段地从每个节点向外移动,直到发现在节点之间连接的共同的中间点节点。 当找到中点节点时,可以重建连接一个节点到另一个节点的路径。