-
公开(公告)号：US11030262B2
公开(公告)日：2021-06-08
申请号：US14835522
申请日：2015-08-25
Applicant: Oath Inc.
Inventor： Edward Bortnikov , Guy Gueta , Pranav Sharma
IPC: G06F16/9535 , G06F12/02 , G06F3/06 , G06F16/31 , G06F16/951
Abstract: In one embodiment, a search engine may generate and store a plurality of search index segments such that each of the search index segments is stored in a corresponding one of a plurality of heaps of memory. The plurality of search index segments may include inverted index segments mapping content to documents containing the content. A garbage collection module may release one or more heaps of the memory.
-
公开(公告)号：US20190138513A1
公开(公告)日：2019-05-09
申请号：US16101330
申请日：2018-08-10
Applicant: Oath Inc.
Inventor： Eshcar Hillel , Maya Arbel , Guy Gueta , Idit Keidar
Abstract: In one embodiment, a set of lock and unlock instructions in a read phase of a computer-readable program is replaced with a first set of tracking instructions, wherein the first set of tracking instructions track a set of locked objects identifying objects that would have been locked by executing the set of lock and unlock instructions. A second set of tracking instructions is inserted into the read phase of the computer-readable program, wherein the second set of tracking instructions track a set of read objects indicating versions of objects that are read. Validation instructions are inserted into the computer-readable program, wherein the validation instructions validate that the versions of objects in the set of read objects have not changed since they were last read and lock the set of locked objects that would have been locked upon completing execution of the set of lock and unlock instructions. Update instructions are added to an update phase of the computer-readable program, where the update instructions increment a current version of an object each time a value of the object is updated or a lock of the object is released.
-
公开(公告)号：US10459959B2
公开(公告)日：2019-10-29
申请号：US15345277
申请日：2016-11-07
Applicant: Oath Inc.
Inventor： David Carmel , Guy Gueta , Edward Bortnikov
Abstract: Methods and apparatus for performing top-k query processing include pruning a list of documents to identify a subset of the list of documents, where pruning includes, for other query terms in the set of query terms, skipping a document in the list of documents based, at least in part, on the contribution of the query term to the score of the corresponding document and the term upper bound for each other query term, in the set of query terms, that matches the document.
-
公开(公告)号：US10963447B2
公开(公告)日：2021-03-30
申请号：US16101330
申请日：2018-08-10
Applicant: Oath Inc.
Inventor： Eshcar Hillel , Maya Arbel , Guy Gueta , Idit Keidar
Abstract: In one embodiment, a set of lock and unlock instructions in a read phase of a computer-readable program is replaced with a first set of tracking instructions, wherein the first set of tracking instructions track a set of locked objects identifying objects that would have been locked by executing the set of lock and unlock instructions. A second set of tracking instructions is inserted into the read phase of the computer-readable program, wherein the second set of tracking instructions track a set of read objects indicating versions of objects that are read. Validation instructions are inserted into the computer-readable program, wherein the validation instructions validate that the versions of objects in the set of read objects have not changed since they were last read and lock the set of locked objects that would have been locked upon completing execution of the set of lock and unlock instructions. Update instructions are added to an update phase of the computer-readable program, where the update instructions increment a current version of an object each time a value of the object is updated or a lock of the object is released.
-
-
-
Search Results
4
records
(took 0.009 seconds)
