知搜-全球专利检索

  1. 登录
  2. 注册

搜索结果

466 条记录 (耗时 0.018 秒)

    JOINING LARGE DATABASE TABLES
    52.
    发明申请
    JOINING LARGE DATABASE TABLES 审中-公开

    公开(公告)号：US20190236068A1

    公开(公告)日：2019-08-01

    申请号：US16376950

    申请日：2019-04-05

    申请人： Inpixon

    发明人： Chris Baskett ,  Tony Faustini ,  Farzin Shakib

    IPC分类号： G06F16/2455 ,  G06F16/2453 ,  G06F16/22

    CPC分类号： G06F16/2456 ,  G06F16/2237 ,  G06F16/2453 ,  G06F16/24544 ,  G06F16/24547

    摘要： Techniques to process a query and perform a join of tables that are distributed across nodes of a network. The join can be performed by analyzing a Where clause. An active flag structure can have flag values that identify table entries satisfying criteria of the Where clause. Keys of surviving entries of a first table can be used to generate a request for a second table to be joined. The request can be for second flags for the second table when the Where clause has criteria for the second table. A response can be used to update the first flags to change a first flag to False. After updating, data can be retrieved for first flags that are True. Requests can use identifiers associated with the first table that identify a location for sending the request, e.g., using RDMA or MPI.

    Database Sharding
    56.
    发明申请
    Database Sharding 审中-公开

    公开(公告)号：US20190121902A1

    公开(公告)日：2019-04-25

    申请号：US15813577

    申请日：2017-11-15

    申请人： International Business Machines Corporation

    发明人： Michael Ryan ,  Claude N. Warren, JR.

    IPC分类号： G06F17/30

    CPC分类号： G06F16/278 ,  G06F16/212 ,  G06F16/2237 ,  G06F16/24554

    摘要： Computer-implemented methods are provided for storing records in and retrieving records from a sharded table of a sharded database. The sharded database comprises a plurality of database shards. The database shards are each configured to store a subset of records of the sharded table. The database shards are also each associated with a respective Bloom filter. Records are inserted into the sharded table by generating a respective representation of the sharding key of the record to be stored for use with each of a plurality of the respective Bloom filters. Hamming distances between current values of each of the plurality of Bloom filters and the respective representation of the sharding key for use with that Bloom filter are then calculated and a database shard for storing the record is selected from amongst those database shards based on the calculated Hamming distances.

    METHODS AND SYSTEMS FOR SEARCHING
    58.
    发明申请
    METHODS AND SYSTEMS FOR SEARCHING 审中-公开

    公开(公告)号：US20180181640A1

    公开(公告)日：2018-06-28

    申请号：US15392023

    申请日：2016-12-28

    申请人： Khalifa University of Science, Technology and Research ,  British Telecommunications plc ,  Emirates Telecommunications Corporation

    发明人： Di Wang ,  Ivan Boyd ,  Ahmad Al-Rubaie ,  Jason Ng

    IPC分类号： G06F17/30

    CPC分类号： G06F16/9024 ,  G06F16/2237

    摘要： This invention relates to methods and systems for searching. It is particularly applicable to methods of searching which enable efficient identification of compatible portfolios. Embodiments of the invention propose methods of searching which address the huge search space issue associated with identifying compatible portfolios. In particular, embodiments of the invention start their search operations simultaneously from both sides by both trying to form valid portfolios from candidate products until a valid solution is found and trying to find conflicts from the defined compatibility rules until a conflict is found which leads to the conclusion that no valid solution exists. A conclusion from either process will stop the whole searching process which can significantly reduce blind and unnecessary searching in the whole search space. In embodiments of the invention, the two sides of the search process are also connected in a way which permits two-way communications between the processes to share information about invalid search branches during the execution of the search. The shared information is then used to direct the current and later stage of search execution. Such exchange of information can also significantly reduce the search space and create more efficient searching systems and methods, particularly by stopping search agents from carrying out invalid future searches in branches that another agent has already identified as invalid.