会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method and apparatus for organizing data sources
    • 组织数据源的方法和装置
    • US07529740B2
    • 2009-05-05
    • US11503713
    • 2006-08-14
    • Yuan-chi ChangLipyeow LimMin WangZhen Zhang
    • Yuan-chi ChangLipyeow LimMin WangZhen Zhang
    • G06F17/30
    • G06F17/30705Y10S707/99933Y10S707/99953
    • 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.
    • 提供了组织深度Web服务的方法。 在一个方面,该方法获得源及其相关属性和/或输入模式的集合,例如使用爬行算法。 该方法使用这些信息将资源组织到社区。 使用诸如超临界挖掘算法的挖掘算法来获得高度相关属性的集合。 使用诸如分层聚类聚类算法的聚类算法进一步将属性集合聚类成更大的团块,其在本公开中被称为签名。 与每个签名相关联的源构成社区,并构建社区的图形表示,其中顶点是社区,边是共享属性。
    • 3. 发明申请
    • METHOD AND APPARATUS FOR ORGANIZING DATA SOURCES
    • 用于组织数据源的方法和装置
    • US20080259084A1
    • 2008-10-23
    • US12163485
    • 2008-06-27
    • Yuan-chi ChangLipyeow LimMin WangZhen Zhang
    • Yuan-chi ChangLipyeow LimMin WangZhen Zhang
    • G06F17/30G06T11/20
    • G06F16/35Y10S707/99933Y10S707/99953
    • 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.
    • 提供了一种用于组织深度Web服务的方法和装置。 在一个方面,该方法和装置例如使用爬行算法获得源及其相关属性和/或输入模式的集合。 该方法和装置使用这些信息将资源组织到社区。 使用诸如超临界挖掘算法的挖掘算法来获得高度相关属性的集合。 使用诸如分层聚类聚类算法的聚类算法进一步将属性集合聚类成更大的团块,其在本公开中被称为签名。 与每个签名相关联的源构成社区,并构建社区的图形表示,其中顶点是社区,边是共享属性。
    • 4. 发明申请
    • METHOD AND SYSTEM FOR INDEXING AND SERIALIZING DATA
    • 数据索引和序列化的方法和系统
    • US20080215520A1
    • 2008-09-04
    • US11681486
    • 2007-03-02
    • Xiaohui GuLipyeow LimHaixun WangMin Wang
    • Xiaohui GuLipyeow LimHaixun WangMin Wang
    • G06N5/02
    • G06F17/30911
    • 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.
    • 本发明提供了一种用于索引数据的计算机实现的方法,装置和计算机可用程序产品。 控制器识别要索引的一组数据,其中一组数据结构树表示该组数据。 控制器将数据结构树组合成一个统一的树,其中统一树包含一组数据中每个数据单元的节点。 控制器为描述统一树中节点的数据集中的每个数据单元向节点分配一个标识符。 然后,控制器对统一树进行序列化以形成一组代表数据结构树的顺序序列,其中,该顺序序列集合形成该组数据的索引。
    • 5. 发明申请
    • Statistics collection using path-value pairs for relational databases
    • 使用关系数据库的路径值对的统计信息收集
    • US20070271218A1
    • 2007-11-22
    • US11435353
    • 2006-05-16
    • Lipyeow LimGeorge Andrei MihailaMin Wang
    • Lipyeow LimGeorge Andrei MihailaMin Wang
    • G06F17/30
    • G06F17/30442G06F17/30306Y10S707/99931Y10S707/99932Y10S707/99933Y10S707/99944Y10S707/99953
    • 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.
    • 公开了一种用于收集与数据库中的数据相关联的统计信息的方法,系统和计算机可读介质。 该方法包括确定为关系数据库中与定义的数据类型相关联的数据收集统计信息所需的存储器量。 定义的数据类型基于使用具有一个或多个根到节点路径的树结构的标记语言。 分配的内存量被确定为收集定义的数据类型的数据的统计信息。 在通过数据库的单次传递中以及已经分配的内存量中,对定义的数据类型的数据执行统计信息收集。 执行包括至少确定与给定文档集合内的给定值相关联的至少一个路径标识符的实例的总数。
    • 7. 发明授权
    • Processing queries on hierarchical markup data using shared hierarchical markup trees
    • 使用共享分层标记树处理对分层标记数据的查询
    • US08635242B2
    • 2014-01-21
    • US11548321
    • 2006-10-11
    • Lipyeow LimHaixun WangMin Wang
    • Lipyeow LimHaixun WangMin Wang
    • G06F7/00G06F17/30
    • G06F17/30929
    • 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.
    • 公开了一种用于处理查询的方法,信息处理系统和计算机可读介质。 该方法包括接收一组分层标记文档的数据查询。 从数据查询中提取至少一个查询路径表达式。 针对多个共享分层标记文档中的至少一个共享分层标记文档处理查询路径。 多个共享分层文档与分层标记文档集合相关联。 响应于完全匹配查询路径表达式的共享分层标记文档,生成数据查询的查询结果。 查询结果基于对于共享分层标记文档和差异分层标记文档中的至少一个的查询路径表达的处理。
    • 8. 发明申请
    • Method For Supporting Ontology-Related Semantic Queries in DBMSs with XML Support
    • 支持XML支持的DBMS中与本体相关的语义查询的方法
    • US20080215542A1
    • 2008-09-04
    • US11681319
    • 2007-03-02
    • Lipyeow LimHaixun WangMin Wang
    • Lipyeow LimHaixun WangMin Wang
    • G06F17/30
    • G06F17/30734G06F17/30404
    • A method for supporting semantic matching queries in a database management system (DBMS) by extracting and storing the transitive/subsumption relationships from a given ontology data in a DBMS with native XML support. These transitive relationships are transformed into a set of XML documents that are natural mappings of the hierarchical structure of the transitive relationships. A table function construct expresses semantic matching queries in a declarative manner. The semantic matching queried are automatically rewritten or translated into standard SQL/XML search operators such as XQuery, XPath and XMLExists, and executed by the SQL/XML DBMS on the given instance data and the extracted transitive relationships data.
    • 一种通过从具有本地XML支持的DBMS中的给定本体数据中提取和存储传递/包含关系来在数据库管理系统(DBMS)中支持语义匹配查询的方法。 这些传递关系被转换成一组XML文档,它们是传递关系的层次结构的自然映射。 表函数构造以声明方式表达语义匹配查询。 查询的语义匹配自动重写或转换为标准SQL / XML搜索运算符,如XQuery,XPath和XMLExists,并由SQL / XML DBMS在给定的实例数据和提取的传递关系数据上执行。
    • 9. 发明申请
    • Method and apparatus for organizing data sources
    • 组织数据源的方法和装置
    • US20080040326A1
    • 2008-02-14
    • US11503713
    • 2006-08-14
    • Yuan-chi ChangLipyeow LimMin WangZhen Zhang
    • Yuan-chi ChangLipyeow LimMin WangZhen Zhang
    • G06F17/30
    • G06F17/30705Y10S707/99933Y10S707/99953
    • 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.
    • 提供了一种用于组织深度Web服务的方法和装置。 在一个方面,该方法和装置例如使用爬行算法获得源及其相关属性和/或输入模式的集合。 该方法和装置使用这些信息将资源组织到社区。 使用诸如超临界挖掘算法的挖掘算法来获得高度相关属性的集合。 使用诸如分层聚类聚类算法的聚类算法进一步将属性集合聚类成更大的团块,其在本公开中被称为签名。 与每个签名相关联的源构成社区,并构建社区的图形表示,其中顶点是社区,边是共享属性。
    • 10. 发明授权
    • Dynamic maintenance of web indices using landmarks
    • 使用地标动态维护网络索引
    • US07299404B2
    • 2007-11-20
    • US10430049
    • 2003-05-06
    • Ramesh C. AgarwalLipyeow LimSriram K. PadmanabhanMin Wang
    • Ramesh C. AgarwalLipyeow LimSriram K. PadmanabhanMin Wang
    • G06F15/00
    • G06F17/2288G06F17/218G06F17/2247
    • A repository index records the position of document entries relative to landmark entries within the document. Landmark entries are selecting using a landmarking policy and their position relative to the document are stored in a landmark directory. During index updates, an edit transcript is generated describing the difference between old and new document versions, and both the document repository index and the landmark directory are updated as needed. Thus, the number of update operations preformed as compared with conventional indexing techniques may be substantially reduced when small, localized changes are made to the document. This is due to fact that the positions of document entries are recorded relative to the landmark entries rather than the document itself. By doing so, the document index becomes more shift-invariant, requiring fewer update operations when entries are added or inserted in localized areas of the document.
    • 存储库索引记录文档条目相对于文档中的地标条目的位置。 地标条目正在使用标记政策进行选择,并且相对于文档的位置将存储在地标目录中。 在索引更新期间,生成描述旧文档版本和新文档版本之间的差异的编辑脚本,并根据需要更新文档存储库索引和地标目录。 因此,与传统的索引技术相比,执行的更新操作的数量可以在对文档进行小的局部改变时被显着地减少。 这是因为文件条目的位置相对于里程碑条目而不是文档本身被记录。 通过这样做,文档索引变得越来越不变,当在文档的本地化区域中添加或插入条目时,需要更少的更新操作。