@inproceedings{10.1007/978-3-642-12275-0-26,
    abstract = "Web search engines are composed of a large set of search nodes and a broker machine that feeds them with queries. A location cache keeps minimal information in the broker to register the search nodes capable of producing the top-N results for frequent queries. In this paper we show that it is possible to use the location cache as a training dataset for a standard machine learning algorithm and build a predictive model of the search nodes expected to produce the best approximated results for queries. This can be used to prevent the broker from sending queries to all search nodes under situations of sudden peaks in query traffic and, as a result, avoid search node saturation. This paper proposes a logistic regression model to quickly predict the most pertinent search nodes for a given query. © 2010 Springer-Verlag Berlin Heidelberg.",
    year = "2010",
    title = "Learning to distribute queries into web search nodes",
    volume = "5993 LNCS",
    pages = "281-292",
    doi = "10.1007/978-3-642-12275-0-26",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"
}

{"_id":"iBLPePiThh4MnfngK","bibbaseid":"anonymous-learningtodistributequeriesintowebsearchnodes-2010","downloads":0,"creationDate":"2017-03-31T20:15:32.969Z","title":"Learning to distribute queries into web search nodes","author_short":null,"year":2010,"bibtype":"inproceedings","biburl":"https://1fichier.com/?j9cpurkmnv","bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"Web search engines are composed of a large set of search nodes and a broker machine that feeds them with queries. A location cache keeps minimal information in the broker to register the search nodes capable of producing the top-N results for frequent queries. In this paper we show that it is possible to use the location cache as a training dataset for a standard machine learning algorithm and build a predictive model of the search nodes expected to produce the best approximated results for queries. This can be used to prevent the broker from sending queries to all search nodes under situations of sudden peaks in query traffic and, as a result, avoid search node saturation. This paper proposes a logistic regression model to quickly predict the most pertinent search nodes for a given query. © 2010 Springer-Verlag Berlin Heidelberg.","year":"2010","title":"Learning to distribute queries into web search nodes","volume":"5993 LNCS","pages":"281-292","doi":"10.1007/978-3-642-12275-0-26","booktitle":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","bibtex":"@inproceedings{10.1007/978-3-642-12275-0-26,\n abstract = \"Web search engines are composed of a large set of search nodes and a broker machine that feeds them with queries. A location cache keeps minimal information in the broker to register the search nodes capable of producing the top-N results for frequent queries. In this paper we show that it is possible to use the location cache as a training dataset for a standard machine learning algorithm and build a predictive model of the search nodes expected to produce the best approximated results for queries. This can be used to prevent the broker from sending queries to all search nodes under situations of sudden peaks in query traffic and, as a result, avoid search node saturation. This paper proposes a logistic regression model to quickly predict the most pertinent search nodes for a given query. © 2010 Springer-Verlag Berlin Heidelberg.\",\n year = \"2010\",\n title = \"Learning to distribute queries into web search nodes\",\n volume = \"5993 LNCS\",\n pages = \"281-292\",\n doi = \"10.1007/978-3-642-12275-0-26\",\n booktitle = \"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)\"\n}\n\n","key":"10.1007/978-3-642-12275-0-26","id":"10.1007/978-3-642-12275-0-26","bibbaseid":"anonymous-learningtodistributequeriesintowebsearchnodes-2010","urls":{},"downloads":0,"html":""},"search_terms":["learning","distribute","queries","web","search","nodes"],"keywords":[],"authorIDs":[],"dataSources":["gKiCRHjjC2iGthGEx"]}