FULL TEXT QUERY AND SEARCH SYSTEMS AND METHOD OF USE

• US 20110055192A1
• Filed: 11/10/2010
• Published: 03/03/2011
• Est. Priority Date: 10/25/2004
• Status: Abandoned Application

• Current Assignee: DeepDyve, Inc.
• Original Assignee: DeepDyve, Inc.
• Inventors: Chen, Chunnuan, Hu, Qianjin, Mei, Minghua, Yang, Yonghong Grace, TANG, YUANHUA TOM
• Application Number:
  US12/943,358
• Publication Number:
  US 20110055192A1
• Time in Patent Office: Days
• US Class Current: 707/706
• CPC Class Codes: G06F 16/3344 using natural language analysis
• CPC Class Codes: G06F 16/3346 using probabilistic model
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06F 16/9538 Presentation of query results

Abstract

Roughly described, a database searching method for searching a database, in which hits are ranked in dependence upon an information measure of itoms shared by both the hit and the query. The information measure can be a Shannon information score, or another measure which indicates the information value of the shared itoms. An itom can be a word or other token, or a multi-word phrase, and can overlap with each other. Synonyms can be substituted for itoms in the query, with the information measure of substituted itoms being derated in accordance with a predetermined measure of the synonyms'"'"' similarity. Indirect searching methods are described in which hit from other search engines are re-ranked in dependence upon the information measures of shared itoms. Structured and completely unstructured databases may be searched, with hits being demarcated dynamically. Hits may be clustered based upon distances in an information-measure-weighted distance space.

Claims

1-100. -100. (canceled)

101. A method for searching a database, for use with a data processing system, comprising the steps of:

the data processing system developing a plurality of preliminary queries in dependence upon a provided first query, each of preliminary queries identifying itoms to search for, all the itoms identified by each of the preliminary queries to search for being identified by the first query, and at least two of the preliminary queries differing from each other;

the data processing system forwarding the preliminary queries to a set of at least one external search engine, each combination of a preliminary search query and an external search engine yielding a respective set of preliminary hits; and

identifying to a user at least one of the hits returned from at least one of the preliminary queries.

102. A method according to claim 101, wherein the step of the data processing system developing a plurality of preliminary queries comprises the steps of:

identifying a plurality of itoms in the first query;

selecting a subset of the plurality of itoms in dependence upon an information measure of the itoms; and

selecting keywords for each of the preliminary queries from the itoms in the subset.

103. A method according to claim 102, wherein the step of selecting a subset of itoms comprises the step of selecting a predetermined number of the highest information measure itoms from the plurality of itoms.

104. A method according to claim 102, wherein the step of selecting keywords comprises the steps of selecting a respective particular number of the keywords for each of the preliminary queries randomly.

105. A method according to claim 101, for use with a first list of itoms each having an associated information measure, further comprising the steps of:

enhancing the information measures associated with itoms in the first list in dependence upon the frequencies of appearance, in the hits returned from the preliminary queries, of the itoms in the first list; and

ranking the hits returned from the preliminary queries in dependence upon the enhanced information measures.

106. A method according to claim 105, further comprising the step of enhancing the first list of itoms with itoms in the hits returned from the preliminary queries and not previously in the first list.

107. A method according to claim 101, wherein at least two of the eternal search engines differ from each other.

114. A method according to claim 101, wherein one of the preliminary queries is a preliminary Boolean search query.

115. A method according to claim 101, wherein a first one of the preliminary queries includes at least one compound itom having more than one token,

further comprising the step of returning, as hits returned from the first preliminary search query, entries in the database which each include at least one of the compound itoms.

116. A method according to claim 115, further comprising the steps of:

detecting, for each particular one of the hits generated from the first preliminary query, which of the preliminary itoms are shared by the 1^st preliminary query and the particular hit; and

ranking the hits generated in the first preliminary search in dependence upon an information measure of the shared itoms determined in the step of detecting.

117. A method according to claim 101, wherein the step of developing a plurality of preliminary queries comprises the steps of:

selecting a proper subset of the itoms in said first query in dependence upon a relative information measure of the itoms in said first query; and

developing a first one of the preliminary queries in a manner that considers itoms in the subset and ignores the itoms not in the subset.

118. A method according to claim 117, wherein the step of forwarding the preliminary queries comprises the step of forwarding to an external search engine itoms in the subset and not itoms not in the subset.

119. A method according to claim 101, wherein the step of developing a plurality of preliminary queries comprises the steps of:

selecting a subset of the itoms in said first query in dependence upon a relative information measure of the itoms in said first query; and

developing each of the preliminary queries in a manner that considers itoms in the subset and ignores the itoms not in the subset.

120. A method according to claim 101, further comprising the step of ranking the hits returned from the preliminary queries in a way that favors hits in which the sequence in which shared itoms appear in the hit matches the sequence in which the shared itoms appear in one of the preliminary queries.

108-113. -113. (canceled)

121. A system for searching a database, comprising:

a memory subsystem; and

a data processor coupled to the memory subsystem, the data processor configured to;

develop a plurality of preliminary queries in dependence upon a provided first query, each of preliminary queries identifying itoms to search for, all the itoms identified by each of the preliminary queries to search for being identified by the first query, and at least two of the preliminary queries differing from each other;

forward the preliminary queries to a set of at least one external search engine, each combination of a preliminary search query and an external search engine yielding a respective set of preliminary hits; and

identify to a user at least one of the hits returned from at least one of the preliminary queries.

122. A system according to claim 121, wherein development of a plurality of preliminary queries comprises:

identifying a plurality of itoms in the first query;

selecting a subset of the plurality of itoms in dependence upon an information measure of the itoms; and

selecting keywords for each of the preliminary queries from the itoms in the subset.

123. A system according to claim 122, wherein selecting a subset of itoms comprises selecting a predetermined number of the highest information measure itoms from the plurality of itoms.

124. A system according to claim 121, for use with a first list of itoms each having an associated information measure, wherein the data processor is further configured to:

enhance the information measures associated with itoms in the first list in dependence upon the frequencies of appearance, in the hits returned from the preliminary queries, of the itoms in the first list; and

rank the hits returned from the preliminary queries in dependence upon the enhanced information measures.

125. A system according to claim 124, wherein the data processor is further configured to enhance the first list of itoms with itoms in the hits returned from the preliminary queries and not previously in the first list.

126. A system according to claim 121, wherein at least two of the external search engines differ from each other.

127. A system according to claim 121, wherein one of the preliminary queries is a preliminary Boolean search query.

128. A system according to claim 121, wherein a first one of the preliminary queries includes at least one compound itom having more than one token,

and wherein the data processor is further configured to return, as hits returned from the first preliminary search query, entries in the database which each include at least one of the preliminary itoms.

129. A system according to claim 128, wherein the data processor is further configured to:

detect, for each particular one of the hits generated from the first preliminary query, which of the preliminary itoms are shared by the 1^st preliminary query and the particular hit; and

rank the hits generated in the first preliminary search in dependence upon an information measure of the shared itoms detected.

130. A system according to claim 121, wherein the development of a plurality of preliminary queries comprises:

selecting a subset of the itoms in said first query in dependence upon a relative information measure of the itoms in said first query; and

developing a first one of the preliminary queries in a manner that considers itoms in the subset and ignores the itoms not in the subset.

131. A system according to claim 130, wherein forwarding the preliminary queries comprises forwarding to an external search engine itoms in the subset and not itoms not in the subset.

132. A system according to claim 121, wherein the development of a plurality of preliminary queries comprises:

selecting a proper subset of the itoms in said first query in dependence upon a relative information measure of the itoms in said first query; and

developing each of the preliminary queries in a manner that considers itoms in the subset and ignores the itoms not in the subset.

133. A system according to claim 121, wherein a first one of the queries requires the sequence in which shared itoms appear in the hit to match the sequence in which the shared itoms appear in the first query.