Method for using region-sets to focus searches in hierarchical structures

• US 6,134,553 A
• Filed: 12/30/1998
• Issued: 10/17/2000
• Est. Priority Date: 05/20/1997
• Status: Expired due to Term

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: AT&T Corporation (AT&T, Inc.)
• Inventors: Suciu, Dan, Srivastava, Divesh, Krishnamurthy, Balachander, Jacobson, Guy
• Primary Examiner(s): Amsbury, Wayne
• Assistant Examiner(s): HAVAN, THU THAO
• Application Number:
  US09/222,801
• Time in Patent Office: 657 Days
• Field of Search: 707/10, 707/3, 707/104, 707/103, 707/513, 707/9, 345/339, 345/348, 345/334
• US Class Current: 1/1
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06F 16/9532 Query formulation
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99939 Privileged access

Abstract

A method improves a search in a hierarchical structure by focusing the search to selected regions within the structure. The method defines one or more region-sets and uses the region-set(s) as either a filter for the results of a key-word search or an integrated part of a search engine to increase the efficiency of the search engine. The method also provides for dynamic creation of new region-sets from existing region-sets using a prescribed set of operators.

Claims

1. A method of filtering a key-word search of a universe of documents wherein the universe comprises a plurality of regions, the method comprising the steps of:

creating a first region-set identifying regions in the universe satisfying a first criterion;

creating a second region-set identifying regions in the universe satisfying a second criterion;

creating a third region-set from said first and said second region-set in accordance with a third criterion; and

presenting as results documents from regions of said third region-set.

2. The method of claim 1 wherein said first criterion is based on network domain names.

3. The method of claim 2 wherein said second criterion is based on network domain names.

4. The method of claim 3 wherein said third criterion specifies the union or intersection of said first region-set and said second region-set.

5. A method for searching a hierarchically structured information space, wherein the space is divisible into a plurality of regions, the method comprising the steps of:

defining a first set of regions which satisfy a first criterion;

defining a second set of regions, which satisfy a second criterion;

creating a third set of regions from said first and second set of regions;

receiving a search query including at least one key-word; and

searching said information space for documents matching said key-word and being located in a region in said third region-set; and

presenting results indicating documents found in said step of searching.

6. The method of claim 5 wherein said hierarchically structured information space is organized using Hyper Text Markup Language and Universal Resource Locators.

7. The method of claim 5 wherein said hierarchically structured information space is organized using file pathnames.

8. A method for searching for documents in a hierarchically structured information space that includes a plurality of nodes of differing hierarchical levels, wherein a particular document region for a given node corresponds to all documents at nodes for which said given node constitutes a root, the method comprising the steps of:

defining a first set of regions, said first set comprising pointers to a first plurality of nodes wherein the first plurality of nodes are logically related in accordance with a first criterion;

defining a second set of regions, said second set comprising pointers to a second plurality of nodes wherein said second plurality of nodes are logically related in accordance with a second criterion;

creating a third set of regions, said third set comprising pointers to a third plurality of nodes, wherein said third plurality of nodes are logically related to said first plurality of nodes and said second plurality of nodes in accordance with a third criterion; and

searching said space in accordance with a search query and said third set of regions.

9. The method of claim 8 wherein said hierarchically structured information space is organized using Hyper Text Markup Language and Universal Resource Locators.

10. The method of claim 8 wherein said hierarchically structured information space is organized using file pathnames.

11. A method for searching for documents in a hierarchically structured information space that includes a plurality of nodes of differing hierarchical levels, wherein a particular document region for a given node contains all documents at nodes for which the given node constitutes a root, the method comprising the steps of:

defining a first set of regions, said first set comprising pointers to a plurality of nodes which are logically related in accordance with a first criterion;

receiving a search query including a keyword; and

searching the information space using the search query and the first set of regions.

12. The method of claim 11 wherein said step of searching comprises:

identifying documents in the information space containing the search query; and

determining which, if any, of the identified documents belong to a region in said first region-set.

13. The method of claim 12 wherein said hierarchically structured information space is organized using Hyper Text Markup Language and Universal Resource Locators.

14. The method of claim 12 wherein said hierarchically structured information space is organized using file pathnames.

15. A method of searching for documents on the world wide web, the method comprising the steps of:

receiving from a user a search query that includes at least one key-word and an operation criterion;

defining a first list of URLs corresponding to nodes satisfying a first criterion;

defining a second list of URLs corresponding to nodes satisfying a second criterion;

defining a third list of URLs using said first list and said second list and said operation criterion; and

identifying to the user documents matching said key-word and containing a URL from said third list,

wherein said first and second criterion are predetermined.

16. A method of searching for documents on the world wide web, the method comprising the steps of:

receiving from a user a search query that includes at least one key-word and an operation criterion;

defining a first list of URLs corresponding to nodes satisfying a first criterion;

defining a second list of URLs corresponding to nodes satisfying a second criterion;

defining a third list of URLs using said first list and said second list and said operation criterion; and

identifying to the user documents matching said key-word and containing a URL from said third list,

wherein said first and second criterion are based on the contents of said search query.