Method and system for information retrieval in response to a query

• US 9,081,873 B1
• Filed: 09/28/2012
• Issued: 07/14/2015
• Est. Priority Date: 10/05/2009
• Status: Expired due to Fees

• Current Assignee: StrataCloud, Inc. (Exitlag LLC)
• Original Assignee: StrataCloud, Inc. (Exitlag LLC)
• Inventors: Bawcom, Aaron N., Madden, Christopher M.
• Primary Examiner(s): SYED, FARHAN M
• Application Number:
  US13/630,634
• Time in Patent Office: 1,019 Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2455 Query execution
• CPC Class Codes: G06F 16/2471 Distributed queries

Abstract

A machine-implemented system and method of information retrieval, comprising: receiving queries including an ordered set of clause definitions, each clause definition including a clause pipeline, wherein a clause pipeline includes an ordered set of clause specifications that comprises an expansion operation and/or a filter operation, where the queries are received from a calling application; parsing the queries into a collection of expression pools; processing data by the expression pools in the collection to generate a current object set; and returning the current object set to the calling application in response to the queries.

Claims

1. A machine-implemented method of information retrieval, comprising:

receiving object-oriented streamed data comprising events comprising fields, and queries comprising an ordered set of clause definitions, each ordered set of clause definitions comprising a clause pipeline, wherein the clause pipeline comprises an ordered set of clause specifications that comprises an expansion operation and/or a filter operation, wherein the queries are received from a calling application;

processing the object-oriented data against queries from a query application that formulates the queries and supplies the queries to an information retrieval system, wherein the query application is not part of the information retrieval system, the queries comprising an ordered set of clause definitions, each ordered set of clause definitions comprising a clause pipeline, wherein the clause pipeline comprises an ordered set of clause specifications that comprises an expansion operation and/or a filter operation, wherein the queries are received from a calling application;

parsing the queries into a collection of expression pools, the parsing comprising;

lexing the queries by converting symbols into tokens, compiling the queries into an abstract syntax tree, and traversing the abstract syntax tree to create all expression pools for all queries;

processing the object-oriented streamed data without modifying the native object-oriented streamed data, sequentially and/or in parallel, by the expression pools in the collection to generate a current object set; and

returning the current object set to the calling application in response to the queries.

2. The method as described in claim 1, wherein compiling the query into the abstract syntax tree comprises compiling the tokens into the abstract syntax tree.

3. The method as described in claim 1, wherein an expression pool is a pool of processes that are performing a same function for load balancing purposes.

4. The method as described in claim 1, further comprising:

providing criteria for different queries to an input expression pool;

for each query;

sending data received meeting the criteria for the query to the query'"'"'s initial expression pool;

processing the data sent to the query'"'"'s initial expression pool using the queries'"'"' additional expression pools until the processed data reaches the query'"'"'s output expression pool; and

sending the data from the query'"'"'s output expression pool to an output destination.

5. The method as described in claim 1, wherein millions of queries are processed in the same node.

6. The method as described in claim 5, wherein a software-based virtual processor is utilized to process the instructions from the expression pools.

7. The method as described in claim 1, wherein each expression pool is a collection of processes, and each process is a sequence of logic with its own memory space.

8. The method as described in claim 1, wherein the processing is done incrementally.

9. The method as described in claim 1, wherein queries may be added and/or queries may be removed during runtime.

10. The method as described in claim 1 wherein the ordered set of clause definitions comprises a time constraint.

11. The method as described in claim 1, wherein the processing comprises:

filtering, non-filtering, expanding, traversing relationships to other object;

or manufacturing new objects from scratch;

or any combination thereof.

12. The method as described in claim 4, further comprising sending the data from the query'"'"'s output expression pool to another query on the same node and/or another node.

25. The method of claim 1, wherein the clause definitions also comprise a time constraint.

13. A system of information retrieval, comprising:

a processor configured for;

receiving object-oriented streamed data comprising events comprising fields, and queries comprising an ordered set of clause definitions, each ordered set of clause definitions comprising a clause pipeline, wherein the clause pipeline comprises an ordered set of clause specifications that comprises an expansion operation and/or a filter operation, wherein the queries are received from a calling application;

processing the object-oriented data against queries from a query application that formulates the queries and supplies the queries to an information retrieval system, wherein the query application is not part of the information retrieval system, the queries comprising an ordered set of clause definitions, each ordered set of clause definitions comprising a clause pipeline, wherein the clause pipeline comprises an ordered set of clause specifications that comprises an expansion operation and/or a filter operation, wherein the queries are received from a calling application;

parsing the queries into a collection of expression pools, the parsing comprising;

lexing the queries by converting symbols into tokens, compiling the queries into an abstract syntax tree, and traversing the abstract syntax tree to create all expression pools for all queries;

processing the object-oriented streamed data without modifying the native object-oriented streamed data, sequentially and/or in parallel, by the expression pools in the collection to generate a current object set; and

returning the current object set to the calling application in response to the queries.

14. The system as described in claim 13, wherein compiling the query into the abstract syntax tree comprises compiling the tokens into the abstract syntax tree.

15. The system as described in claim 13, wherein an expression pool is a pool of processes that are performing a same function for load balancing purposes.

16. The system as described in claim 13, wherein the processor is further configured for:

providing criteria for different queries to an input expression pool;

for each query;

sending data received meeting the criteria for the query to the query'"'"'s initial expression pool;

processing the data sent to the query'"'"'s initial expression pool using the queries'"'"' additional expression pools until the processed data reaches the query'"'"'s output expression pool; and

sending the data from the query'"'"'s output expression pool to an output destination.

17. The system as described in claim 13, wherein millions of queries are processed in the same node.

18. The system as described in claim 17, wherein a software-based virtual processor is utilized to process the instructions from the expression pools.

19. The system as described in claim 13, wherein each expression pool is a collection of processes, and each process is a sequence of logic with its own memory space.

20. The system as described in claim 13, wherein the processing is done incrementally.

21. The system as described in claim 13, wherein queries may be added and/or queries may be removed during runtime.

22. The system as described in claim 13, wherein the ordered set of clause definitions comprises a time constraint.

23. The system as described in claim 13, wherein the processing comprises:

filtering, non-filtering, expanding, traversing relationships to other object;

manufacturing new objects from scratch;

or any combination thereof.

24. The system as described in claim 16, wherein the processor is further configured for sending the data from the query'"'"'s output expression pool to another query on the same node and/or another node.

26. The system of claim 13, wherein the clause definitions also comprise a time constraint.