Filters








4,847 Hits in 6.7 sec

Generating suggestions for queries in the long tail with an inverted index

Daniele Broccolo, Lorenzo Marcon, Franco Maria Nardini, Raffaele Perego, Fabrizio Silvestri
2012 Information Processing & Management  
Thus, it is particularly effective in generating suggestions for rare queries occurring in the long tail of the query popularity distribution.  ...  of a full-text query over an inverted index.  ...  Therefore we can generate suggestions for queries in the long tail of the distribution whose terms have some context in the query log used to build the model.  ... 
doi:10.1016/j.ipm.2011.07.005 fatcat:pl7y2q3d4ngw5mo4kt2rtsxqae

Maguro, a system for indexing and searching over very large text collections

Knut Magne Risvik, Trishul Chilimbi, Henry Tan, Karthik Kalyanaraman, Chris Anderson
2013 Proceedings of the sixth ACM international conference on Web search and data mining - WSDM '13  
A long tail distribution of content calls for different trade-offs in the design space for good efficiency across the entire index range.  ...  Maguro is designed for the long tail of content with less dynamics and less metadata, but very good cost efficiency.  ...  In addition, we would like to thank Qi Lu, Harry Shum, and Chad Walters for their support throughout the project.  ... 
doi:10.1145/2433396.2433486 dblp:conf/wsdm/RisvikCTKA13 fatcat:d2uz2xu7hvetlo4mjwdcsq63i4

Heavy-tailed distributions and multi-keyword queries

Surajit Chaudhuri, Kenneth Church, Arnd Christian König, Liying Sui
2007 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '07  
Intersecting inverted indexes is a fundamental operation for many applications in information retrieval and databases.  ...  Our evaluation on an e-commerce collection of 20 million products shows that the indexes of up to four arbitrary keywords can be intersected while accessing less than 20% of the postings in the largest  ...  For ease of exposition, we normalize the costs s.t. scanning a single posting in an inverted index has unit cost.  ... 
doi:10.1145/1277741.1277855 dblp:conf/sigir/ChaudhuriCKS07 fatcat:2e7xp3ocqfcafpyjii6pewb5ae

Fast Incremental Indexing for Full-Text Information Retrieval

Eric W. Brown, James P. Callan, W. Bruce Croft
1994 Very Large Data Bases Conference  
They often provide little or no support for adding new documents to an existing document collection, requiring instead that the entire collection be re-indexed.  ...  The data management facilities of the persistent object store are used to produce efficient incremental update of the inverted lists.  ...  Acknowledgements We gratefully acknowledge Eliot Moss and the anonymous referees for their comments and suggestions for improvements.  ... 
dblp:conf/vldb/BrownCC94 fatcat:de4udba7ufgbpeb6rre5bfwp7i

Efficient query recommendations in the long tail via center-piece subgraphs

Francesco Bonchi, Raffaele Perego, Fabrizio Silvestri, Hossein Vahabi, Rossano Venturini
2012 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval - SIGIR '12  
We present a recommendation method based on the wellknown concept of center-piece subgraph, that allows for the time/space efficient generation of suggestions also for rare, i.e., long-tail queries.  ...  More importantly, the quality of the recommendations generated remains very high also for long-tail queries, where other methods fail even to produce any suggestion.  ...  Furthermore, we represent the model in an inverted index and we show that several engineering practices used for inverted indexes are inherited by our model as well.  ... 
doi:10.1145/2348283.2348332 dblp:conf/sigir/BonchiPSVV12 fatcat:6yjh6rgx7zfx3g3yssehij7sum

Online expansion of rare queries for sponsored search

Andrei Broder, Peter Ciccolo, Evgeniy Gabrilovich, Vanja Josifovski, Donald Metzler, Lance Riedel, Jeffrey Yuan
2009 Proceedings of the 18th international conference on World wide web - WWW '09  
In practice, such algorithms are applied offline to popular queries, with the results of the expensive operations cached for fast access at query time.  ...  The approach builds an expanded query representation by leveraging offline processing done for related popular queries.  ...  Acknowledgments We thank Ann Hsieh and her editorial team for judging the ad relevance under a very tight schedule. We also thank the anonymous reviewers for their comments and suggestions.  ... 
doi:10.1145/1526709.1526778 dblp:conf/www/BroderCGJMRY09 fatcat:6zm6nh4bqfa3jgeoafgur7l4gq

OLAP on search logs

Bin Zhou, Daxin Jiang, Jian Pei, Hang Li
2009 Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '09  
An empirical study using real data of over two billion query sessions demonstrates the usefulness and feasibility of our design.  ...  Recently, more and more data-driven applications are being developed in search engines based on search logs, such as query suggestion, keyword bidding, and dissatisfactory query analysis.  ...  In general, to conduct the forward search for a query sequence of length l, the inverted list approach needs to look up the inverted lists for sequences of length l + 1.  ... 
doi:10.1145/1557019.1557168 dblp:conf/kdd/ZhouJPL09 fatcat:xg3hse6vwjeubc4vcpvcypfpzy

Fast evaluation of structured queries for information retrieval

Eric W. Brown
1995 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '95  
We present a new structured query optimization technique which we have implemented in an inference network-based information retrieval system.  ...  Structured queries are not amenable to previously proposed optimization techniques. Optimizing execution, however, is even more important in the context of large document collections.  ...  Acknowledgements Thanks go to Jamie CalIan for his helpful comments on early drafts of this paper, Bruce Croft for his guidance throughout this work, and the staff and students of CIIR for their work on  ... 
doi:10.1145/215206.215329 dblp:conf/sigir/Brown95 fatcat:u4wgjdios5chnbjmy655n3uy3i

RGU-ISTI-Essex at TREC 2011 Session Track

Ibrahim Adeyanju, Dawei Song, Franco Maria Nardini, M-Dyaa Albakour, Udo Kruschwitz
2011 Text Retrieval Conference  
The Search Shortcuts technique uses an inverted index and the concept of "successful sessions" present in a web search engine's query log to produce effective recommendations for both frequent and rare  ...  The expansion is generated by using a method which aims to consider all past queries in the session.  ...  Acknowledgements This research is part of the AutoAdapt research project. AutoAdapt is funded by EPSRC grants EP/F035357/1 and EP/F035705/1.  ... 
dblp:conf/trec/AdeyanjuSNAK11 fatcat:3dppfvvm2jhcpmvbqtuvbhvmka

When entities meet query recommender systems

Diego Ceccarelli, Sergiu Gordea, Claudio Lucchese, Franco Maria Nardini, Raffale Perego
2013 Proceedings of the 28th Annual ACM Symposium on Applied Computing - SAC '13  
query recommendation algorithm to take into account the semantic information associated with the submitted queries.  ...  Our novel method generates highly related and diversified suggestions. We assess it by means of a new evaluation technique.  ...  Acknowledgements We acknowledge the Europeana Foundation for providing us the query logs used in our experimentation. This work was partially supported by the EU project InGeoCLOUDS (no. 297300).  ... 
doi:10.1145/2480362.2480540 dblp:conf/sac/CeccarelliGLNP13 fatcat:jxvzhv2kqzhzxd3vhokhlamnei

The Case for a Hybrid P2P Search Infrastructure [chapter]

Boon Thau Loo, Ryan Huebsch, Ion Stoica, Joseph M. Hellerstein
2005 Lecture Notes in Computer Science  
Through extensive measurements of the Gnutella network from multiple vantage points, we argue for a hybrid search solution, where structured search techniques are used to index and locate rare items, and  ...  As an alternative, a wide variety of structured P2P networks such as distributed hash tables (DHTs) have been recently proposed.  ...  their insights and suggestions.  ... 
doi:10.1007/978-3-540-30183-7_14 fatcat:dauuehuy3jexfgjl3v7accgdgu

Fast, Incremental Inverted Indexing in Main Memory for Web-Scale Collections [article]

Nima Asadi, Jimmy Lin
2013 arXiv   pre-print
In this context, we present a novel incremental inverted indexing algorithm for web-scale collections that directly constructs compressed postings lists in memory.  ...  For text retrieval systems, the assumption that all data structures reside in main memory is increasingly common.  ...  We experimentally show that for relatively small values of m, around 6 or 7, we achieve query evaluation speeds that are statistically indistinguishable from having an index with fully-contiguous inverted  ... 
arXiv:1305.0699v1 fatcat:oy5krcryyzf5zfvaptkxwgpqai

What, where, and when

Sergey Nepomnyachiy, Bluma Gelley, Wei Jiang, Tehila Minkus
2014 Proceedings of the 8th Workshop on Geographic Information Retrieval - GIR '14  
In the case of Twitter, many tweets are tagged with location information as well as timestamps, creating a demand for query processors that can search both of these dimensions along with text.  ...  With the adoption of timestamps and geotags on Web data, search engines are increasingly being asked questions of "where" and "when" in addition to the classic "what."  ...  The authors also thank Juliana Freire and Dmitri Gromov for their contributions to this paper.  ... 
doi:10.1145/2675354.2675358 dblp:conf/gir/NepomnyachiyGJM14 fatcat:e7mrj576uvdennsmxajmjq6wh4

Incremental updates of inverted lists for text document retrieval

Anthony Tomasic, Héctor García-Molina, Kurt Shoens
1994 Proceedings of the 1994 ACM SIGMOD international conference on Management of data - SIGMOD '94  
The index dynamically separates long and short inverted lists and optimizes the retrieval, update, and storage of each t ype of list.  ...  With the proliferation of the world's \information highways" a renewed interest in e cient document indexing techniques has come about.  ...  Invert Index The invert index process accepts a sequence of document b a t c hes as input, processes them, and generates a batch update for each batch.  ... 
doi:10.1145/191839.191896 dblp:conf/sigmod/TomasicGS94 fatcat:uzxkp5wfuvaq3jcarofspj5rty

Incremental updates of inverted lists for text document retrieval

Anthony Tomasic, Héctor García-Molina, Kurt Shoens
1994 SIGMOD record  
The index dynamically separates long and short inverted lists and optimizes the retrieval, update, and storage of each t ype of list.  ...  With the proliferation of the world's \information highways" a renewed interest in e cient document indexing techniques has come about.  ...  Invert Index The invert index process accepts a sequence of document b a t c hes as input, processes them, and generates a batch update for each batch.  ... 
doi:10.1145/191843.191896 fatcat:lfaiujctzfgfbmntadjxwiok2q
« Previous Showing results 1 — 15 out of 4,847 results