WO2001033425A9 - Method and system for navigating within a body of data using one of a number of alternative browse graphs - Google Patents
Method and system for navigating within a body of data using one of a number of alternative browse graphsInfo
- Publication number
- WO2001033425A9 WO2001033425A9 PCT/US2000/027159 US0027159W WO0133425A9 WO 2001033425 A9 WO2001033425 A9 WO 2001033425A9 US 0027159 W US0027159 W US 0027159W WO 0133425 A9 WO0133425 A9 WO 0133425A9
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- browse
- graph
- data
- user
- browse graph
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/954—Navigation, e.g. using categorised browsing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99939—Privileged access
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99941—Database schema or data structure
- Y10S707/99943—Generating database or data structure, e.g. via user interface
Definitions
- the present invention is directed to the field of data browsing, and, more particularly, to the field of customizable data browsing.
- a browse graph is a structure, or a "map,” for navigating the information contained in the body of data.
- a browse graph is made up of nodes between which the user may move to access different portions of the information in the body of data.
- the user begins at a first node, called a "root node.”
- the user may choose from a number of different categories. By selecting one of these categories, the user moves to a different node, where the user may view a portion of the information in the body of data pertaining to the selected category and/or select from among a new set of categories to move to another node in the graph.
- an online merchant may provide a browse graph onto information on a large number of items that it is offering for sale.
- a user begins at the root node of the browse graph, and there chooses "COLLECTIBLES” from among a list of high-level categories including "ARTS & ANTIQUES,” “BOOKS,” “CLOTHING & ACCESSORIES,” “COINS & STAMPS,” and “COLLECTIBLES,” among others.
- "COLLECTIBLES” category the user moves to a lower-level node in the graph.
- the user chooses "PEZ” from among a list of lower-level categories that are all subcategories of "COLLECTIBLES,” including “AUTOGRAPHS,” “BOTTLES & CANS,” “LUNCHBOXES,” and “PEZ,” among others.
- "PEZ” category the user moves to a yet-lower-level node in the graph, where the user can view information on Pez candy dispensers offered for sale by the online merchant.
- Such browse graphs while generally useful, can be disadvantageous when they are poorly adapted to a particular user. For example, where a browse graph locates information that a user is particularly interested in at a level "deep" in the browse graph, thereby requiring a large number of selections to reach the information, that browse graph becomes cumbersome for that user to use. On the other hand, where a browse graph provides access to information that a user does not wish to see or is prohibited from seeing, that browse graph is over-inclusive with respect to that user. Accordingly, a facility for providing browse graphs that are customized to their users would have significant utility.
- Figure 1 is a high-level block diagram showing the environment in which the facility preferably operates.
- Figures 2A-2C are display diagrams showing a user browsing to a "PEZ" category using a first browse graph.
- Figures 3A-3B are display diagrams showing that a user is unable to browse to the "PEZ" category using a second browse graph.
- Figures 4A-4E are display diagrams showing a user browsing to a "PHONES" category using the first browse graph.
- Figures 5A-5B are display diagrams showing a user using the second browse graph browse to a "HANDIES” category having the same contents as the "PHONES" graph in the first browse graph.
- Figure 6 is a flow diagram showing the steps preferably performed by the facility in order to select and use a particular browse graph for browsing.
- Figure 7 is a flow diagram showing the steps preferably performed by the facility in order to generate an alternative browse graph.
- Figure 8 is a data structure diagram showing a sample browse graph.
- Figure 9 is a data structure diagram showing a sample alternative browse graph derived from the browse graph shown in Figure 8.
- Figure 10 is a data structure diagram showing a sample relation table representing a single browse graph.
- Figure 11 is a data structure diagram showing a sample relation table representing two alternative browse graphs, including the browse graph represented by the relation table shown in Figure 10 and an alternative browse graph derived from the browse graph represented by the relation table shown in Figure 10.
- the present invention is directed to data navigation using one of a number of alternative browsing graphs.
- a browsing facility (“the facility”) maintains two or more different browsing graphs on the same set of browse data. Based upon information associated with a user seeking to browse the browse data, or based upon the nature of a request issued by the user, the facility selects one of the browsing graphs, which is used by the user to browse the browse data.
- the facility enables a user to utilize a browse graph that is tailored to the user. For example, for a user that has a special interest in a particular kind of data, the user may utilize a browse graph that features that data more prominently, allowing the user to reach the data much more efficiently.
- FIG. 1 is a high-level block diagram showing the environment in which the facility preferably operates.
- the block diagram shows client computer systems, such as client computer systems 110 and 120, that are connected via the Internet 130 to a server computer system 140.
- client computer systems could be connected to the server computer system by networks other than the Internet, however.
- the client computer systems preferably have a web client computer program, such as web clients 121 and 131, that are used by users to connect to a web server computer program 141 in the server computer system.
- the web server together with the facility 142, enables the user of a web client to browse a body of browse data, such as browse data 151 and browse data 161.
- Such browsing uses one of a plurality of browse graphs, also called "browse hierarchies" provided for the browse data.
- browse data 161 three browse graphs 165, 166 and 167 are provided.
- a body of browse data together with the browse graphs provided for are together known as a "browse group.”
- browse data 161 and browse graphs 165, 166, and 167 together comprise browse group 160.
- the facility 142 executing on the server computer system preferably identifies one of the browse graphs provided for a body of browse data as described further below.
- each of the browse graphs in a particular browse group is distributed to a different server computer system, such that the browse graph used by the user is determined by the identity of the server computer system to which the user connects.
- the browse data may either be maintained in a central server computer system, or replicated to some or all of the multiple server computer systems.
- FIGS. 2A-2C are display diagrams showing a user browsing to a "PEZ" category containing such information using a first browse graph in which such information is accessible.
- Figure 2A shows the display of a web page ("page") 201 containing the initial categories occurring at the root node of the first browse graph.
- the categories 210 include "COLLECTIBLES" category 111.
- the facility displays page 202 shown in Figure 2B.
- Page 202 contains a new set of categories 220, each relating to a different type of collectible items.
- the categories 220 include a "PEZ" category 221 for Pez candy dispensers.
- category 221 for Pez candy dispensers the facility displays page 203 shown in Figure 2C.
- Page 203 contains information 230 about Pez candy dispensers that are for sale.
- information item 231 shows information about a Pez candy dispenser in the shape of the Marvin the Martian character that is being sold via online auction.
- the first browse graph is contrasted with a second browse graph, which prevents access to information about Pez candy dispensers that are for sale.
- Such prevention may be desirable where the user is uninterested in or offended by such candy dispensers, or where the user resides in a jurisdiction where the sale or purchase of such candy dispensers is illegal.
- Figures 3A-3B are display diagrams showing that a user is unable to browse to the "PEZ" category using a second browse graph.
- Figure 3 A shows the display of page 301, in which is displayed a list 310 of the categories available from the root node of the second browse graph.
- the displayed categories 310 includes a "COLLECTIBLES" category 311.
- Page 302 shown in Figure 3B is displayed.
- Page 302 contains a list 320 available at the collectibles node of the second browse graph.
- Categories 320 shown in Figure 3B differ from categories 210 in that they omit the "PEZ" category included in the first browse graph. Because this category is not available at the collectibles node of the second browse graph, users using the second browse graph to browse the body of information about items offered for sale are prevented from accessing information about Pez candy dispensers that are for sale.
- a second aspect of the example shows how a browse graph may be adapted to locate information about a topic of interest to its users in close proximity to the root node, thereby shortening the path of interactions that users must perform in order to browse to such information.
- a path requiring four interactions in the first browse graph is reduced to a path requiring only one interaction in the second browse graph.
- Figures 4A-4E are display diagrams showing a user browsing to a "PHONES" category using the first browse graph.
- Figure 4A shows the display of page 401, which contains the categories 410 at the root node of the first browse graph.
- the categories 410 include an "ELECTRONICS & PHOTOGRAPHY" category 411.
- Page 402 includes categories 420 each corresponding to a subcategory of "ELECTRONICS & PHOTOGRAPHY.”
- the categories 420 include a "CONSUMER ELECTRONICS,” category 421.
- Page 403 includes categories 430 each corresponding to a subcategory of "CONSUMER ELECTRONICS.” Categories 430 include a "MOBILE PHONES" category 431.
- Page 404 contains categories 440 relating to mobile phones a "PHONES" category 441.
- page 405 shows page 4E.
- Page 405 contains information 450 about cellular phone items that are for sale.
- information item 451 contains information about an Audivox cellular phone that is for sale via auction. It can be seen that traversing the first browse graph to access information about cellular phones is relatively arduous, requiring four different user interactions to reach the information from the root node.
- the second browse graph on the other hand, developed for users having an interest in mobile phones, enables a user to browse to the same information in a single interaction.
- Figures 5A-5B are display diagrams showing a user using the second browse graph to browse to a "HANDIES” category having the same contents as the "PHONES" category in the first browse graph.
- Figure 5 shows the display of page 501 at the root of the second browse graph.
- Page 501 includes a list of categories 510 which, in addition to the "ELECTRONICS & PHOTOGRAPHY” category 512, includes a "HANDIES” category 511.
- Page 502 contains information 520 about mobile phones, or "handies” that are for sale. It can be seen that, when using the second browse graph, this information may be accessed with only a single user interaction by selecting the handies category at the root of the second browse graph.
- the facility provides for browse graphs to be created and associated with users in a variety of ways.
- a browse graph may be associated with a single user, or with a class, or "group” of users. That is, each browse graph may be associated with a particular user's identity, or rather may be associated with groups of users having particular Internet Service Providers, domain name designations, geographic or political regions, or buying patterns.
- browse graphs may be dynamically selected by users, either explicitly or implicitly.
- the facility preferably displays a list or other indication of the available browse graphs. The user then clicks on or otherwise identifies the browse graph that the user wishes to use to browse the associated body of data.
- the selection of a browse graph is performed by the way in which the user selects the body of data to be browsed. For example, if a company operated a first online auction website for the United States and a second online auction website for the United Kingdom, the company could establish a first browse graph on the auction data for the United States online auction website and a second browse graph on the auction data for the United Kingdom on-line auction website. The user would implicitly select between the first and second browse graphs by selecting between the United States and the United Kingdom websites.
- a browse graph may be dynamically generated in response to a browse request, based upon such factors as are described above.
- Figure 6 is a flow diagram showing the steps preferably performed by the facility in order to select and use a particular browse graph for browsing.
- the facility selects one of the plurality of browse graphs available for the body of data. Such a selection is preferably performed in one or more of the manners discussed above, or may be performed using additional bases.
- the facility sets the current node of the traversal to the root node of the selected browse graph. The facility then loops through steps 603-607 while the current node is the parent of at least one relation between nodes.
- the facility displays a hyperlink for each relation of which the current node is the parent, such as the hyperlinks of the categories 210 shown in Figure 2 A.
- step 605 the facility receives user input selecting one of the hyperlinks displayed in step 604.
- step 606 the facility changes the current node in the traversal to the node that is the child of the relation whose hyperlink is selected.
- step 607 if the new current node is the parent of at least one relation in the browse graph, then the facility continues in step 604, else the facility continues in step 608.
- step 608 the traversal has reached a leaf node of the browse graph that has no children and with which specific browse data is associated, and the facility displays the browse data stored for the current node. After step 608, these steps conclude.
- Figure 7 is a flow diagram showing the steps preferably performed by the facility in order to generate an alternative browse graph.
- the facility creates a copy of an existing browse graph.
- the facility translates the names of the relations occurring in the copy of the browse graph if the new browse graph is to be in a different natural language.
- the facility modifies the copy of the browse graph to customize the copy of the browse graph for its intended audience.
- Step 703 variously involves adding and/or deleting relations in the copy of the browse graph. After step 703, these steps conclude and the new browse graph can be made available for use by users.
- Figure 8 is a data structure diagram showing a sample browse graph.
- the browse graph is comprised of nodes, shown as circles, connected by directional relations, shown as arrows. Each relation is said to have a parent node, shown at the tail end of its arrow, and a child node, shown at the head end of its arrow.
- Five relations are shown in Figure 8 that have the root node, node 1, as their parent node: "COINS & STAMPS” relation 5, "COLLECTIBLES” relation 6, "COMICS, CARDS, & SCI-FI” relation 7, “COMPUTERS & SOFTWARE” relation 8, and "ELECTRONICS & PHOTOGRAPHY” relation 9.
- Each of these relations corresponds to a category shown when positioned at the root node of the first browse graph.
- the facility traverses the browse graph along that relation from the relation's parent node to its child node. For example, if the category for "COLLECTIBLES" relation 6 is selected by the user while at the root node, the facility traverses the collectible relation 6 to its child node, node 36.
- the facility displays the page containing categories corresponding to the relations that have the current node, node 36, as their parent node: "COINS & STAMPS" relation 23, "PAPER” relation 94, "PEZ” relation 95 and "PINBACKS” relation 96.
- the facility traverses that relation. For example, if the user selects the category corresponding to the "PEZ” relation 95, then the facility traverses the "PEZ" relation 95 to node 76.
- Node 76 is characterized as a "leaf node,” as there are no relations having node 76 as their parent node.
- leaf nodes are identified by a double circle.
- the facility traverses to node 76 it identifies node 76 as a leaf node, and displays the browse information associated with it — in this case, the Pez candy dispenser items for sale information shown in Figure 2C.
- the number of relations that must be traversed from the root node in order to reach a particular node is referred to as the depth of that node in the graph.
- leaf node 92 may be reached either through the path containing "COINS & STAMPS" relation 5 and "COLLECTIBLES” relation 14, or by the path containing "COLLECTIBLES” relation 6 and "COINS & STAMPS” relation 23.
- Such "alternative paths" to the same node from the root node may contain different numbers of relations.
- some nodes and relations — identified by ellipses — have been omitted from the browse graph shown in Figure 8.
- Figure 9 is a data structure diagram showing a sample alternative browse graph derived from the browse graph shown in Figure 8.
- the browse graph shown in Figure 9 has been derived from the browse graph shown in Figure 8 using the steps shown in Figure 7.
- the two browse graphs shown therein are mostly comprised of the same nodes and relations.
- "PEZ" relation 95 occurring in the first browse graph shown in Figure 8 is omitted from the second browse graph shown in Figure 9, thereby preventing access to the browse data associated with node 76 by those users using the second browse graph.
- the second browse graph further differs from the first browse graph in that it contains "HANDIES" relation 693 from the root node to leaf node 44. This relation has been added to make the browse information associated with the node 44 more readily available to users of the second browse graph.
- Figure 10 is a data structure diagram showing a sample relation table representing only the first browse graph.
- the relation table 1000 is comprised of rows 1011-1023, each corresponding to one relation in the first browse graph. Each row contains five fields: a graph identifier field 1001, a relation identifier field 1002, relation name field 1003, parent node identifier 1004, and a child node identifier 1005. Because relation table 1000 contains only relations in the first browse graph, the graph identifier field in every row contains the same graph identifier.
- the relations identifier field contains a unique identifier for each relation in the graph.
- relation identifier field of row 1019 contains the relation identifier "95" for the "PEZ” relation shown in Figure 8.
- Relation name field contains the name of the relation for each row, which preferably corresponds to the text displayed by the facility to the user for selecting a further category.
- the parent node identifier field contains the unique identifier of the node that is the parent node for the relation described by the row. For example, row 1019 indicates that the parent node of the "PEZ" relation 95 has a node identifier "36.”
- the child node identifier field indicates the node identifier for the node that is the child node of the relation that the row describes. For example, row 1019 indicates that the child node of the Pez relation 95 has node identifier "76.”
- the facility In order to identify for a particular current node the categories that are available for selection, the facility preferably searches the relation table for relations having the node identifier of the current node in their parent node identifier fields. If the result set of such rows is nonempty, then the facility preferably displays the relation names of those relations as categories for the user to choose. If, on the other hand, the result set is empty, then the current node is a leaf node, and the facility preferably displays the browse data associated with the leaf node.
- Figure 11 is a data structure diagram showing a sample relation table representing both the first and the second browse graphs.
- the facility has copied the contents of rows 1011-1023 and to relation table 1100 as new rows 1124- 1136.
- the facility changes the graph identifier field for the new rows to contain the new graph identifier 2 identifying the new browse graph.
- the facility further deleted the copy of row 1019 for the "PEZ" relation 95 among the new rows, and added row 1136 for the new "HANDIES” relation 693.
- browse graphs may be provided on bodies of data of virtually any type. While the foregoing description makes reference to preferred embodiments, the scope of the invention is defined solely by the claims that follow and the elements recited therein.
Abstract
Description
Claims
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
AU78476/00A AU7847600A (en) | 1999-11-03 | 2000-10-03 | Method and system for navigating within a body of data using one of a number of alternative browse graphs |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/433,799 US6625609B1 (en) | 1999-11-03 | 1999-11-03 | Method and system for navigating within a body of data using one of a number of alternative browse graphs |
US09/433,799 | 1999-11-03 |
Publications (3)
Publication Number | Publication Date |
---|---|
WO2001033425A2 WO2001033425A2 (en) | 2001-05-10 |
WO2001033425A9 true WO2001033425A9 (en) | 2002-12-05 |
WO2001033425A3 WO2001033425A3 (en) | 2003-12-24 |
Family
ID=23721569
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/US2000/027159 WO2001033425A2 (en) | 1999-11-03 | 2000-10-03 | Method and system for navigating within a body of data using one of a number of alternative browse graphs |
Country Status (3)
Country | Link |
---|---|
US (3) | US6625609B1 (en) |
AU (1) | AU7847600A (en) |
WO (1) | WO2001033425A2 (en) |
Families Citing this family (20)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8438487B1 (en) * | 1999-05-24 | 2013-05-07 | Catherine Lin-Hendel | Method and system for one-click navigation and browsing of electronic media and their category structure as well as tracking the navigation and browsing thereof |
US6444072B1 (en) * | 1999-08-11 | 2002-09-03 | Southpac Trust International | Process for producing holographic material |
US8185549B1 (en) | 1999-11-03 | 2012-05-22 | A9.Com, Inc. | Method and system for navigating within a body of data using one of a number of alternative browse graphs |
US6625609B1 (en) * | 1999-11-03 | 2003-09-23 | Amazon.Com, Inc. | Method and system for navigating within a body of data using one of a number of alternative browse graphs |
US20010034694A1 (en) * | 2000-02-25 | 2001-10-25 | Elias Brian K. | System for providing an online collectibles marketplace |
AU2001240061A1 (en) | 2000-03-09 | 2001-09-17 | The Web Access, Inc. | Method and apparatus for organizing data by overlaying a searchable database with a directory tree structure |
IES20020335A2 (en) * | 2001-05-10 | 2002-11-13 | Changing Worlds Ltd | Intelligent internet website with hierarchical menu |
US20020184194A1 (en) * | 2001-05-30 | 2002-12-05 | International Business Machines Corporation | Multipurpose web-enabled browser |
EP1343098A1 (en) * | 2002-03-07 | 2003-09-10 | Hewlett-Packard Company | Improvements relating to network environments and location of resources therein |
US8335779B2 (en) * | 2002-08-16 | 2012-12-18 | Gamroe Applications, Llc | Method and apparatus for gathering, categorizing and parameterizing data |
EP1477893B1 (en) * | 2003-05-16 | 2015-09-16 | Sap Se | Method for inputting data in a computer system. |
US20070234232A1 (en) * | 2006-03-29 | 2007-10-04 | Gheorghe Adrian Citu | Dynamic image display |
US20070016652A1 (en) * | 2005-03-29 | 2007-01-18 | Citu Gheorghe A | Dynamic image display |
US8571930B1 (en) | 2005-10-31 | 2013-10-29 | A9.Com, Inc. | Strategies for determining the value of advertisements using randomized performance estimates |
US7542951B1 (en) | 2005-10-31 | 2009-06-02 | Amazon Technologies, Inc. | Strategies for providing diverse recommendations |
US7584159B1 (en) | 2005-10-31 | 2009-09-01 | Amazon Technologies, Inc. | Strategies for providing novel recommendations |
US20070106593A1 (en) * | 2005-11-07 | 2007-05-10 | Grant Lin | Adaptive stochastic transaction system |
US7962861B2 (en) * | 2006-02-23 | 2011-06-14 | International Business Machines Corporation | Creating a sentence that describes a walk of a graph |
US8126926B2 (en) * | 2008-12-22 | 2012-02-28 | Oracle International Corporation | Data visualization with summary graphs |
US8298087B1 (en) | 2009-01-02 | 2012-10-30 | Nintendo Of America Inc. | Recommendation engine for electronic game shopping channel |
Family Cites Families (25)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5600831A (en) * | 1994-02-28 | 1997-02-04 | Lucent Technologies Inc. | Apparatus and methods for retrieving information by modifying query plan based on description of information sources |
US5801702A (en) * | 1995-03-09 | 1998-09-01 | Terrabyte Technology | System and method for adding network links in a displayed hierarchy |
US5721908A (en) * | 1995-06-07 | 1998-02-24 | International Business Machines Corporation | Computer network for WWW server data access over internet |
JP2861908B2 (en) * | 1996-01-16 | 1999-02-24 | 日本電気株式会社 | Browsing device |
US5812134A (en) * | 1996-03-28 | 1998-09-22 | Critical Thought, Inc. | User interface navigational system & method for interactive representation of information contained within a database |
US5963948A (en) * | 1996-11-15 | 1999-10-05 | Shilcrat; Esther Dina | Method for generating a path in an arbitrary physical structure |
US5848412A (en) * | 1996-11-19 | 1998-12-08 | Ncr Corporation | User controlled browser identification disclosing mechanism |
US6009459A (en) * | 1997-01-10 | 1999-12-28 | Microsoft Corporation | Intelligent automatic searching for resources in a distributed environment |
US5907843A (en) * | 1997-02-27 | 1999-05-25 | Apple Computer, Inc. | Replaceable and extensible navigator component of a network component system |
US5937404A (en) * | 1997-04-23 | 1999-08-10 | Appaloosa Interactive Corporation | Apparatus for bleaching a de-activated link in a web page of any distinguishing color or feature representing an active link |
US6081814A (en) * | 1997-07-07 | 2000-06-27 | Novell, Inc. | Document reference environment manager |
GB9721502D0 (en) * | 1997-10-11 | 1997-12-10 | Int Computers Ltd | Computer system for supporting a website |
US6192398B1 (en) * | 1997-10-17 | 2001-02-20 | International Business Machines Corporation | Remote/shared browser cache |
US6324552B1 (en) * | 1997-11-25 | 2001-11-27 | International Business Machines Corporation | Browsers for focused access of data |
US6078928A (en) * | 1997-12-12 | 2000-06-20 | Missouri Botanical Garden | Site-specific interest profiling system |
JP3219386B2 (en) * | 1997-12-26 | 2001-10-15 | 松下電器産業株式会社 | Information filter device and information filter method |
US6173316B1 (en) * | 1998-04-08 | 2001-01-09 | Geoworks Corporation | Wireless communication device with markup language based man-machine interface |
US6211877B1 (en) * | 1998-07-20 | 2001-04-03 | Hewlett-Packard Co | Method for communicating between programming language controlled frames and CGI/HTML controlled frames within the same browser window |
US6356902B1 (en) * | 1998-07-28 | 2002-03-12 | Matsushita Electric Industrial Co., Ltd. | Method and system for storage and retrieval of multimedia objects |
US6457009B1 (en) * | 1998-11-09 | 2002-09-24 | Denison W. Bollay | Method of searching multiples internet resident databases using search fields in a generic form |
US7328405B1 (en) * | 1998-12-09 | 2008-02-05 | Netscape Communications Corporation | Smart browsing providers |
US6484263B1 (en) * | 1999-01-28 | 2002-11-19 | International Business Machines Corporation | Security profile for web browser |
US6633852B1 (en) * | 1999-05-21 | 2003-10-14 | Microsoft Corporation | Preference-based catalog browser that utilizes a belief network |
US6317744B1 (en) * | 1999-08-23 | 2001-11-13 | International Business Machines Corporation | Method, system and program products for browsing fully-associative collections of items |
US6625609B1 (en) * | 1999-11-03 | 2003-09-23 | Amazon.Com, Inc. | Method and system for navigating within a body of data using one of a number of alternative browse graphs |
-
1999
- 1999-11-03 US US09/433,799 patent/US6625609B1/en not_active Expired - Lifetime
-
2000
- 2000-10-03 WO PCT/US2000/027159 patent/WO2001033425A2/en active Application Filing
- 2000-10-03 AU AU78476/00A patent/AU7847600A/en not_active Abandoned
-
2003
- 2003-07-14 US US10/619,654 patent/US7139771B2/en not_active Expired - Lifetime
-
2006
- 2006-11-17 US US11/561,298 patent/US7870155B2/en not_active Expired - Fee Related
Also Published As
Publication number | Publication date |
---|---|
WO2001033425A2 (en) | 2001-05-10 |
AU7847600A (en) | 2001-05-14 |
US20040068492A1 (en) | 2004-04-08 |
US20080033981A1 (en) | 2008-02-07 |
US7870155B2 (en) | 2011-01-11 |
US6625609B1 (en) | 2003-09-23 |
WO2001033425A3 (en) | 2003-12-24 |
US7139771B2 (en) | 2006-11-21 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7870155B2 (en) | Method and system for navigating within a body of data using one of a number of alternative browse graphs | |
US7603367B1 (en) | Method and system for displaying attributes of items organized in a searchable hierarchical structure | |
US7353460B2 (en) | Web site navigation under a hierarchical menu structure | |
KR100289298B1 (en) | Named bookmark set | |
US7089237B2 (en) | Interface and system for providing persistent contextual relevance for commerce activities in a networked environment | |
US6505230B1 (en) | Client-server independent intermediary mechanism | |
US8515998B1 (en) | Framework for managing document objects stored on a network | |
Anupam et al. | Automating Web navigation with the WebVCR | |
JP4422902B2 (en) | Method and system for electronic commerce using multiple roles | |
US7548914B2 (en) | System and method for providing active tags | |
JP4813552B2 (en) | A system for generating relevant search queries | |
US7158971B1 (en) | Method for searching document objects on a network | |
US20090327240A1 (en) | System And Method For Organizing Data In A Dynamic User-Customizable Interface For Search And Display | |
US20060218230A1 (en) | Data Synchronization Mechanism for Information Browsing Systems | |
WO2002044939A1 (en) | Adaptive catalog page display | |
WO2007106148A2 (en) | Internet guide link matching system | |
US7146407B2 (en) | Data synchronization mechanism for information browsing systems | |
US7765203B2 (en) | Implicit context collection and processing | |
US20030225781A1 (en) | Entry points for navigation of hierarchical information structures | |
US20040193591A1 (en) | Searching content information based on standardized categories and selectable categorizers | |
US9286363B2 (en) | Alternative browse graphs for viewing data | |
Rossi et al. | Patterns for designing navigable information spaces | |
US20030078993A1 (en) | Data synchronization mechanism for information browsing systems | |
US20020072981A1 (en) | Search engine adapted to permit real time querying of a set of internet sites | |
Foo et al. | Managing world wide web publications |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A2 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A2 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
REG | Reference to national code |
Ref country code: DE Ref legal event code: 8642 |
|
AK | Designated states |
Kind code of ref document: C2 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: C2 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG |
|
122 | Ep: pct application non-entry in european phase | ||
NENP | Non-entry into the national phase |
Ref country code: JP |