专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US09075734B2 Method for updating betweenness centrality of graph 有权
标题翻译：更新图的中心性的方法
公开(公告)号：US09075734B2
公开(公告)日：2015-07-07
申请号：US13566313
申请日：2012-08-03
申请人： Min Joong Lee , Jung Min Lee , Jaimie Y. Park , Ryan H. Choi , Chin Wan Chung
发明人： Min Joong Lee , Jung Min Lee , Jaimie Y. Park , Ryan H. Choi , Chin Wan Chung
IPC分类号： G06F17/10
CPC分类号： G06F17/10
摘要： The present invention provides a method for updating betweenness centrality of a graph, which obtains the betweenness centrality of an unweighted graph, which is updated when edges are updated. First of all, the method is performed by obtaining a minimum union cycle (an MUC) of the updated graph, and extracting an MUC (MUCU) containing a vertex, which is incident to the updated edge. And a first betweenness centrality due to the shortest paths in the MUCU, and a second betweenness centrality due to the shortest paths, not included in the MUCU, are calculated. And finally, a final betweenness centrality of the graph is obtained by adding the first and second betweenness centralities. By using the method, the search space and calculation cost can be remarkably reduced.
摘要翻译：本发明提供了一种用于更新图形的中心性的方法，其获得未加权图的中间性，当边缘被更新时被更新。首先，通过获得更新图的最小联合周期（MUC），并且提取包含入更新边缘的顶点的MUC（MUCU）来执行该方法。并且计算出由MUCU中最短路径引起的第一个中间性以及不包含在MUCU中的由最短路径引起的第二个中间性。最后，通过添加第一和第二中间集中度来获得图的最终中间性。通过使用该方法，可以显着降低搜索空间和计算成本。

2. 发明申请

US20090256685A1 DATA STORAGE METHOD AND QUERY PROCESSING METHOD FOR SUPPLY CHAIN MANAGEMENT USING RFID, AND SUPPLY CHAIN DATA MANAGEMENT SYSTEM USING RFID 审中-公开
标题翻译：使用RFID的供应链管理的数据存储方法和查询处理方法以及使用RFID的供应链数据管理系统
公开(公告)号：US20090256685A1
公开(公告)日：2009-10-15
申请号：US12200078
申请日：2008-08-28
申请人： Chin-Wan Chung , Chun-Hee Lee
发明人： Chin-Wan Chung , Chun-Hee Lee
IPC分类号： H04Q5/22
CPC分类号： H04Q9/00 , G06Q10/08 , H04Q2209/47
摘要： Provided are a method which stores data using a path encoding scheme and a region numbering scheme for supply chain management using RFID, a method which processes queries about data stored by the data storage method, and a data management system which manages data for the management of the supply chain using RFID by the data storage method and the query processing method. A massive amount of RFID data generated in supply chain management using the RFID can effectively be stored, and information of the movement path of any product can be obtained from the stored data easily and quickly.
摘要翻译：提供了一种使用路径编码方案和使用RFID的供应链管理的区域编号方案来存储数据的方法，处理对由数据存储方法存储的数据的查询的方法，以及管理用于管理数据的数据的数据管理系统供应链采用RFID的数据存储方法和查询处理方法。可以有效地存储在使用RFID的供应链管理中产生的大量RFID数据，并且可以从存储的数据中容易且快速地获得任何产品的移动路径的信息。

3. 发明授权

US07539692B2 Method of performing queriable XML compression using reverse arithmetic encoding and type inference engine 失效
标题翻译：使用反向算术编码和类型推理引擎执行可疑XML压缩的方法
公开(公告)号：US07539692B2
公开(公告)日：2009-05-26
申请号：US10860292
申请日：2004-06-03
申请人： Jun-Ki Min , Myung-Jae Park , Chin-Wan Chung
发明人： Jun-Ki Min , Myung-Jae Park , Chin-Wan Chung
IPC分类号： G06F17/30
CPC分类号： G06F17/2205 , Y10S707/99942
摘要： A method and apparatus for performing queriable XML compression and queries related to a compressed XML document are disclosed. In the method, information, including at least the frequencies of the respective tags of XML data, the type information of data values and data value-related statistical information is collected. Thereafter, the type information of data values of elements is inferred according to tags using an automatic data type inference engine algorithm. Reverse arithmetic encoding is performed on the tags and paths of elements. The data values are encoded based on the inferred type information.
摘要翻译：公开了一种用于执行可压缩XML压缩和与压缩XML文档相关的查询的方法和装置。在该方法中，收集至少包括XML数据的各个标签的频率，数据值的类型信息和与数据值相关的统计信息的信息。此后，使用自动数据类型推理引擎算法，根据标签推断元素的数据值的类型信息。对元素的标签和路径执行反向算术编码。基于推断的类型信息对数据值进行编码。

4. 发明授权

US07318053B1 Indexing system and method for nearest neighbor searches in high dimensional data spaces 有权
标题翻译：高维数据空间中最近邻搜索的索引系统和方法
公开(公告)号：US07318053B1
公开(公告)日：2008-01-08
申请号：US09512949
申请日：2000-02-25
申请人： Guang-Ho Cha , Chin-Wan Chung , Dragutin Petkovic , Xiaoming Zhu
发明人： Guang-Ho Cha , Chin-Wan Chung , Dragutin Petkovic , Xiaoming Zhu
IPC分类号： G06F7/00
CPC分类号： G06F17/30979 , G06K9/627 , Y10S707/99931
摘要： Vectors representing objects in n-dimensional space are approximated by local polar coordinates on partitioned cells of the data space in response to a query, e.g., a query data vector entered with a request to find “k” nearest neighbors to the query vector. A set of candidate near neighbors is generated using the approximations, with the local polar coordinates being independent of the dimensionality of the data space. Then, an answer set of near neighbors is returned in response to the query. Thus, the present invention acts as a filter to reduce the number of actual data vectors in the data set that must be considered in responding to the query.
摘要翻译：表示n维空间中的对象的向量由数据空间的分区单元上的响应于查询的局部极坐标近似，例如，以查询向量输入的查询数据向量输入查询向量的最近邻“k”。使用近似生成邻近邻近的一组候选，其中局部极坐标与数据空间的维数无关。然后，响应于查询返回近邻的答案集。因此，本发明用作滤波器，以减少在响应查询时必须考虑的数据集中的实际数据向量的数量。

5. 发明授权

US07260572B2 Method of processing query about XML data using APEX 失效
标题翻译：使用APEX处理关于XML数据的查询的方法
公开(公告)号：US07260572B2
公开(公告)日：2007-08-21
申请号：US10453682
申请日：2003-06-02
申请人： Jun-Ki Min , Kyuseok Shim , Chin-Wan Chung
发明人： Jun-Ki Min , Kyuseok Shim , Chin-Wan Chung
IPC分类号： G06F17/30
CPC分类号： G06F17/30911 , G06F17/30929 , Y10S707/99932 , Y10S707/99935
摘要： A method of processing a query about an Extensible Markup Language (XML) data. The XML query processing method includes the first step of representing the XML data in the form of an XML graph, the second step of creating and updating an Adaptive Path indEX (APEX) based on frequently used paths extracted from previously processed XML queries and the XML graph, and the third step of processing an XML query using the APEX. The XML query processing is capable of improving the performance of processing the query by extracting frequently used paths from path expressions having been used as queries for XML data and updating the APEX through the use of the frequently used paths.
摘要翻译：一种处理关于可扩展标记语言（XML）数据的查询的方法。 XML查询处理方法包括以XML图形的形式表示XML数据的第一步骤，基于从先前处理过的XML查询提取的经常使用的路径和XML的创建和更新自适应路径indEX（APEX）的第二步骤图表，以及使用APEX处理XML查询的第三步。 XML查询处理能够通过从已被用作XML数据查询的路径表达式中提取经常使用的路径并通过使用经常使用的路径来更新APEX，从而提高处理查询的性能。

6. 发明授权

US07072891B2 Apparatus and method for hyper-rectangle based multidimensional data segmentation and clustering 失效
标题翻译：基于超矩形的多维数据分割和聚类的装置和方法
公开(公告)号：US07072891B2
公开(公告)日：2006-07-04
申请号：US10106076
申请日：2002-03-22
申请人： Seok-Lyong Lee , Seok-Ju Chun , Deok-Hwan Kim , Chin-Wan Chung
发明人： Seok-Lyong Lee , Seok-Ju Chun , Deok-Hwan Kim , Chin-Wan Chung
IPC分类号： G06F17/30
CPC分类号： G06K9/6218 , Y10S707/99933 , Y10S707/99936
摘要： An apparatus and method for performing similarity searches using hyper-rectangle based multidimensional data segmentation partitions a data set representable by a multidimensional data sequence, such as a video stream, into segments in consideration of the temporal relationship between points, and groups similar segments in one sequence into the same cluster so as to efficiently search a database for a multidimensional data sequence similar to a given query sequence.
摘要翻译：一种用于使用基于超矩形的多维数据分段来执行相似性搜索的装置和方法，其将由多维数据序列（例如视频流）表示的数据集分为考虑到点之间的时间关系的分段，并且分组中的相似分段序列到相同的集群中，以便有效地搜索数据库以获得类似于给定查询序列的多维数据序列。

7. 发明申请

US20050086639A1 Method of performing queriable XML compression using reverse arithmetic encoding and type inference engine 失效
标题翻译：使用反向算术编码和类型推理引擎执行可疑XML压缩的方法
公开(公告)号：US20050086639A1
公开(公告)日：2005-04-21
申请号：US10860292
申请日：2004-06-03
申请人： Jun-Ki Min , Myung-Jae Park , Chin-Wan Chung
发明人： Jun-Ki Min , Myung-Jae Park , Chin-Wan Chung
IPC分类号： G06F17/00 , G06F9/44 , G06F17/22
CPC分类号： G06F17/2205 , Y10S707/99942
摘要： A method and apparatus for performing queriable XML compression and queries related to a compressed XML document are disclosed. In the method, information, including at least the frequencies of the respective tags of XML data, the type information of data values and data value-related statistical information is collected. Thereafter, the type information of data values of elements is inferred according to tags using an automatic data type inference engine algorithm. Reverse arithmetic encoding is performed on the tags and paths of elements. The data values are encoded based on the inferred type information.
摘要翻译：公开了一种用于执行可压缩XML压缩和与压缩XML文档相关的查询的方法和装置。在该方法中，收集至少包括XML数据的各个标签的频率，数据值的类型信息和与数据值有关的统计信息的信息。此后，使用自动数据类型推理引擎算法，根据标签推断元素的数据值的类型信息。对元素的标签和路径执行反向算术编码。基于推断的类型信息对数据值进行编码。

8. 发明授权

US06311181B1 Multi-dimensional selectivity estimation method using compressed histogram information 失效
标题翻译：使用压缩直方图信息的多维选择性估计方法
公开(公告)号：US06311181B1
公开(公告)日：2001-10-30
申请号：US09273131
申请日：1999-03-19
申请人： Ju-Hong Lee , Deok-Hwan Kim , Chin-Wan Chung
发明人： Ju-Hong Lee , Deok-Hwan Kim , Chin-Wan Chung
IPC分类号： G06F700
CPC分类号： G06F17/30592 , G06F17/30469 , G06F17/30536 , Y10S707/99932 , Y10S707/99935
摘要： Disclosed is a multi-dimensional selectivity estimation method using compressed histogram information which the database query optimizer in a database management system uses to find the most efficient execution plan among all possible plans. The method includes the several steps to generate a large number of small-sized multi-dimensional histogram buckets, sampling DCT coefficients which have high values with high probability, compressing information from the multi-dimensional histogram buckets using a multi-dimensional discrete cosine transform(DCT) and storing compressed information, and estimating the query selectivity by using compressed and stored histogram information as the statistics.
摘要翻译：公开了使用压缩直方图信息的多维选择性估计方法，数据库管理系统中的数据库查询优化器用于在所有可能的计划中找到最有效的执行计划。该方法包括生成大量小尺寸多维直方图桶的几个步骤，以高概率对具有高值的DCT系数进行采样，使用多维离散余弦变换来压缩来自多维直方图桶的信息（ DCT）并且存储压缩信息，并且通过使用压缩和存储的直方图信息作为统计来估计查询选择性。

9. 发明授权

US07761472B2 Indexing system and method for nearest neighbor searches in high dimensional data spaces 有权
标题翻译：高维数据空间中最近邻搜索的索引系统和方法
公开(公告)号：US07761472B2
公开(公告)日：2010-07-20
申请号：US11869189
申请日：2007-10-09
申请人： Guang-Ho Cha , Chin-Wan Chung , Dragutin Petkovic , Xiaoming Zhu
发明人： Guang-Ho Cha , Chin-Wan Chung , Dragutin Petkovic , Xiaoming Zhu
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30979 , G06K9/627 , Y10S707/99931
摘要： Vectors representing objects in n-dimensional space are approximated by local polar coordinates on partitioned cells of the data space in response to a query, e.g., a query data vector entered with a request to find “k” nearest neighbors to the query vector. A set of candidate near neighbors is generated using the approximations, with the local polar coordinates being independent of the dimensionality of the data space. Then, an answer set of near neighbors is returned in response to the query. Thus, the present invention acts as a filter to reduce the number of actual data vectors in the data set that must be considered in responding to the query.
摘要翻译：表示n维空间中的对象的向量由数据空间的分区单元上的响应于查询的局部极坐标近似，例如，以查询向量输入的查询数据向量输入查询向量的最近邻“k”。使用近似生成邻近邻近的一组候选，其中局部极坐标与数据空间的维数无关。然后，响应于查询返回近邻的答案集。因此，本发明用作滤波器以减少在响应该查询时必须考虑的数据集中的实际数据向量的数量。

10. 发明授权

US07177854B2 Dynamic update cube and hybrid query search method for range-sum queries 失效
标题翻译：用于范围和查询的动态更新多维数据集和混合查询搜索方法
公开(公告)号：US07177854B2
公开(公告)日：2007-02-13
申请号：US10120535
申请日：2002-04-09
申请人： Seok-Ju Chun , Chin-Wan Chung , Ju-Hong Lee , Seok-Lyong Lee
发明人： Seok-Ju Chun , Chin-Wan Chung , Ju-Hong Lee , Seok-Lyong Lee
IPC分类号： G06F17/30
CPC分类号： G06F17/30489 , G06F17/30327 , G06F17/30333 , G06F17/30457 , Y10S707/958 , Y10S707/99932 , Y10S707/99933
摘要： Disclosed herein is a dynamic update cube and hybrid query search method for range-sum queries. The present invention relates to a hybrid query search method, which provides a precise answer or an approximate answer with respect to On-Line Analytic Processing (OLAP) queries by using a delta (Δ)-tree, which has a multidimensional index structure and a prefix-sum cube, so as to effectively support range-sum queries widely used in opinion decisions in enterprises. In the dynamic update cube and hybrid query search method for range-sum queries, a prefixed-sum cube is dense and the dynamic update cube is sparse, such that whenever a data cube changes, the prefixed sum cube is not directly updated and instead, the changes of the data cube are stored in a Δ-Tree and the Δ-Tree is managed.
摘要翻译：这里公开了一种用于范围和查询的动态更新立方体和混合查询搜索方法。本发明涉及一种混合查询搜索方法，其通过使用具有多维索引结构的增量（Delta）树，提供关于在线分析处理（OLAP）查询的精确答案或近似答案，前缀和立方体，以便有效地支持企业中广泛使用的意见决策中的范围和查询。在范围和查询的动态更新多维数据集和混合查询搜索方法中，前缀和多维数据集是密集的，并且动态更新多维数据集是稀疏的，这样每当数据立方体更改时，前缀和多维数据集不会直接更新，数据多维数据集的更改存储在三角树中，并且管理三角树。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式