会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Query optimization over graph data streams
    • 对图形数据流进行查询优化
    • US08392398B2
    • 2013-03-05
    • US12511627
    • 2009-07-29
    • Charu C. AggarwalMin WangPeixiang Zhao
    • Charu C. AggarwalMin WangPeixiang Zhao
    • G06F7/00G06F17/30
    • G06F17/30979G06F17/30958
    • A method for executing a query on a graph data stream. The graph stream comprises data representing edges that connect vertices of a graph. The method comprises constructing a plurality of synopsis data structures based on at least a subset of the graph data stream. Each vertex connected to an edge represented within the subset of the graph data stream is assigned to a synopsis data structure such that each synopsis data structure represents a corresponding section of the graph. The method further comprises mapping each received edge represented within the graph data stream onto the synopsis data structure which corresponds to the section of the graph which includes that edge, and using the plurality of synopsis data structures to execute the query on the graph data stream.
    • 一种用于在图形数据流上执行查询的方法。 图形流包括表示连接图的顶点的边缘的数据。 该方法包括基于图形数据流的至少一个子集来构建多个概要数据结构。 连接到在图形数据流的子集内表示的边缘的每个顶点被分配给概要数据结构,使得每个概要数据结构表示该图的相应部分。 所述方法还包括将在图形数据流中表示的每个接收边缘映射到对应于包括该边缘的图形部分的概要数据结构,以及使用多个概要数据结构来对图形数据流执行查询。
    • 2. 发明申请
    • Query Optimization Over Graph Data Streams
    • 查询优化图表数据流
    • US20110029571A1
    • 2011-02-03
    • US12511627
    • 2009-07-29
    • Charu C. AggarwalMin WangPeixiang Zhao
    • Charu C. AggarwalMin WangPeixiang Zhao
    • G06F17/30
    • G06F17/30979G06F17/30958
    • An illustrative embodiment includes a method for executing a query on a graph data stream. The graph stream comprises data representing edges that connect vertices of a graph. The method comprises constructing a plurality of synopsis data structures based on at least a subset of the graph data stream. Each vertex connected to an edge represented within the subset of the graph data stream is assigned to a synopsis data structure such that each synopsis data structure represents a corresponding section of the graph. The method further comprises mapping each received edge represented within the graph data stream onto the synopsis data structure which corresponds to the section of the graph which includes that edge, and using the plurality of synopsis data structures to execute the query on the graph data stream.
    • 示例性实施例包括用于在图形数据流上执行查询的方法。 图形流包括表示连接图的顶点的边缘的数据。 该方法包括基于图形数据流的至少一个子集来构建多个概要数据结构。 连接到在图形数据流的子集内表示的边缘的每个顶点被分配给概要数据结构,使得每个概要数据结构表示该图的相应部分。 所述方法还包括将在图形数据流中表示的每个接收边缘映射到对应于包括该边缘的图形部分的概要数据结构,以及使用多个概要数据结构来对图形数据流执行查询。
    • 6. 发明授权
    • Similarity searching in large disk-based networks
    • 在大型基于磁盘的网络中进行相似性搜索
    • US08582554B2
    • 2013-11-12
    • US13091244
    • 2011-04-21
    • Charu C. Aggarwal
    • Charu C. Aggarwal
    • H04L12/28G06F17/30
    • H04L47/00
    • Techniques for determining a shortest path in a disk-based network are provided. The techniques include creating a compressed representation of an underlying disk resident network graph, wherein creating a compressed representation of an underlying disk resident network graph comprises determining one or more dense regions in the disk resident graph and compacting the one or more dense regions into one or more compressed nodes, associating one or more node penalties with the one or more compressed nodes, wherein the one or more node penalties reflect a distance of a sub-path within a compressed node, and performing a query on the underlying disk resident network graph using the compressed representation and one or more node penalties to determine a shortest path in the disk-based network to reduce the number of accesses to a physical disk.
    • 提供了用于确定基于磁盘的网络中的最短路径的技术。 所述技术包括创建底层磁盘驻留网络图的压缩表示,其中创建底层磁盘驻留网络图的压缩表示包括确定磁盘驻留图中的一个或多个密集区域并将一个或多个密集区域压缩为一个或多个密集区域 更多的压缩节点将一个或多个节点惩罚与一个或多个压缩节点相关联,其中所述一个或多个节点惩罚反映了压缩节点内的子路径的距离,并且使用 压缩表示和一个或多个节点惩罚,以确定基于磁盘的网络中的最短路径,以减少对物理磁盘的访问次数。
    • 10. 发明授权
    • Method and apparatus for predicting future behavior of data streams
    • 用于预测数据流未来行为的方法和装置
    • US07421452B2
    • 2008-09-02
    • US11452585
    • 2006-06-14
    • Charu C. Aggarwal
    • Charu C. Aggarwal
    • G06F17/30
    • G06F17/30516Y10S707/99931Y10S707/99943
    • Techniques are disclosed for predicting the future behavior of data streams through the use of current trends of the data stream. By way of example, a technique for predicting the future behavior of a data stream comprises the following steps/operations. Statistics are obtained from the data stream. Estimated statistics for a future time interval are generated by using at least a portion of the obtained statistics. A portion of the estimated statistics are utilized to generate one or more representative pseudo-data records within the future time interval. Pseudo-data records are utilized for forecasting of at least one characteristic of the data stream.
    • 公开了通过使用数据流的当前趋势来预测数据流的未来行为的技术。 作为示例,用于预测数据流的未来行为的技术包括以下步骤/操作。 从数据流中获取统计数据。 通过使用获取的统计信息的至少一部分来生成未来时间间隔的估计统计信息。 估计统计的一部分用于在未来的时间间隔内产生一个或多个代表性的伪数据记录。 伪数据记录用于预测数据流的至少一个特性。