6,813 Hits in 9.0 sec

Reducing Query Latencies in Web Search Using Fine-Grained Parallelism

Eitan Frachtenberg
2009 World wide web (Bussum)  
Our group (Powerset) develops a semantic search engine that aims to answer queries not only by matching keywords, but by actually matching meaning in queries to meaning in Web documents.  ...  Our approach to tackle this challenge to exploit data parallelism in slow search queries to reduce their latency in multi-core systems.  ...  Acknowledgements I would like to thank my team at Powerset for their help and support, and in particular David Simpson for his work on the experimental framework, and Chad Walters for his numerous suggestions  ... 
doi:10.1007/s11280-009-0066-4 fatcat:75z747njuramxi36rxixeqiiey

Design of a Least Cost (LC) Vertical Search Engine based on Domain Specific Hidden Web Crawler

Sudhakar Ranjan, Komal Kumar Bhatia
2017 International Journal of Information Retrieval Research  
In this paper, architecture of a vertical search engine based on the domain specific hidden web crawler is proposed.  ...  To make a least cost vertical search engine improvement in the following techniques like: searching, indexing, ranking, transaction and query interface are suggested.  ...  In design of a least cost (LC) vertical search engine based on domain specific hidden web crawler through parallel computing reduced the cost.  ... 
doi:10.4018/ijirr.2017040102 fatcat:cpknlucp6vhjvpfngcfzlowkyq

A refreshing perspective of search engine caching

Berkant Barla Cambazoglu, Flavio P. Junqueira, Vassilis Plachouras, Scott Banachowski, Baoqiu Cui, Swee Lim, Bill Bridge
2010 Proceedings of the 19th international conference on World wide web - WWW '10  
Commercial Web search engines have to process user queries over huge Web indexes under tight latency constraints.  ...  Moreover, search engines need to update their indexes frequently to incorporate changes to the Web.  ...  Second, the number of user queries hitting the back-end search clusters drops, which reduces the amount of back-end hardware used.  ... 
doi:10.1145/1772690.1772710 dblp:conf/www/CambazogluJPBCLB10 fatcat:xsd7xmqgvfbrvafpaozzyucqby

Recent results in automatic Web resource discovery

Soumen Chakrabarti
1999 ACM Computing Surveys  
A query to HITS is forwarded to a search engine such as Alta Vista, which retrieves a subgraph of the web whose nodes (pages) match the query. Pages citing or cited by these pages are also included.  ...  HITS: Hyperlink induced topic search (HITS) [16] is slightly different: it does not crawl or pre-process the web, but depends on a search engine.  ... 
doi:10.1145/345966.346007 fatcat:jmzeoslzsrfitgaw42op2isnhu

New caching techniques for web search engines

Mauricio Marin, Veronica Gil-Costa, Carlos Gomez-Pantoja
2010 Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing - HPDC '10  
This paper proposes a cache hierarchy that enables Web search engines to efficiently process user queries.  ...  The different caches in the hierarchy are used to store pieces of data which are useful to solve frequent queries.  ...  As pointed out in [10] , the purpose of caching in Web search engines is to improve query throughput and thereby cache hits may well not be the relevant metric to optimize.  ... 
doi:10.1145/1851476.1851502 dblp:conf/hpdc/MarinCG10 fatcat:6exuhgpmvzcnpd75l5srvm7rma

Compact Snippet Caching for Flash-based Search Engines

Rui Zhang, Pengyu Sun, Jiancong Tong, Rebecca Jean Stones, Gang Wang, Xiaoguang Liu
2015 Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval - SIGIR '15  
In response to a user query, search engines return the topk relevant results, each of which contains a small piece of text, called a snippet, extracted from the corresponding document.  ...  In our experiments, we find around 10 times less memory is required to achieve comparable snippet generation times for dynamic memory, and we consistently achieve a vastly greater hit ratio for static  ...  INTRODUCTION Caching is an important method for reducing query latency in search engines.  ... 
doi:10.1145/2766462.2767764 dblp:conf/sigir/ZhangSTSWL15 fatcat:cvie7m7a3naidgh5ei3qlioexq

Propagating Expiration Decisions in a Search Engine Result Cache

Fethi Burak Sazoglu, Özgür Ulusoy, Ismail Sengor Altingovde, Rifat Ozcan, Berkant Barla Cambazoglu
2015 Proceedings of the 24th International Conference on World Wide Web - WWW '15 Companion  
Detecting stale queries in a search engine result cache is an important problem.  ...  In this work, we propose a mechanism that propagates the expiration decision for a query to similar queries in the cache to re-adjust their time-to-live values.  ...  This work is partially supported by the Ministry of Science, Industry and Technology of Turkey and Huawei Inc. under the grant no 0441.STZ.2013-2, and the Yahoo Faculty Research Engagement Program.  ... 
doi:10.1145/2740908.2742772 dblp:conf/www/SazogluUAOC15 fatcat:r46svwegsbdkvlqil4mhyccddu

Capacity Planning for Vertical Search Engines: An Approach Based on Coloured Petri Nets [chapter]

Veronica Gil-Costa, Jair Lobos, Alonso Inostrosa-Psijas, Mauricio Marin
2012 Lecture Notes in Computer Science  
In such systems a query submitted by a user goes through different stages and can be handled by three different kinds of nodes.  ...  This paper proposes a Colored Petri Net model capturing the behaviour of vertical search engines.  ...  Acknowledgment This work has been partially supported by FONDEF D09I1185 R&D project  ... 
doi:10.1007/978-3-642-31131-4_16 fatcat:zzshyh7irfd6fcreiqttkzeynq

Similarity Measurement Technique for Measuring the Performance of Page Rank Algorithm Based on Hadoop

2020 International journal of recent technology and engineering  
In this century big data manipulation is a challenging task in the field of web mining because content of web data is massively increasing day by day.  ...  Using search engine retrieving efficient, relevant and meaningful information from massive amount of Web Data is quite impossible.  ...  Archie gathered all scattered information and stored in a database then match with user query. Day by day various search engine launched. In 1998 search engine Google launched.  ... 
doi:10.35940/ijrte.e6843.018520 fatcat:5cnoc4tgarff7lssju3hxcmq74

Intelligent Agent Based Semantic Web in Cloud Computing Environment [article]

Debajyoti Mukhopadhyay, Manoj Sharma, Gajanan Joshi, Trupti Pagare, Adarsha Palwe
2013 arXiv   pre-print
Considering today's web scenario, there is a need of effective and meaningful search over the web which is provided by Semantic Web. Existing search engines are keyword based.  ...  They are vulnerable in answering intelligent queries from the user due to the dependence of their results on information available in web pages.  ...  Search Engines normally search web pages for the required information and then display the results by using ranking algorithms.  ... 
arXiv:1305.0939v1 fatcat:2wogxxjh6bacdhdp3y36lafzxe

Web search for a planet: the google cluster architecture

L.A. Barroso, J. Dean, U. Holzle
2003 IEEE Micro  
In particular, we acknowledge the work of Gerald Aigner, Ross Biro, Bogdan Cocosel, and Larry Page.  ...  Acknowledgments Over the years, many others have made contributions to Google's hardware architecture that are at least as significant as ours.  ...  Few Web services require as much computation per request as search engines. On average, a single query on Google reads hundreds of megabytes of data and consumes tens of billions of CPU cycles.  ... 
doi:10.1109/mm.2003.1196112 fatcat:g3n5yax2prap3pehcaq66ajflm

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  
Search engines span across content that is very dynamic and highly augmented with metadata to the tail content of the web.  ...  Maguro is part of the serving stack in Bing and allows us to scale the index significantly better.  ...  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

A Service-Based Architecture for Multi-domain Search on the Web [chapter]

Alessandro Bozzon, Marco Brambilla, Francesco Corcoglioniti, Salvatore Vadacca
2010 Lecture Notes in Computer Science  
Current search engines lack in support for multi-domain queries, i.e., queries that can be answered by combining information from two or more knowledge domains.  ...  In this paper we propose an architecture aiming at answering multi-domain queries through composition of search services and we provide facilities for the execution of multidomain queries and the visualization  ...  This research is part of the Search Computing (SeCo) project [], funded by the European Research Council.  ... 
doi:10.1007/978-3-642-17358-5_53 fatcat:vhiffwb46jcazgpxyyli3vhnom

A vector model for routing queries in web search engines

Mauricio S. Oyarzun, Senen Gonzalez, Marcelo Mendoza, Flavio Ferrarotti, Max Chacon, Mauricio Marin
2010 Procedia Computer Science  
This paper proposes a method for reducing the number of search nodes involved in the solution of queries arriving to a Web search engine.  ...  The method is applied by the query receptionist machine during situations of sudden peaks in query traffic to reduce the load on the search nodes.  ...  Conclusions This paper has proposed a vectorial method to solve Web queries in an approximated manner by using a fraction of the resources provided by a search engine composed of P search nodes.  ... 
doi:10.1016/j.procs.2010.04.049 fatcat:vtzkpz67obhljo26y642wnu42i

Reprint of: The anatomy of a large-scale hypertextual web search engine

Sergey Brin, Lawrence Page
2012 Computer Networks  
Search engines index tens to hundreds of millions of web pages involving a comparable number of distinct terms. They answer tens of millions of queries every day.  ...  Furthermore, due to rapid advance in technology and web proliferation, creating a web search engine today is very different from 3 years ago.  ...  With the increasing number of users on the web, and automated systems which query search engines, it is likely that top search engines will handle hundreds of millions of queries per day by the year 2000  ... 
doi:10.1016/j.comnet.2012.10.007 fatcat:a3qmfmrc4bgsbdbt5ugvdavcyq
« Previous Showing results 1 — 15 out of 6,813 results