Efficient online computation of diverse query results

Details Efficient online computation of diverse query results Efficient online computation of diverse query results

2011-08-16

2011-08-16

Vo, Tim T. (Department: 2168)

Data processing: database and file management or data structures

Database and file access

Post processing of search results

C707S765000, C707S771000

Reexamination Certificate

active

08001117

ABSTRACT:
The system includes a query engine and an advertisement engine. The query engine is configured to receive a query from the user. The advertisement engine generates advertisement results corresponding to the query. The advertisement results are selected from entries in an advertisement database, where the entries include predicate values corresponding to a domain. The advertisement engine generates a diverse advertisement result that is a subset of the database entries that match the query. The diversity result varies at least one predicate by selecting entries for the list that include a proportional representation of each available predicate value in the database that matches the query.

REFERENCES:
patent: 2004/0193582 (2004-09-01), Smyth
patent: 2005/0210042 (2005-09-01), Goedken
patent: 2005/0222981 (2005-10-01), Lawrence et al.
patent: 2006/0031214 (2006-02-01), Solaro et al.
patent: 2006/0155694 (2006-07-01), Chowdhury et al.
patent: 2007/0288498 (2007-12-01), Dietz et al.
patent: 2007/0294225 (2007-12-01), Radlinski et al.
“The American Heritage New Dictionary of Cultural Literacy, Third Edition,” Houghton Mifflin Company, 2005 <http://www.dictionary.com>.
“The American Heritage New Dictionary of Cultural Literacy, Third Edition,” Houghton Mifflin Company, 2005.
A.Z. Broder, D. Carmel, M. Herscovici, A.Soffer, J.Y. Zien,Efficient query evaluation using a two-level retrieval process, cikm 2003.
N. Bruno, S. Chaudhuri, L. Gravano,Top-K Selection Queries Over Relational Databases: Mapping Strategies and Performance Evaluation, ACM Transactions on Database Systems (TODS), 27(2), 2002, pp. 153-187.
J. Carbonell and J. Goldstein,The use of MMR, diversity-based reranking for reordering documents and producing summaries, SIGIR 98.
M.J. Carey, D. Kossmann,On Saying “Enough Already?” in SQL, SIGMOD Conference 1997.
F.C. Chu, J.Y. Halpern, P. Seshadri,Least Expected Cost Query Optimization: An Exercise in Utility, PODS Conference 1999.
Introduction to Dewey Decimal Classification, Online Computer Library Center, http://www.oclc.org/dewey/about/about—the—ddc.htm.
D. Donjerkovic, R. Ramakrishman,Probabilistic Optimization of Top N Queries, VLDB Conference 1999.
R. Fagin, A. Lotem, M. Naor,Optimal Aggregation Algorithms for Middleware, PODS Conference 2001.
R. Fagin,combining Fuzzy Information from Multiple Systems, PODS Conference 1996.
L. Guo, F. Shao, C. Botev, J. Shanmugasundaram,XRANK: Ranked Keyword Search over XML Documents, SIGMOD Conference 2003.
V. Hristidis, N. Koudas, Y. Papakonstantinou,PREFER: A system for the Efficient Execution of Multiparametric Ranked Queries, SIGMOD Conference 2001.
A. Halverson et al.,Mixed Mode XML Query Processing, VLDB 2003.
J.M. Hellerstein, P.J. Haas, H.J. Wang,Online Aggregation, SIGMOD Conference 1997.
R. Kaushik, R. Krishnamurthy, J. Naughton, R. Ramakrishnan,On the Integration of Structure Indexes and Inverted Lists, ICDE Conference 2004.
G. Koutrika, A. Simitsis, Y. Ioannidis,Précis: The Essence of a Query Answer, ICDE Conference 2006.
C. Li, K. Chen-Chang, I. Ilyas, S. Song,RankSQL: Query Algebra and Optimization for Relational Top-k Queries, SIGMOD Conference 2005.

Affiliated with

Also associated with

Rating

Efficient online computation of diverse query results does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient online computation of diverse query results, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient online computation of diverse query results will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2663129