NDLI: Answering keyword queries through cached subqueries in best match retrieval models

Content Provider	Springer Nature Link
Author	Papadakis, Myron Tzitzikas, Yannis
Copyright Year	2014
Abstract	Caching is one of the techniques that Information Retrieval Systems (IRS) and Web Search Engines (WSEs) use to reduce processing costs and attain faster response times. In this paper we introduce Top-K SCRC (Set Cover Results Cache), a novel technique for results caching which aims at maximizing the utilization of cache. Identical queries are treated as in plain results caching (i.e. their evaluation does not require accessing the index), while combinations of cached sub-queries are exploited as in posting lists caching, however the exploited subqueries are not necessarily single-word queries. The problem of finding the right set of cached subqueries to answer an incoming query, is actually the Exact Set Cover problem. This technique can be applied in any best match retrieval model that is based on a decomposable scoring function, and we show that several best-match retrieval models (i.e VSM, Okapi BM25 and hybrid retrieval models) rely on such scoring functions. To increase the capacity (in queries) of the cache only the top-K results of each cached query are stored and we introduce metrics for measuring the accuracy of the composed top-K answer. By analyzing queries submitted to real-world WSEs, we verified that there is a significant proportion of queries whose terms is the result of a union of the terms of other queries. The comparative evaluation over traces of real query sets showed that the Top-K SCRC is on the average two times faster than a plain Top-K RC for the same cache size.
Starting Page	67
Ending Page	106
Page Count	40
File Format	PDF
ISSN	09259902
Journal	Journal of Intelligent Information Systems
Volume Number	44
Issue Number	1
e-ISSN	15737675
Language	English
Publisher	Springer US
Publisher Date	2014-07-31
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Information retrieval Query Processing Retrieval Models Ranking Web search engines Query log analysis Information Storage and Retrieval Data Structures, Cryptology and Information Theory Artificial Intelligence (incl. Robotics) IT in Business Document Preparation and Text Processing
Content Type	Text
Resource Type	Article
Subject	Artificial Intelligence Computer Networks and Communications Information Systems Software Hardware and Architecture

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

Processing skyline queries in incomplete distributed databases

Efficient pruning for top-K ranking queries on attribute-wise uncertain datasets

Answering form-based web queries using the data-mining approach

Interactive search over Web scale RDF data using predicates as constraints

Click efficiency: a unified optimal ranking for online Ads and documents

Semantic-distance based evaluation of ranking queries over relational databases

Intelligent answering location questions from the web using molecular alignment

Provisional reporting for rank joins

Improving Federated Database Queries Using Declarative Rewrite Rules for Quantified Subqueries

Answering keyword queries through cached subqueries in best match retrieval models

Similar Documents

Processing skyline queries in incomplete distributed databases

Efficient pruning for top-K ranking queries on attribute-wise uncertain datasets

Answering form-based web queries using the data-mining approach

Interactive search over Web scale RDF data using predicates as constraints

Click efficiency: a unified optimal ranking for online Ads and documents

Semantic-distance based evaluation of ranking queries over relational databases

Intelligent answering location questions from the web using molecular alignment

Provisional reporting for rank joins

Improving Federated Database Queries Using Declarative Rewrite Rules for Quantified Subqueries

Answering keyword queries through cached subqueries in best match retrieval models