2017
DOI: 10.1016/j.future.2016.02.014
|View full text |Cite
|
Sign up to set email alerts
|

EDS: An Efficient Data Selection policy for search engine storage architectures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 22 publications
0
1
0
Order By: Relevance
“…Baeza-Yates and Jonassen [14] suggested an optimal way to split a given stored space for the result cache and the list cache. Dong et al [18] proposed new data selection for caching results and posting lists, and designed a two-level cache architecture. SSD was used as a secondary memory in this architecture in order to improve the performance of search engines.…”
Section: Related Workmentioning
confidence: 99%
“…Baeza-Yates and Jonassen [14] suggested an optimal way to split a given stored space for the result cache and the list cache. Dong et al [18] proposed new data selection for caching results and posting lists, and designed a two-level cache architecture. SSD was used as a secondary memory in this architecture in order to improve the performance of search engines.…”
Section: Related Workmentioning
confidence: 99%