Patents by Inventor Artem Nikolaevich Goussev

Artem Nikolaevich Goussev has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 10346396
    Abstract: The sequence of one or more searches can be altered to cause multiple searches to load and evaluate segments together. When a first search query is executed, a query processor can commence loading segments of an indexed store to thereby evaluate the first search query against the segments. Then, if a second search query is received while the first search query is executing, the query processor can cause the second search query to commence on the same segment that the first search query is currently being evaluated against. The first and second search queries can then continue execution together until the first search query has been evaluated against all segments. The query processor can then continue executing the second search query against the remaining segments until it reaches the segment on which its execution commenced.
    Type: Grant
    Filed: August 2, 2016
    Date of Patent: July 9, 2019
    Assignee: QUEST SOFTWARE INC.
    Inventors: Artem Nikolaevich Goussev, Vadim Alexandrovich Senchukov
  • Publication number: 20180060388
    Abstract: A reduced version of a search query can be pre-applied to limit the search scope. A query processor can maintain one or more metadata structures for a structured data store where each metadata structure is based on a single field of documents that are stored in the structured data store. When a search query is received, the query processor can generate a reduced version of the search query to be run against one of the metadata structures. The results of running the reduced version of the search query will identify which of the portions of the structured data store the full search query should be run against. In this way, the query processor can avoid loading and evaluating the search query against all portions of the structured data store.
    Type: Application
    Filed: August 26, 2016
    Publication date: March 1, 2018
    Inventors: Artem Nikolaevich Goussev, Vadim Alexandrovich Senchukov
  • Publication number: 20180039670
    Abstract: The sequence of one or more searches can be altered to cause multiple searches to load and evaluate segments together. When a first search query is executed, a query processor can commence loading segments of an indexed store to thereby evaluate the first search query against the segments. Then, if a second search query is received while the first search query is executing, the query processor can cause the second search query to commence on the same segment that the first search query is currently being evaluated against. The first and second search queries can then continue execution together until the first search query has been evaluated against all segments. The query processor can then continue executing the second search query against the remaining segments until it reaches the segment on which its execution commenced.
    Type: Application
    Filed: August 2, 2016
    Publication date: February 8, 2018
    Inventors: Artem Nikolaevich Goussev, Vadim Alexandrovich Senchukov