公开(公告)号：US07529740B2

公开(公告)日：2009-05-05

申请号：US11503713

申请日：2006-08-14

Applicant: Yuan-chi Chang ,  Lipyeow Lim ,  Min Wang ,  Zhen Zhang

Inventor： Yuan-chi Chang ,  Lipyeow Lim ,  Min Wang ,  Zhen Zhang

IPC: G06F17/30

CPC classification number: G06F17/30705 ,  Y10S707/99933 ,  Y10S707/99953

Abstract: A method for organizing deep Web services is provided. In one aspect, the method obtains a collection of sources and their associated attributes and/or input modes, for instance, using a crawling algorithm. The method uses this information to organize the sources into communities. A mining algorithm such as the hyperclique mining algorithm is used to obtain cliques of highly correlated attributes. A clustering algorithm such as the hierarchical agglomerative clustering algorithm is used to further cluster the cliques of attributes into larger cliques, which in the present disclosure is referred to as signatures. The sources that are associated with each signature form a community and a graph representation of the communities is constructed, where the vertices are communities and the edges are the shared attributes.

Abstract translation: 提供了组织深度Web服务的方法。 在一个方面，该方法获得源及其相关属性和/或输入模式的集合，例如使用爬行算法。 该方法使用这些信息将资源组织到社区。 使用诸如超临界挖掘算法的挖掘算法来获得高度相关属性的集合。 使用诸如分层聚类聚类算法的聚类算法进一步将属性集合聚类成更大的团块，其在本公开中被称为签名。 与每个签名相关联的源构成社区，并构建社区的图形表示，其中顶点是社区，边是共享属性。

公开(公告)号：US20080270367A1

公开(公告)日：2008-10-30

申请号：US12173545

申请日：2008-07-15

Applicant: Yuan-chi Chang ,  Lipyeow Lim ,  Min Wang ,  Zhen Zhang

Inventor： Yuan-chi Chang ,  Lipyeow Lim ,  Min Wang ,  Zhen Zhang

IPC: G06F17/30

CPC classification number: G06F16/958 ,  Y10S707/99933

Abstract: A system and method for searching deep web services are provided. The system and method in one aspect allow organizing communities, sources and schema attributes in a multi-tier containment relationship; searching representative schema attributes in one or more communities; searching representative services in one or more communities; searching for related schema attributes; and searching for related communities.

Abstract translation: 提供了一种用于搜索深度Web服务的系统和方法。 一方面的系统和方法允许在多层遏制关系中组织社区，来源和模式属性; 在一个或多个社区中搜索代表性模式属性; 在一个或多个社区寻找代表服务; 搜索相关的模式属性; 并搜索相关社区。

公开(公告)号：US20080259084A1

公开(公告)日：2008-10-23

申请号：US12163485

申请日：2008-06-27

Applicant: Yuan-chi Chang ,  Lipyeow Lim ,  Min Wang ,  Zhen Zhang

Inventor： Yuan-chi Chang ,  Lipyeow Lim ,  Min Wang ,  Zhen Zhang

IPC: G06F17/30 ,  G06T11/20

CPC classification number: G06F16/35 ,  Y10S707/99933 ,  Y10S707/99953

Abstract: A method and apparatus for organizing deep Web services are provided. In one aspect, the method and apparatus obtains a collection of sources and their associated attributes and/or input modes, for instance, using a crawling algorithm. The method and apparatus uses this information to organize the sources into communities. A mining algorithm such as the hyperclique mining algorithm is used to obtain cliques of highly correlated attributes. A clustering algorithm such as the hierarchical agglomerative clustering algorithm is used to further cluster the cliques of attributes into larger cliques, which in the present disclosure is referred to as signatures. The sources that are associated with each signature form a community and a graph representation of the communities is constructed, where the vertices are communities and the edges are the shared attributes.

Abstract translation: 提供了一种用于组织深度Web服务的方法和装置。 在一个方面，该方法和装置例如使用爬行算法获得源及其相关属性和/或输入模式的集合。 该方法和装置使用这些信息将资源组织到社区。 使用诸如超临界挖掘算法的挖掘算法来获得高度相关属性的集合。 使用诸如分层聚类聚类算法的聚类算法进一步将属性集合聚类成更大的团块，其在本公开中被称为签名。 与每个签名相关联的源构成社区，并构建社区的图形表示，其中顶点是社区，边是共享属性。

公开(公告)号：US20080215520A1

公开(公告)日：2008-09-04

申请号：US11681486

申请日：2007-03-02

Applicant: Xiaohui Gu ,  Lipyeow Lim ,  Haixun Wang ,  Min Wang

Inventor： Xiaohui Gu ,  Lipyeow Lim ,  Haixun Wang ,  Min Wang

IPC: G06N5/02

CPC classification number: G06F17/30911

Abstract: The present invention provides a computer implemented method, an apparatus, and a computer usable program product for indexing data. A controller identifies a set of data to be indexed, wherein a set of data structure trees represents the set of data. The controller merges the set of data structure trees to form a unified tree, wherein the unified tree contains a node for each unit of data in the set of data. The controller assigns an identifier to the node for each unit of data in the set of data that describes the node within the unified tree. The controller then serializes the unified tree to form a set of sequential series that represents the set of data structure trees, wherein the set of sequential series forms an index for the set of data.

Abstract translation: 本发明提供了一种用于索引数据的计算机实现的方法，装置和计算机可用程序产品。 控制器识别要索引的一组数据，其中一组数据结构树表示该组数据。 控制器将数据结构树组合成一个统一的树，其中统一树包含一组数据中每个数据单元的节点。 控制器为描述统一树中节点的数据集中的每个数据单元向节点分配一个标识符。 然后，控制器对统一树进行序列化以形成一组代表数据结构树的顺序序列，其中，该顺序序列集合形成该组数据的索引。

公开(公告)号：US20080183657A1

公开(公告)日：2008-07-31

申请号：US11627475

申请日：2007-01-26

Applicant: Yuan-Chi Chang ,  Lipyeow Lim ,  George Andrei Mihaila

Inventor： Yuan-Chi Chang ,  Lipyeow Lim ,  George Andrei Mihaila

IPC: G06F17/30 ,  G06F7/00 ,  G06F17/00 ,  G06F3/00

CPC classification number: G06F16/83

Abstract: A computer implemented method, data processing system, and computer usable program code are provided for accessing unique hierarchical data. A tree structure for a document is analyzed. A determination is made as to whether a set of unique paths exist in the tree structure. Responsive to an existence of the set of unique paths, a unique path identifier is assigned to each of the set of unique paths to create a set of unique path identifiers and assigned unique path pairs. Then, the unique path identifier and a node address for the unique hierarchical data for each of the set of unique path identifiers and assigned unique path pairs is stored into a header in the document disk page.

Abstract translation: 提供计算机实现的方法，数据处理系统和计算机可用程序代码用于访问唯一分层数据。 分析文档的树结构。 确定树结构中是否存在一组唯一路径。 响应于唯一路径集合的存在，将唯一路径标识符分配给每组唯一路径，以创建一组唯一的路径标识符和分配的唯一路径对。 然后，唯一路径标识符和用于唯一路径标识符集合和分配的唯一路径对中的每一个的唯一分层数据的节点地址被存储在文档盘页面中的报头中。

公开(公告)号：US20070271218A1

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

申请号：US11435353

申请日：2006-05-16

Applicant: Lipyeow Lim ,  George Andrei Mihaila ,  Min Wang

Inventor： Lipyeow Lim ,  George Andrei Mihaila ,  Min Wang

IPC: G06F17/30

CPC classification number: G06F17/30442 ,  G06F17/30306 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99944 ,  Y10S707/99953

Abstract: A method, system, and computer readable medium for collecting statistics associated with data in a database are disclosed. The method comprises determining an amount of memory needed to collect statistics for data associated with a defined data type in a relational database. The defined data type is based upon a mark-up language using a tree structure with one or more root-to-node paths therein. The amount of memory is allocated as determined for collecting the statistics for the data of the defined data type. A statistics collection is performed for the data of the defined data type in a single pass through the database and within the amount of memory which has been allocated. The performing includes at least determining a total number of instances of at least one path-identifier associated with a given value within a given set of documents.

Abstract translation: 公开了一种用于收集与数据库中的数据相关联的统计信息的方法，系统和计算机可读介质。 该方法包括确定为关系数据库中与定义的数据类型相关联的数据收集统计信息所需的存储器量。 定义的数据类型基于使用具有一个或多个根到节点路径的树结构的标记语言。 分配的内存量被确定为收集定义的数据类型的数据的统计信息。 在通过数据库的单次传递中以及已经分配的内存量中，对定义的数据类型的数据执行统计信息收集。 执行包括至少确定与给定文档集合内的给定值相关联的至少一个路径标识符的实例的总数。

公开(公告)号：US20070271217A1

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

申请号：US11435017

申请日：2006-05-16

Applicant: Lipyeow Lim ,  George Andrei Mihaila ,  Min Wang

Inventor： Lipyeow Lim ,  George Andrei Mihaila ,  Min Wang

IPC: G06F17/30

CPC classification number: G06F17/30536 ,  G06F17/30442 ,  G06F17/30935 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99944 ,  Y10S707/99953

Abstract: Disclosed are a system, method, and computer readable medium for collecting statistics associated with data in a database. The method comprises determining an amount of memory needed to collect statistics for data associated with a defined data type in a relational database. The defined data type is based upon a mark-up language using a tree structure with one or more root-to-node paths therein. The amount of memory as determined is allocated for collecting the statistics for the data of the defined data type. A statistics collection is performed for the data of the defined data type in a single pass through the database and within the amount of memory which has been allocated.

Abstract translation: 公开了用于收集与数据库中的数据相关联的统计信息的系统，方法和计算机可读介质。 该方法包括确定为关系数据库中与定义的数据类型相关联的数据收集统计信息所需的存储器量。 定义的数据类型基于使用具有一个或多个根到节点路径的树结构的标记语言。 分配所确定的内存量用于收集所定义数据类型的数据的统计信息。 在通过数据库的单次传递中以及已分配的内存量内，对定义的数据类型的数据执行统计信息收集。

公开(公告)号：US08635242B2

公开(公告)日：2014-01-21

申请号：US11548321

申请日：2006-10-11

Applicant: Lipyeow Lim ,  Haixun Wang ,  Min Wang

Inventor： Lipyeow Lim ,  Haixun Wang ,  Min Wang

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F17/30929

Abstract: Disclosed are a method, information processing system, and computer readable medium for processing queries. The method includes receiving a data query for a set of hierarchical markup documents. At least one query path expression is extracted from the data query. The query path is processed against at least one shared hierarchical markup document in a plurality of shared hierarchical markup documents. The plurality of shared hierarchical documents is associated with the set of hierarchical markup documents. In response to the shared hierarchical markup document completely matching the query path expression, a query result for the data query is generated. The query result is based on the processing of the query path expression against at least one of the shared hierarchical markup document and the difference hierarchical markup document.

Abstract translation: 公开了一种用于处理查询的方法，信息处理系统和计算机可读介质。 该方法包括接收一组分层标记文档的数据查询。 从数据查询中提取至少一个查询路径表达式。 针对多个共享分层标记文档中的至少一个共享分层标记文档处理查询路径。 多个共享分层文档与分层标记文档集合相关联。 响应于完全匹配查询路径表达式的共享分层标记文档，生成数据查询的查询结果。 查询结果基于对于共享分层标记文档和差异分层标记文档中的至少一个的查询路径表达的处理。

公开(公告)号：US08423522B2

公开(公告)日：2013-04-16

申请号：US12984324

申请日：2011-01-04

Applicant: Christian A. Lang ,  Lipyeow Lim

Inventor： Christian A. Lang ,  Lipyeow Lim

IPC: G06F17/00 ,  G06F7/00

CPC classification number: G06F17/30501 ,  G06F3/064 ,  G06F17/30135 ,  G06F17/30498 ,  G06F17/30569 ,  G06F17/30589

Abstract: A method is provided for compressing results of a join query. A join order of a result set comprising multiple tuples is determined from the join query, and a nested hierarchy of dictionaries is maintained based on the join order. The nested hierarchy of dictionaries is used to encode each of the tuples of the result set so as to produce an encode tuple, and each of the encoded tuples is transmitted to a client system. Also provided is a method for decompressing results of a join query.

Abstract translation: 提供了一种压缩连接查询结果的方法。 从连接查询确定包含多个元组的结果集合的连接顺序，并且基于连接顺序来维护字典的嵌套层次结构。 字典的嵌套层次结构用于对结果集的每个元组进行编码，以便产生一个编码元组，并将每个编码的元组传送给客户端系统。 还提供了一种解压缩连接查询结果的方法。

公开(公告)号：US07895152B2

公开(公告)日：2011-02-22

申请号：US12273629

申请日：2008-11-19

Applicant: Pu Huang ,  Hui Lei ,  Lipyeow Lim

Inventor： Pu Huang ,  Hui Lei ,  Lipyeow Lim

IPC: G06F17/30

CPC classification number: G06Q10/06 ,  Y10S707/99933

Abstract: A metric network provides a descriptive model that explicitly expresses the relationships among all metrics of a business enterprise. Performance of each single business entity in the operational level is measured by a set of primitive metrics, each of which measures a specific aspect of the business entity. The primitive metrics construct the base on which the whole metric network is built.

Abstract translation: 度量网络提供了明确表达企业所有度量标准之间关系的描述性模型。 运营级别中每个单一业务实体的绩效由一组原始度量衡量，每个度量衡量业务实体的特定方面。 原始度量构建了构建整个度量网络的基础。