会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明申请
    • 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.
    • 示例性实施例包括用于在图形数据流上执行查询的方法。 图形流包括表示连接图的顶点的边缘的数据。 该方法包括基于图形数据流的至少一个子集来构建多个概要数据结构。 连接到在图形数据流的子集内表示的边缘的每个顶点被分配给概要数据结构,使得每个概要数据结构表示该图的相应部分。 所述方法还包括将在图形数据流中表示的每个接收边缘映射到对应于包括该边缘的图形部分的概要数据结构,以及使用多个概要数据结构来对图形数据流执行查询。
    • 5. 发明授权
    • 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.
    • 一种用于在图形数据流上执行查询的方法。 图形流包括表示连接图的顶点的边缘的数据。 该方法包括基于图形数据流的至少一个子集来构建多个概要数据结构。 连接到在图形数据流的子集内表示的边缘的每个顶点被分配给概要数据结构,使得每个概要数据结构表示该图的相应部分。 所述方法还包括将在图形数据流中表示的每个接收边缘映射到对应于包括该边缘的图形部分的概要数据结构,以及使用多个概要数据结构来对图形数据流执行查询。
    • 6. 发明申请
    • Learning-Based Method for Estimating Costs and Statistics of Complex Operators in Continuous Queries
    • 用于估计连续查询中复杂运算符的成本和统计的基于学习的方法
    • US20090204551A1
    • 2009-08-13
    • US12364578
    • 2009-02-03
    • Min WangSriram K PadmanabhanLike Gao
    • Min WangSriram K PadmanabhanLike Gao
    • G06Q10/00G06F15/18G06N5/02
    • G06Q30/0283G06F16/24542G06F16/24568
    • A learning-based method for estimating costs or statistics of an operator in a continuous query includes a cost estimation model learning procedure and a model applying procedure. The model learning procedure builds a cost estimation model from training data, and the applying procedure uses the model to estimate the cost associated with a given query. The learning procedure uses a feature extractor, a confidence adjustor and a cost estimator. The feature extractor collects relevant training data and obtains feature values. The extracted feature values are associated with costs and used to create the cost estimator. The extracted feature values, the associated costs, the cost estimator, and a user interface are used to create a confidence adjuster. When applying the confidence adjuster and the cost estimator to a continuous stream of data, the feature extractor extracts feature values from the data stream, uses the extracted feature values as input into the confidence adjuster to determine whether or not the cost estimator should be used, and if so, uses the extracted feature values as inputs into the cost estimator to obtain the desired cost values.
    • 用于估计连续查询中的运营商的成本或统计的基于学习的方法包括成本估计模型学习过程和模型应用程序。 模型学习过程从培训数据建立成本估算模型,应用程序使用模型来估计与给定查询相关联的成本。 学习过程使用特征提取器,置信调整器和成本估计器。 特征提取器收集相关的训练数据并获取特征值。 提取的特征值与成本相关联,并用于创建成本估计。 提取的特征值,相关联的成本,成本估计器和用户界面用于创建置信度调整器。 当将置信度调整器和成本估计器应用于连续的数据流时,特征提取器从数据流中提取特征值,将提取的特征值作为输入使用到置信度调整器中,以确定是否应该使用成本估计器, 如果是,则将所提取的特征值作为输入到成本估计器中以获得期望的成本值。
    • 7. 发明授权
    • 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.
    • 存储库索引记录文档条目相对于文档中的地标条目的位置。 地标条目正在使用标记政策进行选择,并且相对于文档的位置将存储在地标目录中。 在索引更新期间,生成描述旧文档版本和新文档版本之间的差异的编辑脚本,并根据需要更新文档存储库索引和地标目录。 因此,与传统的索引技术相比,执行的更新操作的数量可以在对文档进行小的局部改变时被显着地减少。 这是因为文件条目的位置相对于里程碑条目而不是文档本身被记录。 通过这样做,文档索引变得越来越不变,当在文档的本地化区域中添加或插入条目时,需要更少的更新操作。
    • 10. 发明申请
    • Method for merging multiple ranked lists with bounded memory
    • 将多个排名列表与有界记忆合并的方法
    • US20060190425A1
    • 2006-08-24
    • US11064605
    • 2005-02-24
    • Yuan-Chi ChangChristian LangApostol NatsevSriram PadmanabhanMin WangIoana Stanoi
    • Yuan-Chi ChangChristian LangApostol NatsevSriram PadmanabhanMin WangIoana Stanoi
    • G06F17/30
    • G06F16/5838G06F16/24549
    • Systems and methods for conducting attribute-based queries over a plurality of objects using bounded memory locations and minimizing costly input and output operations are provided. A plurality of attributes are associated with each object, and a plurality of data groups, one each for the identified attributes are created. The objects associated with the attributes are placed into the appropriate data groups, and the objects contained within each data group are sorted into blocks such that each block within a given attribute contains that objects having the same attribute value. Results to the query are created by loading blocks into a primary memory location in a middleware system and combining the loaded blocks to create the desire query results. Block combinations are created based upon the fit of the given block combination to the query as expressed in an aggregation function. A second dedicated memory location can also be provided to hold multiple block combinations to optimize the order in which blocks are loaded and combined. Empty block buffers and external storage devices can also be provided to further enhance the generation of query results.
    • 提供了使用有限存储器位置对多个对象进行基于属性的查询并最小化昂贵的输入和输出操作的系统和方法。 多个属性与每个对象相关联,并且创建多个数据组,每个数据组各自用于所识别的属性。 与属性相关联的对象被放置到适当的数据组中,并且每个数据组中包含的对象被排序成块,使得给定属性中的每个块包含具有相同属性值的对象。 通过将块加载到中间件系统中的主存储器位置并组合加载的块以创建期望查询结果来创建查询的结果。 基于给定块组合对于在聚合函数中表达的查询的拟合来创建块组合。 还可以提供第二专用存储器位置以保持多个块组合以优化块被加载和组合的顺序。 还可以提供空块缓冲区和外部存储设备,以进一步增强查询结果的生成。