IP Library Patent Application 12978706
Patent Application
App. No. 12/978,706

Systems and Methods for Creating and Using a Research Map

Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US None
App. No.
12/978,706
Abstract

Systems and methods create a graphical representation of a research map that allows performance of search functions using the nodes of the graphical representation. In one implementation, a system includes a processor and a memory. The memory stores instructions that cause the processor to receive a query for searching a document repository and run the query in the document repository. The processor stores the results of the query and the query as a root node in a research tree. The processor receives a filter for the results of the query. The processor stores the filter and the result list for the filter as a filter node connected to the root node of in the research tree. The processor receives a request to view a document from the result list for the filter and stores the request as a document node connected to the filter node. The processor then creates a display of a research map that includes the research tree.

Claims (109)

1 . A computer-implemented method for creating a research tree, comprising:

receiving, by a processor, a query, the query specifying a search parameter for searching a document repository;

executing the query to search the document repository;

storing, in the data repository, the query and a result of the query as a root node of a research tree;

receiving, by the processor, a first request for a filter for the result of the query;

storing the first filter and information identifying a plurality of documents matching the first filter as a first filter node connected to the root node;

receiving a request to view a first document from the plurality of documents matching the first filter; and

storing the request to view the first document as a first document node connected to the first filter node.

2 . The method of claim 1 , further comprising creating information used to display the research tree, including the root node, the first filter node, and the first document node.

3 . The method of claim 2 , further comprising:

receiving a request to hide the first filter node from the display of the tree; and

creating information used to display the research map so that the root node is displayed and the first filter node and the first document node are hidden.

4 . The method of claim 2 , further comprising:

associating a client number with the root node of the research map;

receiving a client number; and

creating information used to display the research map when the client number associated with the root node matches the received client number.

5 . The method of claim 2 , wherein the display includes a plurality of research maps displayed in reverse chronological order.

6 . The method of claim 1 , further comprising:

receiving a request for a second filter for the results of the query; and

storing the second filter and information identifying a plurality of documents matching the first filter and the second filter as a second filter node connected to the first filter node.

7 . The method of claim 6 , further comprising:

receiving a request to view a second document from the plurality of documents matching the first filter and the second filter; and

storing the request to view the second document as a second document node connected to the second filter node.

8 . The method of claim 7 , further comprising:

creating information used to display the research map in a tree structure including the root node, the first filter node, the first document node, the second filter node, and the second document node.

9 . The method of claim 1 , further comprising:

receiving a request to view a third document cited in the first document; and

storing the request to view the third document as a third document node connected to the first document node.

10 . The method of claim 6 , further comprising:

receiving a request to delete the first filter node; and

creating a third filter node connected to the root node of the research map, the third filter node comprising the second filter node.

11 . The method of claim 1 , further comprising associating a note with the first document node.

12 . The method of claim 1 , further comprising sending the research tree to a second processor, wherein the second processor uses the root node, the filter node and the document node to recreate the research tree.

13 . The method of claim 1 , further comprising generating information used to print the research tree.

14 . A computer-readable storage device storing instructions for creating a research tree, the instructions causing one or more computer processors to perform operations, comprising:

receiving a query, the query specifying a search parameter for searching a document repository;

executing the query to search the document repository; storing, in the data repository, the query and a result of the query as a root node of a research tree;

receiving a request for a first filter for the result of the query;

storing the first filter and information identifying a plurality of documents matching the first filter as a first filter node connected to the root node;

receiving a request to view a first document from the plurality of documents matching the first filter; and

storing the request to view the first document as a first document node connected to the first filter node.

15 . The computer-readable storage device of claim 14 , the operations further comprising creating information used to display the research tree, including the root node, the first filter node, and the first document node.

16 . A system for creating a research tree, comprising:

a processor;

a memory coupled to the processor, the memory storing instructions to direct the processor to perform operations comprising:

receiving a query, the query specifying a search parameter for searching a document repository;

executing the query to search the document repository;

storing, in the data repository, the query and a result of the query as a root node of a research tree;

receiving a request for a first filter for the result of the query;

storing the first filter and information identifying a plurality of documents matching the first filter as a first filter node connected to the root node;

receiving a request to view a first document from the plurality of documents matching the first filter; and

storing the request to view the first document as a first document node connected to the first filter node.

17 . The system of claim 16 , the operations further comprising the operation of creating information used to display the research tree, including the root node, the first filter node, and the first document node.

18 . The system of claim 16 , the operations further comprising sending the research tree to a second processor, wherein the second processor uses the root node, the filter node and the document node to recreate the research tree.

19 . The system of claim 16 , the operations further comprising generating information used to print the research tree.

20 . A computer-implemented method for searching a document repository using a research map, comprising:

generating information for displaying the research map, the information comprising a search node and a document node representing a document;

receiving, by a processor, a selection of one or more document nodes from the displayed research map; and

performing, by the processor, the operations of:

determining metadata values common to a majority of the documents represented by the selected document nodes,

determining a frequency with which the metadata values occur in the documents,

generating a search string comprising the metadata values,

performing a search of the document repository using the search string, and

generating information used to display one or more documents found as a result of the search.

21 . The method of claim 20 , further comprising:

creating a root node for a new research map from the search string and the results of the search.

22 . The method of claim 20 , wherein the search string represents a union of a predetermined number of the most frequently occurring metadata values.

23 . The method of claim 20 , wherein the search string represents a union of a selection of metadata common to a majority of the documents.

24 . The method of claim 20 , wherein the metadata comprises a plurality of categories of metadata.

25 . The method of claim 24 , wherein a weight is assigned to each category of metadata and the results generated from the search string for a category of metadata are prioritized using the assigned weight for each category.

26 . The method of claim 24 , wherein the search string is generated from a predetermined number of values of metadata in each category.

27 . A system for searching a document repository using a research map, comprising:

a processor; and

a memory coupled to the processor, the memory storing instructions to direct the processor to perform operations comprising:

generating information for displaying the research map, the information comprising a search node and a document node representing a document,

receiving a selection of one or more document nodes from the displayed research map,

determining metadata values common to a majority of the documents represented by the selected document nodes,

determining a frequency with which the metadata values occur in the documents,

generating a search string that represents a union of a predetermined number of the most frequently occurring metadata values,

performing a search of the document repository using the search string, and

generating information used to display one or more documents found as a result of the search.

28 . A computer-readable storage device storing instructions for searching a document repository using a research map, the instructions causing one or more computer processors to perform operations, comprising:

generating information for displaying the research map, the information comprising a search node and a document node representing a document;

receiving a selection of one or more document nodes from the displayed research map;

determining metadata values common to a majority of the documents represented by the selected document nodes;

determining a frequency with which the metadata values occur in the documents;

generating a search string based on a predetermined number of the most frequently occurring metadata values;

performing a search of the document repository using the search string; and

generating information used to display one or more documents found as a result of the search.

29 . The computer-readable storage device of claim 28 , the operations further comprising:

creating a root node for a new research map from the search string and the results of the search.

30 . The computer-readable storage device of claim 28 , wherein the metadata comprises a plurality of categories of metadata.

31 . The computer-readable storage device of claim 30 , wherein a weight is assigned to each category of metadata and the results generated from the search string for a category of metadata are prioritized using the assigned weight for each category.

32 . The computer-readable storage device of claim 30 , wherein the search string is based on the predetermined number of values of metadata in each category.

33 . A computer-implemented method of searching a document repository using a research map, comprising:

generating information used to display a research map, the information comprising search nodes, filter nodes, and document nodes;

receiving a selection of a first filter node comprising a first document result list from a first research tree displayed in the research map;

receiving a selection of a second filter node comprising a second document result list from a second research tree displayed in the research map;

determining, by a processor, a third result list including documents from both the first document result list and the second document result list; and

generating data to display the third result list.

34 . The method of claim 33 , further comprising:

saving the third result list as a root node of a new research tree.

35 . The method of claim 33 , wherein the first research tree and the second research tree are the same research tree.

36 . A computer-readable storage device storing instructions for searching a document repository using a research map, the instructions causing one or more computer processors to perform operations, comprising:

generating information used to display a research map, the information comprising search nodes, filter nodes, and document nodes;

receiving a selection of a first filter node having a first document result list from a first research tree displayed in the research map;

receiving a selection of a second filter node having a second document result list from a second research tree displayed in the research map;

determining a third result list including documents from both the first document result list and the second document result list; and

generating data to display the third result list.

Assignments (2)
CHANGE OF NAME Recorded Aug 28, 2019
From: LEXISNEXIS; REED ELSEVIER INC.
To: RELX INC.
Reel/Frame 050206/0283 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 10, 2011
From: SHARMA, SANJAY; DALESSIO, JOHN ALEXANDER; MULDER, JEREMY JACOB; MEHRA, GAURAV; MILLER, MOLLY; PENDYALA, MAHESH; FRASCONE, TODD JOSEPH; RITTER, DOUGLAS N.; YIP, GORDON
To: LEXIS NEXIS
Reel/Frame 025931/0701 →