知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

237 records (took 0.037 seconds)

    INDEXING DYNAMIC HIERARCHICAL DATA
    42.
    发明申请
    INDEXING DYNAMIC HIERARCHICAL DATA 有权
    指数动态分层数据

    公开(公告)号：US20160350380A1

    公开(公告)日：2016-12-01

    申请号：US14727177

    申请日：2015-06-01

    Applicant: SAP SE

    Inventor： Jan Finis ,  Robert Brunel

    IPC: G06F17/30

    CPC classification number: G06F17/30504 ,  G06F17/30327 ,  G06F17/30333 ,  G06F17/30589 ,  G06F17/30613 ,  G06F17/30619 ,  G06F17/30625 ,  G06F17/30631 ,  G06F17/30961

    Abstract: A system includes storage of data of a hierarchy, where each node of the hierarchy is represented by a row, and each row includes a level of its respective node, a pointer to a lower bound entry of an order index structure associated with the hierarchy, and a pointer to an upper bound entry of the order index structure associated with the hierarchy, reception of a pointer l, and determination of an entry e of the order index structure to which the received pointer l points.

    Abstract translation: 系统包括存储层级的数据，其中层次结构的每个节点由行表示，并且每行包括其相应节点的级别，指向与层级相关联的订单索引结构的下限条目的指针， 以及指向与层次结构相关联的订单索引结构的上限条目的指针，指针l的接收以及所接收的指针l所指向的订单索引结构的条目e的确定。

    SYSTEMS AND METHODS FOR PROVIDING DYNAMIC INDEXER DISCOVERY
    43.
    发明申请
    SYSTEMS AND METHODS FOR PROVIDING DYNAMIC INDEXER DISCOVERY 审中-公开
    提供动态指标发现的系统和方法

    公开(公告)号：US20160321352A1

    公开(公告)日：2016-11-03

    申请号：US14700844

    申请日：2015-04-30

    Applicant: Splunk Inc.

    Inventor： Vishal Patel ,  Jagannath Kerai ,  Hasan Alayli

    IPC: G06F17/30

    CPC classification number: G06F17/30631 ,  G06F17/30144

    Abstract: The present disclosure is directed to providing dynamic indexer discovery. An index manager, which may also be known as a cluster master, is configured to track the statuses and capabilities of indexers and provide the statuses and capabilities obtained from the indexers to data collectors, such as forwarders. The data collectors may use the statuses and capabilities associated with the indexers to load balance transmission of data to the indexers. Dynamic indexer discovery may eliminate the need to manually reconfigure data collectors when the status of an indexer changes because the information may be obtained from the index manager without the need to reinitialize the data collectors.

    Abstract translation: 本公开旨在提供动态索引器发现。 索引管理器也可以被称为集群主机，被配置为跟踪索引器的状态和能力，并将从索引器获得的状态和功能提供给诸如转发器之类的数据收集器。 数据收集器可以使用与索引器相关联的状态和功能将数据的传输负载平衡到索引器。 当索引器的状态发生变化时，动态索引器发现可能会消除手动重新配置数据收集器的需要，因为可以从索引管理器获取信息，而无需重新初始化数据收集器。

    SEMANTIC FRAME IDENTIFICATION WITH DISTRIBUTED WORD REPRESENTATIONS
    45.
    发明申请
    SEMANTIC FRAME IDENTIFICATION WITH DISTRIBUTED WORD REPRESENTATIONS 审中-公开
    具有分布式词汇表示的语义框架识别

    公开(公告)号：US20160239739A1

    公开(公告)日：2016-08-18

    申请号：US15008794

    申请日：2016-01-28

    Applicant: Google Inc.

    Inventor： Dipanjan Das ,  Kuzman Ganchev ,  Jason Weston ,  Karl Moritz Hermann

    IPC: G06N5/02 ,  G06F17/22 ,  G06F17/28 ,  G06F17/30

    CPC classification number: G06N5/027 ,  G06F17/2264 ,  G06F17/274 ,  G06F17/2755 ,  G06F17/2785 ,  G06F17/2872 ,  G06F17/289 ,  G06F17/30625 ,  G06F17/30631 ,  G06F17/3089

    Abstract: A computer-implemented technique can include receiving, at a server, labeled training data including a plurality of groups of words, each group of words having a predicate word, each word having generic word embeddings. The technique can include extracting, at the server, the plurality of groups of words in a syntactic context of their predicate words. The technique can include concatenating, at the server, the generic word embeddings to create a high dimensional vector space representing features for each word. The technique can include obtaining, at the server, a model having a learned mapping from the high dimensional vector space to a low dimensional vector space and learned embeddings for each possible semantic frame in the low dimensional vector space. The technique can also include outputting, by the server, the model for storage, the model being configured to identify a specific semantic frame for an input.

    Abstract translation: 计算机实现的技术可以包括在服务器处接收包括多组单词的标记训练数据，每组单词具有谓词单词，每个单词具有通用单词嵌入。 该技术可以包括在服务器处提取他们的谓词单词的句法语境中的多组单词。 该技术可以包括在服务器处连接通用词嵌入以创建表示每个单词的特征的高维向量空间。 该技术可以包括在服务器处获得具有从高维矢量空间到低维向量空间的学习映射的模型，以及在低维向量空间中为每个可能的语义帧学习嵌入。 该技术还可以包括由服务器输出用于存储的模型，该模型被配置为识别用于输入的特定语义帧。

    Real-time text indexing
    46.
    发明授权
    Real-time text indexing 有权
    实时文本索引

    公开(公告)号：US09400837B2

    公开(公告)日：2016-07-26

    申请号：US12979413

    申请日：2010-12-28

    Applicant: Ravi Palakodety ,  Wesley Lin ,  Mohammad Faisal ,  Garret F. Swart

    Inventor： Ravi Palakodety ,  Wesley Lin ,  Mohammad Faisal ,  Garret F. Swart

    IPC: G06F17/30

    CPC classification number: G06F17/30622 ,  G06F17/30631

    Abstract: Systems, methods, and other embodiments associated with real-time text indexing are described. One example method includes receiving a document for indexing in a search system that includes a mature index and indexing the received document in a staging index. The staging index may be stored in direct access memory associated with query processing that does not degrade query performance even when postings become fragmented. The staging index and the mature text index are accessed to process queries on the search system. The example method may also include periodically merging the staging index into the mature index based on query feedback.

    Abstract translation: 描述了与实时文本索引相关联的系统，方法和其他实施例。 一个示例性方法包括在搜索系统中接收用于索引的文档，该搜索系统包括成熟索引并且以分段索引对接收的文档进行索引。 分级索引可以存储在与查询处理相关联的直接访问存储器中，即使在发布分段时也不降低查询性能。 访问分段索引和成熟文本索引以在搜索系统上处理查询。 示例性方法还可以包括基于查询反馈将登台索引周期性地合并到成熟索引中。

    Social Static Ranking for Search
    47.
    发明申请
    Social Static Ranking for Search 审中-公开

    公开(公告)号：US20160103840A1

    公开(公告)日：2016-04-14

    申请号：US14973464

    申请日：2015-12-17

    Applicant: Facebook, Inc.

    Inventor： Sriram Sankar ,  Gintaras Andrius Woss ,  Rajat Raina ,  Maxim Gubin

    IPC: G06F17/30

    CPC classification number: G06F17/3053 ,  G06F17/30 ,  G06F17/30321 ,  G06F17/30336 ,  G06F17/30554 ,  G06F17/30631 ,  G06F17/30867 ,  G06F17/30958 ,  G06Q50/01

    Abstract: In one embodiment, one or more computing devices receive, from a client device of a first user, a query from the first user. The computer devices search a social graph to identify one or more nodes of the social graph that are relevant to the query. The computer devices obtain a static rank for each identified node. The static rank is based at least in part on a number of edges of a particular edge type that are connected to the node in the graph or attributes of edges connected to the node in the graph. The computer devices send to the client device of the first user for display, a search-results page responsive to the received query. The search-results page includes reference to one or more nodes having a static rank greater than a threshold rank.

    DATA DRIVEN RELATIONAL ALGORITHM FORMATION FOR EXECUTION AGAINST BIG DATA
    48.
    发明申请
    DATA DRIVEN RELATIONAL ALGORITHM FORMATION FOR EXECUTION AGAINST BIG DATA 有权
    数据驱动相关算法形成对大数据的执行

    公开(公告)号：US20160055220A1

    公开(公告)日：2016-02-25

    申请号：US14720498

    申请日：2015-05-22

    Applicant: Xcalar, Inc.

    Inventor： Vikram Joshi ,  Jerene Yang ,  Brent Lim Tze Hao ,  Michael Brown

    IPC: G06F17/30 ,  G06F3/0484

    CPC classification number: G06F17/30336 ,  G06F3/04842 ,  G06F17/30321 ,  G06F17/30398 ,  G06F17/30448 ,  G06F17/30545 ,  G06F17/30554 ,  G06F17/30566 ,  G06F17/30622 ,  G06F17/30625 ,  G06F17/30628 ,  G06F17/30631 ,  G06F17/30911

    Abstract: Techniques are described herein for creating an algorithm for batch mode processing against big data. The techniques involve receiving one or more user commands from a set number of commands that correspond one-to-one with a set number of low-level database operations. In a preferred embodiment, the set of database operations includes only FILTERS, SORTS, AGREGGATES, and JOINS.In the algorithm formation process, database operations are performed on a sample population of records. The user drills down to a set of useful records by performing database operations against the results of the previous database operations. While the database cluster is receiving operations, the system is tracking the operations in a dependency graph. The chains selected within the dependency graph indicate which operations are used to create the algorithm. To generate the algorithm, the database cluster reverse engineers the logic for performing those operations against big data.

    Abstract translation: 这里描述了用于创建针对大数据的批处理模式处理的算法的技术。 这些技术涉及从设定数量的低级数据库操作的一对一的一组命令接收一个或多个用户命令。 在优选实施例中，该组数据库操作仅包括FILTERS，SORTS，AGREGGATES和JOINS。 在算法形成过程中，对记录的样本数量进行数据库操作。 用户通过针对先前的数据库操作的结果执行数据库操作，向下钻取一组有用的记录。 当数据库集群正在接收操作时，系统正在跟踪依赖图中的操作。 在依赖图中选择的链表示哪些操作用于创建算法。 为了生成算法，数据库集群逆向工程师是针对大数据执行这些操作的逻辑。

    MULTI-USER SEARCH SYSTEM WITH METHODOLOGY FOR PERSONALIZED SEARCH QUERY AUTOCOMPLETE
    49.
    发明申请
    MULTI-USER SEARCH SYSTEM WITH METHODOLOGY FOR PERSONALIZED SEARCH QUERY AUTOCOMPLETE 有权
    多用户搜索系统与个性化搜索查询自动化方法

    公开(公告)号：US20160055185A1

    公开(公告)日：2016-02-25

    申请号：US14555171

    申请日：2014-11-26

    Applicant: Dropbox, Inc.

    Inventor： Samir Goel ,  Franck Chastagnol ,  Abhishek Agrawal

    IPC: G06F17/30 ,  H04L29/06 ,  G06F17/27

    CPC classification number: G06F17/30356 ,  G06F17/277 ,  G06F17/30011 ,  G06F17/30094 ,  G06F17/30106 ,  G06F17/30309 ,  G06F17/30312 ,  G06F17/30321 ,  G06F17/30368 ,  G06F17/30386 ,  G06F17/30507 ,  G06F17/30616 ,  G06F17/30622 ,  G06F17/30631 ,  G06F17/30867 ,  G06F17/30914 ,  G06F21/6218 ,  H04L63/08 ,  H04L63/101

    Abstract: A multi-user search system with methodology for personalized search query autocomplete. In one embodiment, for example, a method for personalized search query autocomplete includes receiving, from an end-user computing device of an authenticated user, a completion search query including a completion token; determining an identifier of an authorized document namespace the authenticated user is permitted to access; generating an index key including the authorized document namespace identifier as a prefix and the completion token as a suffix; accessing an index dictionary with the index key to identify and iterate over a plurality of prefixed index tokens until a stop condition is reached, each of the plurality of prefixed index tokens including the authorized document namespace identifier as a prefix and the each index token as a suffix, the completion token being a prefix of or matching the each index token; and for each prefixed index token of the plurality of prefixed index tokens, determining whether any documents identified in a postings list associated with the each prefixed index token satisfies the completion query, and returning filenames of any such documents satisfying the completion query in an answer to the completion query.

    Abstract translation: 具有个性化搜索查询自动填充方法的多用户搜索系统。 在一个实施例中，例如，用于个性化搜索查询自动完成的方法包括从认证用户的最终用户计算设备接收包括完成令牌的完成搜索查询; 确定被许可的用户被允许访问的授权文档命名空间的标识符; 生成包括授权文档命名空间标识符作为前缀的索引关键字和完成令牌作为后缀; 使用所述索引关键字访问索引字典以识别并迭代多个前缀索引令牌，直到达到停止条件，所述多个前缀索引令牌中的每一个包括所述授权文档命名空间标识符作为前缀，并且每个索引令牌为 后缀，完成令牌是每个索引令牌的前缀或匹配; 并且对于多个前缀索引令牌的每个前缀索引令牌，确定在与每个前缀索引令牌相关联的过帐列表中标识的任何文档是否满足完成查询，并且在答案中确定满足完成查询的任何此类文档的文件名 完成查询。

    Methods and systems for flexible and scalable databases
    50.
    发明授权
    Methods and systems for flexible and scalable databases 有权
    灵活和可扩展数据库的方法和系统

    公开(公告)号：US09135647B2

    公开(公告)日：2015-09-15

    申请号：US13525405

    申请日：2012-06-18

    Applicant: David Witten ,  Ian Klein

    Inventor： David Witten ,  Ian Klein

    IPC: G06F7/00 ,  G06F17/00 ,  G06Q30/04 ,  G06F17/30

    CPC classification number: G06Q30/04 ,  G06F17/30067 ,  G06F17/30117 ,  G06F17/30286 ,  G06F17/30345 ,  G06F17/30362 ,  G06F17/30557 ,  G06F17/30631

    Abstract: Methods and systems for utilizing a database are disclosed. The methods and systems determine a key representative of a storage location of first RDF data in a NoSQL database. In addition, the methods and systems read the first RDF data in the NoSQL database using the key. The methods and systems also write second RDF data derived from the first RDF data into a second database stored in memory. The methods and systems may also modify the second RDF data, and write third RDF data derived from the modified second RDF data into the NoSQL database.

    Abstract translation: 公开了利用数据库的方法和系统。 方法和系统确定了NoSQL数据库中第一个RDF数据的存储位置的关键代表。 此外，方法和系统使用密钥读取NoSQL数据库中的第一个RDF数据。 方法和系统还将从第一RDF数据导出的第二RDF数据写入存储在存储器中的第二数据库。 方法和系统还可以修改第二RDF数据，并将从修改的第二RDF数据导出的第三RDF数据写入NoSQL数据库。

Patent Agency Ranking