会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
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.
    • 示例性实施例包括用于在图形数据流上执行查询的方法。 图形流包括表示连接图的顶点的边缘的数据。 该方法包括基于图形数据流的至少一个子集来构建多个概要数据结构。 连接到在图形数据流的子集内表示的边缘的每个顶点被分配给概要数据结构,使得每个概要数据结构表示该图的相应部分。 所述方法还包括将在图形数据流中表示的每个接收边缘映射到对应于包括该边缘的图形部分的概要数据结构,以及使用多个概要数据结构来对图形数据流执行查询。