NDLI: Top-k aggregation using intersections of ranked inputs

Please wait, while we are loading the content...

Challenges in building large-scale information retrieval systems: invited talk

Diversifying search results

Clustering the tagged web

Measuring the similarity between implicit semantic relations using web search engines

Efficient multiple-click models in web search

Mining user web search activity with layered bayesian networks or how to capture a click in its context

Effective latent space graph-based re-ranking model with global consistency

Camera brand congruence in the Flickr social graph

Online social networks: modeling and mining: invited talk

Discovering and using groups to improve personalized search

Classifying tags using open content resources

A model for fast web mining prototyping

Characterizing the influence of domain expertise on web search behavior

Generating labels from clicks

Top-k aggregation using intersections of ranked inputs

Finding text reuse on the web

Harvesting, searching, and ranking knowledge on the web: invited talk

Adaptive subjective triggers for opinionated document retrieval

Cross-language query classification using web search for exogenous knowledge

Quality-aware collaborative question answering: methods and evaluation

Integration of news content into web results

Is Wikipedia link structure different?

Speeding up algorithms on compressed web graphs

Query by document

Improving music genre classification using collaborative tagging data

A new visual search interface for web browsing

Mining common topics from multiple asynchronous text streams

Less is more: sampling the neighborhood graph makes SALSA better and faster

The web changes everything: understanding the dynamics of web content

Wikipedia pages as entry points for book search

Information arbitrage across multi-lingual Wikipedia

Predicting the readability of short web summaries

Top-k aggregation using intersections of ranked inputs

Content Provider	ACM Digital Library
Author	Kumar, Ravi Punera, Kunal Suel, Torsten Vassilvitskii, Sergei
Abstract	There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this problem is query processing in search engines: One has to combine information from several different posting lists (rankings) of web pages (objects) to obtain the top k web pages to answer user queries. Two particularly well-studied approaches to achieve efficiency in top-k aggregation include early-termination algorithms (e.g., TA and NRA) and preaggregation of some of the input lists. However, there has been little work on a rigorous treatment of combining these approaches. We generalize the TA and NRA algorithms to the case when preaggregated intersection lists are available in addition to the original lists. We show that our versions of TA and NRA continue to remain "instance optimal," a very strong optimality notion that is a highlight of the original TA and NRA algorithms. Using an index of millions of web pages and real-world search engine queries, we empirically characterize the performance gains offered by our new algorithms. We show that the practical benefits of intersection lists can be fully realized only with an early-termination algorithm.
Starting Page	222
Ending Page	231
Page Count	10
File Format	PDF
ISBN	9781605583907
DOI	10.1145/1498759.1498830
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2009-02-09
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Early-termination Nra Intersections Ta
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Top-k aggregation using intersections of ranked inputs.

Top-k aggregation using intersections of ranked inputs (2009)

Efficient $top-\textit{k}$ aggregation of ranked inputs

Efficient Top-k Aggregation of Ranked Inputs

Ranking objects based on relationships

Efficient aggregation of ranked inputs (2006)

Ad-hoc aggregations of ranked lists in the presence of hierarchies

Faster top-k document retrieval using block-max indexes

Speeding up the nra algorithm.

Top-k aggregation using intersections of ranked inputs

Similar Documents

Top-k aggregation using intersections of ranked inputs.

Top-k aggregation using intersections of ranked inputs (2009)

Efficient $top-\textit{k}$ aggregation of ranked inputs

Efficient Top-k Aggregation of Ranked Inputs

Ranking objects based on relationships

Efficient aggregation of ranked inputs (2006)

Ad-hoc aggregations of ranked lists in the presence of hierarchies

Faster top-k document retrieval using block-max indexes

Speeding up the nra algorithm.

Top-k aggregation using intersections of ranked inputs