公开(公告)号：US20070271243A1

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

申请号：US11780095

申请日：2007-07-19

申请人： Wei Fan ,  Haixun Wang ,  Philip Yu

发明人： Wei Fan ,  Haixun Wang ,  Philip Yu

IPC分类号： G06F17/30

CPC分类号： G06F17/30911 ,  Y10S707/99933 ,  Y10S707/99943

摘要： The present invention provides a ViST (or “virtual suffix tree”), which is a novel index structure for searching XML documents. By representing both XML documents and XML queries in structure-encoded sequences, it is shown that querying XML data is equivalent to finding (non-contiguous) subsequence matches. A variety of XML queries, including those with branches, or wild-cards (‘*’ and ‘//’), can be expressed by structure-encoded sequences. Unlike index methods that disassemble a query into multiple sub-queries, and then join the results of these sub-queries to provide the final answers, ViST uses tree structures as the basic unit of query to avoid expensive join operations. Furthermore, ViST provides a unified index on both content and structure of the XML documents, hence it has a performance advantage over methods indexing either just content or structure. ViST supports dynamic index update, and it relies solely on B+Trees without using any specialized data structures that are not well supported by common database management systems (hereinafter referred to as “DBMSs”).

摘要翻译： 本发明提供了一种ViST（或“虚拟后缀树”），其是用于搜索XML文档的新型索引结构。 通过在结构编码序列中同时表示XML文档和XML查询，显示查询XML数据等同于查找（非连续）子序列匹配。 各种XML查询（包括具有分支的查询）或通配符（'*'和'//'）可以由结构编码的序列表示。 不同于将查询反汇编成多个子查询的索引方法，然后加入这些子查询的结果以提供最终答案，ViST使用树结构作为查询的基本单位，以避免昂贵的连接操作。 此外，ViST为XML文档的内容和结构提供了一个统一的索引，因此与仅通过内容或结构索引方法相比，它具有性能优势。 ViST支持动态索引更新，它仅仅依赖于B＆lt; +＆gt;树，而不使用通用数据库管理系统（以下简称“DBMS”）不能很好支持的任何专门的数据结构。

公开(公告)号：US20070260563A1

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

申请号：US11405233

申请日：2006-04-17

申请人： Wei Fan ,  Philip Yu

发明人： Wei Fan ,  Philip Yu

IPC分类号： G06F15/18

CPC分类号： G06N20/00

摘要： The method trains an inductive model to output multiple models from the inductive model and trains an error correlation model to estimate an average output of predictions made by the multiple models. Then the method can determine an error estimation of each of the multiple models using the error correlation model.

摘要翻译： 该方法训练一个归纳模型，从感应模型中输出多个模型，并训练一个误差相关模型，以估计多个模型所做出的预测的平均输出。 然后，该方法可以使用误差相关模型来确定多个模型中的每一个的误差估计。

公开(公告)号：US20060287984A1

公开(公告)日：2006-12-21

申请号：US11155221

申请日：2005-06-17

申请人： Shyh-Kwei Chen ,  Kun-Lung Wu ,  Philip Yu

发明人： Shyh-Kwei Chen ,  Kun-Lung Wu ,  Philip Yu

IPC分类号： G06F17/30

CPC分类号： G06F17/30516 ,  G06F17/30241 ,  G06F17/30312 ,  G06F17/30463

摘要： Range query techniques are disclosed for use in accordance with data stream processing systems. In one aspect of the invention, a technique is provided for indexing continual range queries for use in data stream processing. For example, a technique for use in processing a data stream comprises obtaining at least one range query to be associated with the data stream, and building a range query index based on the at least one range query using one or more virtual constructs such that the query index is adaptive to one or more changes in a distribution of range query sizes. The step/operation of building the range query index may further comprise building the range query index such that the range query index accommodates one or more changes in query positions outside a monitoring area of the at least one range query. In another aspect of the invention, a technique is provided for incrementally processing continual range queries against moving objects. For example, a technique for evaluating one and more continual range queries over one and more moving objects comprises maintaining a query index with one and more containment-encoded virtual constructs associated with the one and more continual range queries over the one and more moving objects, and incrementally evaluating the one or more continual range queries using the query index.

公开(公告)号：US20060271304A1

公开(公告)日：2006-11-30

申请号：US11141548

申请日：2005-05-31

申请人： Hao He ,  Haixun Wang ,  Philip Yu

发明人： Hao He ,  Haixun Wang ,  Philip Yu

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

CPC分类号： G06F16/9027 ,  G16B5/00

摘要： A method which identifies different types of substructures within a graph and encodes them using techniques suitable to the characteristics of each of them. The method is embodied by an efficient two-phase algorithm, where the first phase identifies and encodes strongly connected components as well as tree substructures, and the second phase encodes the remaining reachability relationships by compressing dense rectangular submatrices in the transitive closure matrix.

摘要翻译： 一种识别图形内不同类型的子结构的方法，并使用适合于它们每个特征的技术对它们进行编码。 该方法由有效的两相算法体现，其中第一阶段识别和编码强连接的分量以及树状子结构，第二阶段通过压缩传递闭包矩阵中的密集矩形子矩阵来编码剩余的可达性关系。

公开(公告)号：US20060224356A1

公开(公告)日：2006-10-05

申请号：US11096485

申请日：2005-03-31

申请人： Vittorio Castelli ,  Michail Vlaschos ,  Philip Yu

发明人： Vittorio Castelli ,  Michail Vlaschos ,  Philip Yu

IPC分类号： G06F15/00

CPC分类号： G06K9/00523 ,  Y10S706/90 ,  Y10S707/99936 ,  Y10S707/99937 ,  Y10S707/99945 ,  Y10S707/99953

摘要： Arrangements and methods for performing structural clustering between different time series. Time series data relating to a plurality of time series is accepted, structural features relating to the time series data are ascertained, and at least one distance between different time series via employing the structural features is determined. The different time series may be partitioned into clusters based on the at least one distance, and/or the k closest matches to a given time series query based on the at least one distance may be returned.

摘要翻译： 在不同时间序列之间进行结构聚类的布置和方法。 接收与多个时间序列相关的时间序列数据，确定与时间序列数据相关的结构特征，并且确定通过采用结构特征的不同时间序列之间的至少一个距离。 可以基于至少一个距离将不同的时间序列划分成簇，并且可以返回基于至少一个距离的/或与给定时间序列查询的k个最接近的匹配。

公开(公告)号：US20060212337A1

公开(公告)日：2006-09-21

申请号：US11080484

申请日：2005-03-16

申请人： Jamshid Vayghan ,  Philip Yu

发明人： Jamshid Vayghan ,  Philip Yu

IPC分类号： G06F17/30

CPC分类号： G06Q30/00 ,  G06Q10/063112 ,  G06Q30/0201 ,  G06Q30/0204

摘要： A method (and system) of assigning a sales opportunity, includes creating an assignment model based on clustering historical sales opportunities, and providing a scoring mechanism on a plurality of sales agents for automatically optimizing an assignment of at least one sales opportunity to at least one of the plurality of sales agents.

摘要翻译： 分配销售机会的方法（和系统）包括基于聚集历史销售机会创建分配模型，以及在多个销售代理上提供评分机制，以自动优化至少一个销售机会的分配至少一个 的多个销售代理。

公开(公告)号：US20060161575A1

公开(公告)日：2006-07-20

申请号：US11035889

申请日：2005-01-14

申请人： Wei Fan ,  Haixun Wang ,  Philip Yu

发明人： Wei Fan ,  Haixun Wang ,  Philip Yu

IPC分类号： G06F7/00

CPC分类号： G06F17/30935 ,  Y10S707/99933 ,  Y10S707/99936

摘要： Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answered holistically through subsequence matching. Herein, there is addresed the problem of query equivalence with respect to this transformation, and thereis introduced a performance-oriented principle for sequencing tree structures. With query equivalence, XML queries can be performed through subsequence matching without join operations, post-processing, or other special handling for problems such as false alarms. There is identified a class of sequencing methods for this purpose, and there is presented a novel subsequence matching algorithm that observe query equivalence. Also introduced is a performance-oriented principle to guide the sequencing of tree structures. For any given XML dataset, the principle finds an optimal sequencing strategy according to its schema and its data distribution; there is thus presented herein a novel method that realizes this principle.

摘要翻译： 基于序列的XML索引旨在避免查询处理中的昂贵的联接操作。 它将结构化XML数据转换为序列，以便可以通过子序列匹配整体回答结构化查询。 这里提出了相对于这种转换的查询等价性的问题，并且引入了用于排序树结构的性能导向原理。 通过查询等价，可以通过子序列匹配执行XML查询，无需连接操作，后处理或其他特殊处理，例如虚假警报等问题。 确定了一类用于此目的的测序方法，并提出了一种观察查询等价性的新颖的子序列匹配算法。 还引入了一种以性能为导向的原则来指导树结构的排序。 对于任何给定的XML数据集，该原理根据其模式及其数据分布找到最佳排序策略; 因此在此呈现了实现这一原理的新颖方法。

公开(公告)号：US20060132326A1

公开(公告)日：2006-06-22

申请号：US11317132

申请日：2005-12-23

申请人： Calvin Fang ,  Philip Yu

发明人： Calvin Fang ,  Philip Yu

IPC分类号： G08C19/12 ,  G08C19/00

CPC分类号： G08C17/00 ,  G08C2201/31 ,  G08C2201/92 ,  G08C2201/93

摘要： An improved universal remote control unit (URC) for controlling electronic appliance units. The URC unit has the typical remote controller module for controlling appliances such as TV, stereo, VCR or DVD. Additionally, the URC has a scratch pad memory for storing telephone numbers and web site information entered through the URC unit's alphanumeric keys. When activated, the key pad entries are stored in the memory, instead of being used to control the appliance. The URC unit further has a digital recorder module that can be implemented with a microphone, a voice recorder chip and a speaker, all integrated with the URC unit. The digital recorder module can even use the battery that is typically used by the URC unit. The URC unit further has a display screen to display the information stored in and recalled from the memory.

公开(公告)号：US20060101056A1

公开(公告)日：2006-05-11

申请号：US10982583

申请日：2004-11-05

申请人： Shyh-Kwei Chen ,  Kun-Lung Wu ,  Philip Yu

发明人： Shyh-Kwei Chen ,  Kun-Lung Wu ,  Philip Yu

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

CPC分类号： G06F17/30938 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99942 ,  Y10S707/99943

摘要： Techniques are provided for performing structural joins for answering containment queries. Such inventive techniques may be used to perform efficient structural joins of two interval lists which are neither sorted nor pre-indexed. For example, in an illustrative aspect of the invention, a technique for performing structural joins of two element sets of a tree-structured document, wherein one of the two element sets is an ancestor element set and the other of the two element sets is a descendant element set, and further wherein each element is represented as an interval representing a start position and an end position of the element in the document, comprises the following steps/operations. An index is dynamically built for the ancestor element set. Then, one or more structural joins are performed by searching the index with the interval start position of each element in the descendant element set.

摘要翻译： 提供技术来执行用于回答遏制查询的结构连接。 这样的创造性技术可以用于执行两个间隔列表的有效结构连接，这两个间隔列表既不被分类也未预索引。 例如，在本发明的说明性方面，一种用于执行树结构化文档的两个元素集合的结构连接的技术，其中两个元素集合中的一个是祖先元素集合，并且两个元素集合中的另一个是 后代元素集合，并且其中每个元素被表示为表示文档中元素的开始位置和结束位置的间隔，包括以下步骤/操作。 为祖先元素集动态构建索引。 然后，通过用后代元素集中的每个元素的间隔开始位置搜索索引来执行一个或多个结构连接。

公开(公告)号：US20060015474A1

公开(公告)日：2006-01-19

申请号：US10892691

申请日：2004-07-16

申请人： Charu Aggarwal ,  Philip Yu

发明人： Charu Aggarwal ,  Philip Yu

IPC分类号： G06F17/30

CPC分类号： G06F17/30539 ,  G06F21/6245 ,  G06F2216/03 ,  Y10S707/99931 ,  Y10S707/99932

摘要： Distributed privacy preserving data mining techniques are provided. A first entity of a plurality of entities in a distributed computing environment exchanges summary information with a second entity of the plurality of entities via a privacy-preserving data sharing protocol such that the privacy of the summary information is preserved, the summary information associated with an entity relating to data stored at the entity. The first entity may then mine data based on at least the summary information obtained from the second entity via the privacy-preserving data sharing protocol. The first entity may obtain, from the second entity via the privacy-preserving data sharing protocol, information relating to the number of transactions in which a particular itemset occurs and/or information relating to the number of transactions in which a particular rule is satisfied.

摘要翻译： 提供分布式隐私保护数据挖掘技术。 分布式计算环境中的多个实体的第一实体经由隐私保护数据共享协议与多个实体中的第二实体交换摘要信息，使得保留摘要信息的隐私，与 与实体存储的数据相关的实体。 然后，第一实体可以至少基于通过隐私保护数据共享协议从第二实体获得的摘要信息来挖掘数据。 第一实体可以通过隐私保护数据共享协议从第二实体获得与特定项目集出现的交易数量有关的信息和/或与其中满足特定规则的交易数量有关的信息。