# US 8,751,545 B1 · Method and system for navigating within a body of data using one of a number of alternative browse graphs > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 8,751,545 B1 - Document ID: US8751545B1 - Status: Granted - Kind: B1 - Application number: 13/472,714 - Filed: 2012-05-16 - Granted: 2014-06-10 - Earliest claimed: 1999-11-03 - Assignees: A9.com, Inc. - Applicants: Robert W. McDade; Anne K. Krook; Bonnie Bouman - Inventors: Robert W. McDade; Anne K. Krook; Bonnie Bouman - Web page: https://patentgrep.com/patent/US8751545B1 ## CPC - G06F 16/26: Visual data mining; Browsing structured data - G06F 16/954: Navigation, e.g. using categorised browsing - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract A facility for navigating within a body of data using one of a number of distinct browse graphs is described. Initially, a navigation request is received. Based upon information contained in the received navigation request, the facility selects one of the plurality of browse graphs. In response to user input, the facility browses the body of data using the selected browse graph. The browse graphs may each correspond to a collection of the body of data, such as a website. ## Claims ### Claim 1 A computer implemented method for providing alternative browse graphs for viewing data, said method comprising: under control of one or more computing devices configured with executable instructions, reading a data set including a plurality of data items; obtaining a browse graph for the data items contained in the data set, the browse graph including a plurality of nodes connected by one or more relations, the browse graph being associated with a first set of users, wherein a user of the first set of users is able to navigate the data set using the browse graph; creating a copy of the browse graph; modifying the copy of the browse graph by adding or deleting relations in the copy of the browse graph in order to customize the copy of the browse graph for a second set users; and associating the modified copy of the browse graph with said second set of users. ### Claim 2 (depends on 1) The computer implemented method of claim 1, further comprising: receiving, from a user, a request to navigate the data set; determining whether the user is associated with a first set of users or a second set users; and employing the browse graph to navigate the data set if the user is determined to be associated with the first set of users, otherwise employing the modified copy of the browse graph to navigate the data set if the user is determined to be associated with the second set of users. ### Claim 3 (depends on 1) The computer implemented method of claim 1, wherein modifying the copy of the first browse graph further includes: translating names of the relations occurring in the copy of the browse graph into a different natural language. ### Claim 4 (depends on 1) The computer implemented method of claim 1, wherein the modified copy of the browse graph prevents the second set of users from accessing at least one data item that is accessible via the browse graph by the first set of users. ### Claim 5 (depends on 1) The computer implemented method of claim 1, wherein the modified copy of the browse graph includes a path to at least one data item that is shorter than the path to said data item in the browse graph. ### Claim 6 (depends on 1) The computer implemented method of claim 1, wherein the second set of users is associated with a set of attributes that are different from the first set of users. ### Claim 7 (depends on 6) The computer implemented method of claim 6, wherein the set of attributes further include: an identity of a user; an Internet service provider associated with the user; a domain name designation associated with the user; a geographic region associated with the user; and a buying pattern associated with the user. ### Claim 8 A non-transitory computer-readable medium storing a set of instructions which when executed by one or more processors instruct the one or more processors to perform a plurality of steps comprising: reading a data set including a plurality of data items; obtaining a browse graph for the data items contained in the data set, the browse graph including a plurality of nodes connected by one or more relations, the browse graph being associated with a first set of users, wherein a user of the first set of users is able to navigate the data set using the browse graph; creating a copy of the browse graph; modifying the copy of the browse graph by adding or deleting relations in the copy of the browse graph in order to customize the copy of the browse graph for a second set users; and associating the modified copy of the browse graph with said second set of users. ### Claim 9 (depends on 8) The non-transitory computer readable storage medium of claim 8, further comprising instructions to perform the steps of: receiving, from a user, a request to navigate the data set; determining whether the user is associated with a first set of users or a second set users; and employing the browse graph to navigate the data set if the user is determined to be associated with the first set of users, otherwise employing the modified copy of the browse graph to navigate the data set if the user is determined to be associated with the second set of users. ### Claim 10 (depends on 8) The non-transitory computer readable storage medium of claim 8, wherein the modified copy of the browse graph prevents the second set of users from accessing at least one data item that is accessible via the browse graph by the first set of users. ### Claim 11 (depends on 8) The non-transitory computer readable storage medium of claim 8, wherein modifying the copy of the first browse graph further includes: translating names of the relations occurring in the copy of the browse graph into a different natural language. ### Claim 12 (depends on 8) The non-transitory computer readable storage medium of claim 8, wherein the modified copy of the browse graph includes a path to at least one data item that is shorter than the path to said data item in the browse graph. ### Claim 13 (depends on 8) The non-transitory computer readable storage medium of claim 8, wherein the second set of users is associated with a set of attributes that are different from the first set of users. ### Claim 14 (depends on 13) The non-transitory computer readable storage medium of claim 13, wherein the set of attributes further include: an identity of a user; an Internet service provider associated with the user; a domain name designation associated with the user; a geographic region associated with the user; and a buying pattern associated with the user. ### Claim 15 A system, comprising: one or more processors; a memory device including instructions, which when executed by the one or more processors, cause the system to perform a plurality of steps comprising: reading a data set including a plurality of data items; obtaining a browse graph for the data items contained in the data set, the browse graph including a plurality of nodes connected by one or more relations, the browse graph being associated with a first set of users, wherein a user of the first set of users is able to navigate the data set using the browse graph; creating a copy of the browse graph; modifying the copy of the browse graph by adding or deleting relations in the copy of the browse graph in order to customize the copy of the browse graph for a second set users; and associating the modified copy of the browse graph with said second set of users. ### Claim 16 (depends on 15) The system of claim 15, wherein the memory device includes further instructions to cause the system to perform the steps of: receiving, from a user, a request to navigate the data set; determining whether the user is associated with a first set of users or a second set users; and employing the browse graph to navigate the data set if the user is determined to be associated with the first set of users, otherwise employing the modified copy of the browse graph to navigate the data set if the user is determined to be associated with the second set of users. ### Claim 17 (depends on 15) The system of claim 15, wherein the modified copy of the browse graph prevents the second set of users from accessing at least one data item that is accessible via the browse graph by the first set of users. ### Claim 18 (depends on 15) The system of claim 15, wherein modifying the copy of the first browse graph further includes: translating names of the relations occurring in the copy of the browse graph into a different natural language. ### Claim 19 (depends on 15) The system of claim 15, wherein the modified copy of the browse graph includes a path to at least one data item that is shorter than the path to said data item in the browse graph. ### Claim 20 (depends on 15) The system of claim 15, wherein the second set of users is associated with a set of attributes that are different from the first set of users. ### Claim 21 (depends on 20) The system of claim 20, wherein the set of attributes further include: an identity of a user; an Internet service provider associated with the user; a domain name designation associated with the user; a geographic region associated with the user; and a buying pattern associated with the user.