Abstract
Queries to a search engine follow a power-law distribution, which is far from uniform. Hence, it is natural to adapt a search engine index to the query distribution. In this paper we present a three level memory organization for a search engine inverted file index that includes main and secondary memory, as well as precomputed answers, such that the use of main memory and the answer time are significantly improved. We include experimental results as well as an analytical model. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Baeza-Yates, R., & Saint-Jean, F. (2003). A three level search engine index based in query log distribution. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2857, 56–65. https://doi.org/10.1007/978-3-540-39984-1_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
